// Root
		idx := strings.Index(e.name, separator)
		return idx == -1 || idx == len(e.name)-len(separator)
	}
	ext := strings.TrimPrefix(e.name, dir)
	if len(ext) != len(e.name) {
		idx := strings.Index(ext, separator)
		// If separator is not found or is last entry, ok.
		return idx == -1 || idx == len(ext)-len(separator)
	}
	return false
}

// isLatestDeletemarker returns whether the latest version is a delete marker.

  }

  @CollectionFeature.Require(SUPPORTS_ITERATOR_REMOVE)
  @CollectionSize.Require(ONE)
  public void testValuesIteratorRemove() {
    Iterator<V> valuesItr = multimap().values().iterator();
    valuesItr.next();
    valuesItr.remove();
    assertTrue(multimap().isEmpty());
  }

    assertThrows(
        ConcurrentModificationException.class,
        () -> {
          Iterator<E> iterator = collection.iterator();
          collection.clear();
          iterator.next();
        });
  }

        if (r1.size() != r2.size()) {
            return false;
        }

        for (Iterator<ArtifactRepository> it1 = r1.iterator(), it2 = r2.iterator(); it1.hasNext(); ) {
            if (!repositoryEquals(it1.next(), it2.next())) {
                return false;
            }
        }

        return true;
    }

    /**
     * CacheRecord
     */
    public class CacheRecord {

                }
            } catch (final IOException e) {
                last = e;
                log.debug("Referral failed, trying next", e);
            }

            if (dr != null) {
                dr = dr.next();
            }
        } while (dr != start);
        throw last;
    }

    /**
     * @param loc
     * @param addr
     * @param trans

    void setRequestCredits(int credits);

    /**
     * Checks if this is a cancel request.
     *
     * @return whether this is a cancel request
     */
    boolean isCancel();

    /**
     * Gets the next request in the chain.
     *
     * @return chained request
     */
    Request getNext();

    /**
     * Gets the response for this request.
     *
     * @return the response for this request
     */

        assertEquals(unicodeName, notifications.get(0).getFileName());
    }

    @Test
    @DisplayName("Should handle malformed next entry offset")
    void testMalformedNextEntryOffset() throws Exception {
        // Given - notification with invalid next entry offset
        byte[] buffer = new byte[512];
        int offset = 0;

        setHeaderStart(response, 64);

        // Write structure

   */
  public HashingInputStream(HashFunction hashFunction, InputStream in) {
    super(checkNotNull(in));
    this.hasher = checkNotNull(hashFunction.newHasher());
  }

  /**
   * Reads the next byte of data from the underlying input stream and updates the hasher with the
   * byte read.
   */
  @Override
  @CanIgnoreReturnValue
  public int read() throws IOException {
    int b = in.read();
    if (b != -1) {

    }

    @Override
    public int encode(byte[] buffer, int offset) {
        int start = offset;

        // Write context header
        SMBUtil.writeInt4(0, buffer, offset); // Next (offset to next context, 0 for last)
        offset += 4;

        SMBUtil.writeInt2(16, buffer, offset); // NameOffset (from start of context)
        offset += 2;

			if len(healDisks) == 0 {
				// Reset for next interval.
				diskCheckTimer.Reset(defaultMonitorNewDiskInterval)
				continue
			}

			// Reformat disks immediately
			_, err := z.HealFormat(context.Background(), false)
			if err != nil && !errors.Is(err, errNoHealRequired) {
				healingLogIf(ctx, err)
				// Reset for next interval.
				diskCheckTimer.Reset(defaultMonitorNewDiskInterval)