// Given
        Trans2FindNext2 next = new Trans2FindNext2(0x0101, 0, "name");
        byte[] buf = new byte[16];

        // When/Then
        assertEquals(0, next.readSetupWireFormat(buf, 0, buf.length));
        assertEquals(0, next.readParametersWireFormat(buf, 0, buf.length));
        assertEquals(0, next.readDataWireFormat(buf, 0, buf.length));
        assertEquals(0, next.writeDataWireFormat(buf, 0));
    }

     */
    @Override
    public boolean hasNext() {
        return this.next != null;
    }

    /**
     * {@inheritDoc}
     *
     * @see java.util.Iterator#next()
     */
    @Override
    public FileEntry next() {
        final FileEntry n = this.next;
        try {
            final FileEntry ne = advance(false);
            if (ne == null) {

     */
    @Override
    public boolean hasNext() {
        return this.next != null;
    }

    /**
     * {@inheritDoc}
     *
     * @see java.util.Iterator#next()
     */
    @Override
    public FileEntry next() {
        final FileEntry n = this.next;
        try {
            final FileEntry ne = advance();
            if (ne == null) {

     */
    @Override
    public boolean hasNext() {
        return this.next != null;
    }

    /**
     * {@inheritDoc}
     *
     * @see java.util.Iterator#next()
     */
    @Override
    public SmbResource next() {
        final SmbResource n = this.next;
        this.next = advance();
        return n;
    }

    /**
     * {@inheritDoc}
     *

    bimap.put(1, "one");
    bimap.put(2, "two");
    bimap.put(3, "three");
    Iterator<Integer> iterator = bimap.keySet().iterator();
    iterator.next();
    iterator.next();
    iterator.remove();
    iterator.next();
    iterator.remove();
    assertEquals(1, bimap.size());
    assertEquals(1, bimap.inverse().size());
  }

    T result = uncheckedCastNullableTToT(next);
    next = null;
    return result;
  }

  @Override
  public final void remove() {
    throw new UnsupportedOperationException();
  }

	p.readers = tmp
	// next is the next non-preferred index.
	next := 0
	for i, ok := range prefer {
		if !ok || p.readers[i] == nil {
			continue
		}
		if i == next {
			next++
			continue
		}
		// Move reader with index i to index next.
		// Do this by swapping next and i
		p.readers[next], p.readers[i] = p.readers[i], p.readers[next]
		p.readerToBuf[next] = i
		p.readerToBuf[i] = next
		next++

    public long expiration;

    /** The next DFS referral in the chain */
    DfsReferral next;
    /** Map containing DFS referral entries */
    Map map;
    /** The cache key for this referral */
    String key = null;

    /**
     * Constructs a new DfsReferral instance
     */
    public DfsReferral() {
        this.next = this;
    }

    void append(final DfsReferral dr) {

    var unionWith: Mapping = mapping
    index++

    while (index < mappings.size) {
      val next = mappings[index]

      if (type != canonicalizeType(next.type)) break
      if (type == TYPE_MAPPED && mappedTo != next.mappedTo) break

      unionWith = next
      index++
    }

    result +=
      Mapping(
        sourceCodePoint0 = mapping.sourceCodePoint0,

        when(delegate.hasNext()).thenReturn(true, true, false);
        when(delegate.next()).thenReturn(bad, good);

        NetServerFileEntryAdapterIterator itr = new NetServerFileEntryAdapterIterator(parent, delegate, null);

        // Act: first valid next should be the second element
        assertTrue(itr.hasNext());
        SmbResource r = itr.next();

        // Assert: the invalid name was skipped, valid one returned