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

        for (int pos : positions) {
            when(mockConfig.getPid()).thenReturn(1234); // Mock getPid for each new instance
            response = new TestSmbComNtTransactionResponse(mockConfig); // Reset response

            // Fill buffer at position
            for (int i = 0; i < 37; i++) {
                buffer[pos + i] = 0x00;
            }

            HMACT64 hmac = new HMACT64(TEST_KEY);
            hmac.engineReset();
            verify(mockMd5, times(2)).reset(); // Once in constructor, once in reset
            verify(mockMd5, times(2)).update(any(byte[].class)); // Once in constructor, once in reset
        }
    }

    @Test
    void testEngineGetDigestLength() throws NoSuchAlgorithmException {
        // Test engineGetDigestLength()

     * 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}.
     *

  public SafeTreeSet() {
    this(new TreeSet<E>());
  }

  public SafeTreeSet(Collection<? extends E> collection) {
    this(new TreeSet<E>(collection));
  }

  public SafeTreeSet(Comparator<? super E> comparator) {
    this(new TreeSet<E>(comparator));
  }

  public SafeTreeSet(SortedSet<E> set) {
    this(new TreeSet<E>(set));
  }

  private SafeTreeSet(NavigableSet<E> delegate) {

            new TestStringSortedSetGenerator() {
              @Override
              public SortedSet<String> create(String[] elements) {
                return new TreeSet<>(MinimalCollection.of(elements));
              }
            })
        .named("TreeSet, natural")
        .withFeatures(
            SetFeature.GENERAL_PURPOSE,
            CollectionFeature.SERIALIZABLE,
            CollectionFeature.KNOWN_ORDER,

    }

    /**
     * Test that trees collection is properly cleared during cleanup.
     */
    @Test
    public void testTreesCollectionCleanup() {
        // Given
        SmbSessionImpl session = new SmbSessionImpl(mockContext, "testhost", "testdomain", mockTransport);

        // Add some trees
        SmbTreeImpl tree1 = session.getSmbTree("share1", null);

      }
    }
    out.close();

    // Check that source returns the right data
    assertThat(source.read()).isEqualTo(data);

    // Make sure that reset deleted the file
    out.reset();
    if (file != null) {
      assertFalse(file.exists());
    }
  }


  public void testThreshold_resetOnFinalize() throws Exception {
    testThreshold(0, 100, true, true);

        NdrHyper hyper = new NdrHyper(original);
        // Create buffer with extra space for alignment
        NdrBuffer buf = new NdrBuffer(new byte[16], 0);
        hyper.encode(buf);
        // Reset buffer position for decoding
        buf.reset();
        NdrHyper decoded = new NdrHyper(0);
        decoded.decode(buf);
        assertEquals(original, decoded.value, "Decoded value should match encoded value");
    }

    /**

      }
      return result;
    }

    @Override
    public synchronized void reset() throws IOException {
      if (!in.markSupported()) {
        throw new IOException("Mark not supported");
      }
      if (mark == -1) {
        throw new IOException("Mark not set");
      }

      in.reset();
      left = mark;
    }

    @Override
    public long skip(long n) throws IOException {