// Act & Assert: entries a, b, c (dot entries filtered) then end
        assertTrue(it.hasNext());
        assertEquals("a", it.next().getName());
        assertTrue(it.hasNext());
        assertEquals("b", it.next().getName());
        assertTrue(it.hasNext());
        assertEquals("c", it.next().getName());
        assertFalse(it.hasNext());

        // Verify interactions

     */
    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);

                assertEquals(i + 1, buffer[i]);
            }

            // Next read will try to read header and should fail
            assertThrows(IOException.class, () -> sis.read(buffer, 0, 10));
        } catch (IOException e) {
            // This is also acceptable - if the implementation tries to read
            // the next header immediately after consuming all data

        // Arrange
        NbtAddress nbtMock = mock(NbtAddress.class);
        when(nbtMock.nextCalledName()).thenReturn("NEXT");
        UniAddress ua = new UniAddress(nbtMock);
        // Act
        String next = ua.nextCalledName();
        // Assert
        assertEquals("NEXT", next, "nextCalledName should delegate to NbtAddress when called");
    }

    @Test

     * stack so that it is returned by the next call to {@link Iterator#next()}. If the element is
     * not in {@link #nextElements}, this method throws an {@link UnknownElementException}.
     *
     * <p>This method is used when testing iterators without a known ordering. We poll the target
     * iterator's next element and pass it to the reference iterator through this method so it can

        assertSame(fe1, it.next(), "First element must match first page");
        assertTrue(it.hasNext(), "Iterator should have second element");
        assertSame(fe2, it.next(), "Second element must match first page");

        // Next page fetched via fetchMore()
        assertTrue(it.hasNext(), "Iterator should have third element after fetchMore");
        assertSame(fe3, it.next(), "Third element from second page");

    }

    /**
     * Returns true if a next page exists.
     *
     * @return True if a next page exists.
     */
    public boolean isExistNextPage() {
        return existNextPage;
    }

    /**
     * Sets whether a next page exists.
     *
     * @param existNextPage True if a next page exists.
     */
    public void setExistNextPage(final boolean existNextPage) {

   * remain. This method is invoked during each call to {@link #next()} in order to compute the
   * result of a <i>future</i> call to {@code next()}.
   */
  protected abstract @Nullable T computeNext(T previous);

  @Override
  public final boolean hasNext() {
    return nextOrNull != null;
  }

  @Override
  public final T next() {
    if (nextOrNull == null) {
      throw new NoSuchElementException();

     */
    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
     */

   */
  public abstract @Nullable C previous(C value);

  /**
   * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
   * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
   * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}
   * and {@code distance(end, start) == -3}. As well, {@code distance(a, a)} is always zero.
   *