return 0;
        }
    }

    @Test
    @DisplayName("Happy path: iterates and adapts entries without filter")
    void happyPath_noFilter_returnsAdaptedResources() throws Exception {
        // Arrange: two valid entries
        setupParentForUrlCreation();
        StubFileEntry e1 = new StubFileEntry("SERVER1", SmbConstants.TYPE_SERVER);
        StubFileEntry e2 = new StubFileEntry("SERVER2", SmbConstants.TYPE_SERVER);

    class BasicTests {

        @Test
        @DisplayName("Textual constructor happy path and toString consistency")
        void testTextualConstructorAndToString() throws Exception {
            // Arrange
            SID sid = new SID("S-1-5-21-1-2-3-1029");

            // Act & Assert
            // toString should reconstruct exact textual form
            assertEquals("S-1-5-21-1-2-3-1029", sid.toString());

    @ParameterizedTest
    @MethodSource("intErrorCodes")
    @DisplayName("int ctor: sets message and NT status as expected")
    void intConstructor_populatesMessageAndStatus(int errCode, int expectedStatus) {
        // Arrange & Act: create exception with error code
        SmbAuthException ex = new SmbAuthException(errCode);

        // Assert: type, message derived from code, status mapping, and no cause
        assertNotNull(ex);

    @DisplayName("renew() behaviors across implementations")
    void renewBehaviorsAcrossImplementations(String label, Supplier<SmbRenewableCredentials> supplier, boolean expectSame,
            boolean expectNew) {
        // Arrange: create an implementation instance
        SmbRenewableCredentials impl = supplier.get();

        // Act: call renew
        CredentialsInternal renewed = impl.renew();

publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients.  "Knowingly relying" means you have

    //@Maxbytelength(maxbytelength = 1000)
    public String url;

    /** Minimum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMin;

    /** Maximum error count filter for searching failure URLs. */
    //@IntRange(min = 0, max = 2147483647)
    public String errorCountMax;

    /** Error name filter for searching failure URLs. */

    @DisplayName("unwrap, domain, anonymous/guest flags happy paths")
    void unwrap_and_flags_happy(boolean[] flags) {
        boolean anonymous = flags[0];
        boolean guest = flags[1];

        // Arrange
        Subject subject = new Subject();
        TestCredentials creds = new TestCredentials("DOMAIN", anonymous, guest, subject, false);

        // Act & Assert

    assertEquals(
        ImmutableMap.of(Range.open(3, 7), 1, Range.closed(7, 10), 2, Range.closed(12, 16), 3),
        rangeMap.asMapOfRanges());

    sub.putCoalescing(Range.singleton(7), 1);
    assertEquals(
        ImmutableMap.of(Range.closed(5, 7), 1, Range.openClosed(7, 10), 2), sub.asMapOfRanges());
    assertEquals(
        ImmutableMap.of(

    assertTrue(rangeSet.intersects(Range.closed(3, 4)));
    assertTrue(rangeSet.intersects(Range.closedOpen(0, 2)));
    assertTrue(rangeSet.intersects(Range.closedOpen(3, 7)));
    assertTrue(rangeSet.intersects(Range.greaterThan(2)));
    assertFalse(rangeSet.intersects(Range.greaterThan(7)));

    assertTrue(rangeSet.encloses(Range.closed(3, 4)));

   * range sets a and b, the result of {@code a.add(range)} is that {@code a} will be the minimal
   * range set for which both {@code a.enclosesAll(b)} and {@code a.encloses(range)}.
   *
   * <p>Note that {@code range} will be {@linkplain Range#span(Range) coalesced} with any ranges in
   * the range set that are {@linkplain Range#isConnected(Range) connected} with it. Moreover, if
   * {@code range} is empty, this is a no-op.