final int nexts = str.indexOf('[', si + 1);
                        final int nexte = str.indexOf(']', si);
                        if (nexts >= 0 && nexte >= 0 && nexte == nexts - 1) {
                            server = str.substring(si, nexte + 1);
                            si = nexts;
                        } else {
                            server = "127.0.0.1";

                assertFalse(iterator3.hasNext(), "Third instance should have no elements");

                assertNull(iterator1.next(), "First instance next() should return null");
                assertNull(iterator2.next(), "Second instance next() should return null");
                assertNull(iterator3.next(), "Third instance next() should return null");
            } catch (CIFSException e) {
                throw new RuntimeException(e);
            }

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

    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) {

                    }

                    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)) {

     */
    CommonServerMessageBlockRequest createCancel();

    /**
     * Checks if chaining is allowed with the next request.
     *
     * @param next the next request in the chain
     * @return whether to allow chaining
     */
    boolean allowChain(CommonServerMessageBlockRequest next);

    /**
     * Sets the tree ID.
     *
     * @param t the tree ID to set
     */
    void setTid(int t);

    }

    @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);

        this.existPrePage = existPrePage;
    }

    /**
     * Checks if there is a next page.
     * @return true if next page exists, false otherwise
     */
    public boolean isExistNextPage() {
        return existNextPage;
    }

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

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

    }

    /**
     * Checks if a next page exists.
     *
     * @return true if a next page exists, false otherwise
     */
    public boolean isExistNextPage() {
        return existNextPage;
    }

    /**
     * Sets whether a next page exists.
     *
     * @param existNextPage true if a next page exists, false otherwise
     */