assertTrue(reader.markSupported());

    assertEquals(string, readFully(reader));
    assertFullyRead(reader);

    // reset and read again
    reader.reset();
    assertEquals(string, readFully(reader));
    assertFullyRead(reader);

    // reset, skip, mark, then read the rest
    reader.reset();
    assertEquals(5, reader.skip(5));
    reader.mark(Integer.MAX_VALUE);
    assertEquals(string.substring(5), readFully(reader));

        SmbTree tree4 = new SmbTree(session, "testShare", "otherService");

        // Test equal trees (same share and service)
        assertEquals(tree1, tree2);

        // Test non-equal trees (different share)
        assertNotEquals(tree1, tree3);

        // Test non-equal trees (different service)
        assertNotEquals(tree1, tree4);

        // Test with different object type

            if (request != null) {
                log.debug("Resetting request");
                request.reset();
            }
            if (rpath != null) {
                // resolveDfs() and tree.send() modify the request packet.
                // I want to restore it before retrying. request.reset()
                // restores almost everything that was modified, except the path.
                rpath.setPath(savedPath);

report

// republican : Dog Beach, LLC
// https://www.iana.org/domains/root/db/republican.html
republican

// rest : Punto 2012 Sociedad Anonima Promotora de Inversion de Capital Variable
// https://www.iana.org/domains/root/db/rest.html
rest

// restaurant : Binky Moon, LLC
// https://www.iana.org/domains/root/db/restaurant.html
restaurant

// review : dot Review Limited

   * method has different behavior than {@link TreeSet#TreeSet(SortedSet)}, which returns a {@code
   * TreeSet} with that comparator.
   *
   * <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated. Instead,
   * use the {@code TreeSet} constructor directly, taking advantage of <a

                NavigableSet<String> innerSet = new TreeSet<>();
                Collections.addAll(innerSet, elements);
                return Collections.checkedNavigableSet(innerSet, String.class);
              }
            })
        .named("checkedNavigableSet/TreeSet, natural")
        .withFeatures(
            SetFeature.GENERAL_PURPOSE,

                    throw new SmbException("Account '" + username + "' is locked out until " + account.getLockoutExpiry());
                } else {
                    // Lockout expired, reset
                    account.reset();
                }
            }
        }

        // Check per-IP limit
        if (sourceIp != null) {

        assertEquals(State.OPEN, circuitBreaker.getState(), "Circuit should be OPEN");

        // Manually reset
        circuitBreaker.reset();
        assertEquals(State.CLOSED, circuitBreaker.getState(), "Circuit should be CLOSED after reset");
        assertEquals(0, circuitBreaker.getFailureCount(), "Failure count should be reset");
    }

    @Test
    public void testCustomFailureDetection() throws CIFSException {

    assertEquals("9.999 \u03bcs", stopwatch.toString());
    stopwatch.reset();
    stopwatch.start();
    ticker.advance(1234567);
    assertEquals("1.235 ms", stopwatch.toString());
    stopwatch.reset();
    stopwatch.start();
    ticker.advance(5000000000L);
    assertEquals("5.000 s", stopwatch.toString());
    stopwatch.reset();
    stopwatch.start();
    ticker.advance((long) (1.5 * 60 * 1000000000L));

     * Creates and returns a new instance of {@link TreeSet}.
     *
     * @param <E> the element type of {@link TreeSet}
     * @return a new instance of {@link TreeSet}
     * @see TreeSet#TreeSet()
     */
    public static <E> TreeSet<E> newTreeSet() {
        return new TreeSet<>();
    }

    /**
     * Creates and returns a new instance of {@link TreeSet}.
     *