* with fast execution and comprehensive coverage of key behaviors.
 */
class TransportTest {

    private TestableTransport transport;

    /**
     * Minimal Transport implementation for testing core functionality
     */
    static class TestableTransport extends Transport {
        private long nextKey = 1;
        private Long peekedKey = null;

      int expectedSize) {
    return new CompactHashSet<>(expectedSize);
  }

  /**
   * Maximum allowed false positive probability of detecting a hash flooding attack given random
   * input.
   */
  @VisibleForTesting(
      )
  static final double HASH_FLOODING_FPP = 0.001;

  /**
   * Maximum allowed length of a hash table bucket before falling back to a j.u.LinkedHashSet based

        assertTrue(parsed.getContextFlag(NegTokenInit.INTEGRITY));
        assertFalse(parsed.getContextFlag(NegTokenInit.CONFIDENTIALITY));
    }

    @Test
    @DisplayName("Minimal token: no fields present")
    void testMinimalTokenRoundTrip() throws Exception {
        NegTokenInit init = new NegTokenInit(); // no fields
        byte[] bytes = init.toByteArray();

            assertEquals(0L, SMBUtil.readInt8(buffer, startIndex + 8));
            assertEquals(0, SMBUtil.readInt4(buffer, startIndex + 16));
        }

        @Test
        @DisplayName("Should encode maximum values correctly")
        void testEncodeMaxValues() {
            // Given
            long maxLong = Long.MAX_VALUE;
            int maxInt = Integer.MAX_VALUE;

    public void testBoundaryConditions() {
        // Given
        smbComTreeDisconnect = new SmbComTreeDisconnect(config);
        byte[] buffer = new byte[100];

        // When & Then - test with maximum valid index
        assertEquals(0, smbComTreeDisconnect.writeParameterWordsWireFormat(buffer, 99));
        assertEquals(0, smbComTreeDisconnect.writeBytesWireFormat(buffer, 99));

            // When & Then
            assertEquals(0L, allocInfo.getCapacity());
            assertEquals(0L, allocInfo.getFree());
        }

        @Test
        @DisplayName("Should handle maximum long values")
        void shouldHandleMaximumLongValues() {
            // Given
            TestAllocInfo allocInfo = new TestAllocInfo(Long.MAX_VALUE, Long.MAX_VALUE);

            // When & Then

        DcerpcHandle handle = mock(DcerpcHandle.class);
        LsaPolicyHandle policy = mock(LsaPolicyHandle.class);

        jcifs.SID[] sids = new jcifs.SID[] { sid("S-1-1-0") };

        // Arrange a minimal response with given retval
        doAnswer(inv -> {
            jcifs.dcerpc.msrpc.MsrpcLookupSids rpc = inv.getArgument(0);
            rpc.retval = ret;
            // Provide empty arrays to satisfy code paths

    a separate file or files, that is not Covered Software.

1.8. "License"
    means this document.

1.9. "Licensable"
    means having the right to grant, to the maximum extent possible,
    whether at the time of the initial grant or subsequently, any and
    all of the rights conveyed by this License.

1.10. "Modifications"
    means any of the following:

public static void afterClass() {
    runner.close();
    runner.clean();
}
```

### Testing Best Practices

- Minimize `Thread.sleep()` - use only when absolutely necessary
- For timestamp tests: use minimal delays (50-100ms)
- Clean only test-specific indices (not `_all` unless needed)
- Use `runner.refresh()` after index operations
- Test with realistic multilingual content

### Key Test Classes

  private const val PREFIX_6_BITS = 0x3f
  private const val PREFIX_7_BITS = 0x7f

  private const val SETTINGS_HEADER_TABLE_SIZE = 4_096

  /**
   * The decoder has ultimate control of the maximum size of the dynamic table but we can choose
   * to use less. We'll put a cap at 16K. This is arbitrary but should be enough for most purposes.
   */
  private const val SETTINGS_HEADER_TABLE_SIZE_LIMIT = 16_384