// Read Next field to determine if there are more entries
            int next = SMBUtil.readInt4(buffer, bufferIndex);

            NetworkInterfaceInfo info = NetworkInterfaceInfo.decode(buffer, bufferIndex);
            if (info != null) {
                interfaces.add(info);
            }

            if (next == 0) {
                // Last entry - advance by the full structure size

    }

    @Test
    @DisplayName("Should get next referral")
    void testNext() {
        // Given
        DfsReferralData nextReferral = mock(DfsReferralData.class);
        when(mockReferralData.next()).thenReturn(nextReferral);

        // When
        DfsReferralData result = mockReferralData.next();

        // Then
        assertEquals(nextReferral, result);

            n.clearFlags(SMB2_FLAGS_RELATED_OPERATIONS);
        }
        return n;
    }

    /**
     * Sets the next request in the compound chain.
     *
     * @param next the next request
     */
    public void setNext(final ServerMessageBlock2Request<?> next) {
        super.setNext(next);
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.util.transport.Request#getCreditCost()
     */

     */
    boolean isAsync();

    /**
     *
     * @return the next response
     */
    @Override
    CommonServerMessageBlockResponse getNextResponse();

    /**
     * Prepares this response for the next request.
     *
     * @param next the next request to prepare for
     */
    void prepare(CommonServerMessageBlockRequest next);

      int initialSize = map.size();
      boolean didRemove = entrySet.remove(entrySet.iterator().next());
      assertTrue(didRemove);
      assertEquals(initialSize - 1, map.size());
    } else {
      assertThrows(
          UnsupportedOperationException.class, () -> entrySet.remove(entrySet.iterator().next()));
    }
    assertInvariants(map);
  }

  public void testEntrySetRemoveMissingKey() {

                    }

                    DfsReferralDataInternal next = dr;
                    do {
                        next.stripPathConsumed(1 + domain.length() + 1 + root.length());
                        next = next.next();
                    } while (next != dr);

                    if (dr.getPathConsumed() > (path != null ? path.length() : 0)) {

    assertEquals(
        "multiset.entrySet() iterator.next() returned incorrect entry",
        Multisets.immutableEntry(e0(), 1),
        iterator.next());
    assertFalse(
        "size 1 multiset.entrySet() iterator.hasNext() returned true after next()",
        iterator.hasNext());
    iterator.remove();
    assertTrue(

	if w.nextOffset == offset {
		n, err = w.w.Write(b)
		w.nextOffset += int64(n)
	} else {
		if offset > w.nextOffset+ftpMaxWriteOffset {
			return 0, fmt.Errorf("write offset %d is too far ahead of next offset %d", offset, w.nextOffset)
		}
		w.buffer[offset] = make([]byte, len(b))
		copy(w.buffer[offset], b)
		n = len(b)
	}

again:
	nextOut, ok := w.buffer[w.nextOffset]
	if ok {

          return this;
        case CLOSED:
          C next = domain.next(endpoint);
          return (next == null) ? Cut.belowAll() : belowValue(next);
      }
      throw new AssertionError();
    }

    @Override
    Cut<C> withUpperBoundType(BoundType boundType, DiscreteDomain<C> domain) {
      switch (boundType) {
        case OPEN:
          C next = domain.next(endpoint);

     */
    public boolean chain(final ServerMessageBlock2 n) {
        if (this.next != null) {
            return this.next.chain(n);
        }

        n.addFlags(SMB2_FLAGS_RELATED_OPERATIONS);
        this.next = n;
        return true;
    }

    /**
     * Gets the next message in the compound chain.
     *
     * @return the next message or null if this is the last message
     */