which is a fitness factor for a lossless data compression.

Pre-compressed input typically compresses in excess of 2GiB/s per core,
so performance impact should be minimal even if precompressed data is re-compressed.
Decompressing incompressible data has no significant performance impact.

Below is a list of common files and content-types which are typically not suitable for compression.

	return nil
}

const crc64NVMEPolynomial = 0xad93d23594c93659

var crc64Table = crc64.MakeTable(bits.Reverse64(crc64NVMEPolynomial))

// Following is ported from C to Go in 2016 by Justin Ruggles, with minimal alteration.
// Used uint for unsigned long. Used uint32 for input arguments in order to match
// the Go hash/crc32 package. zlib CRC32 combine (https://github.com/madler/zlib)
// Modified for hash/crc64 by Klaus Post, 2024.

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

   * contained in this set. This is equivalent to {@code range(CLOSED, CLOSED)}.
   *
   * @throws NoSuchElementException if this set is empty
   */
  public abstract Range<C> range();

  /**
   * Returns the minimal range with the given boundary types for which all values in this set are
   * {@linkplain Range#contains(Comparable) contained} within the range.
   *

   * the range map, or {@code null} otherwise.
   */
  @Nullable Entry<Range<K>, V> getEntry(K key);

  /**
   * Returns the minimal range {@linkplain Range#encloses(Range) enclosing} the ranges in this
   * {@code RangeMap}.
   *
   * @throws NoSuchElementException if this range map is empty
   */
  Range<K> span();

  /**

    @ValueSource(strings = { "", " ", "*", "?" })
    @DisplayName("Supports various wildcard values without throwing (edge cases)")
    void wildcardEdgeCases(String wildcard) throws Exception {
        // minimal successful first response with a single entry
        when(tree.send(any(Trans2FindFirst2.class), any(Trans2FindFirst2Response.class))).thenAnswer((InvocationOnMock inv) -> {

            double minTime = Math.min(Math.min(timeStart, timeMiddle), timeEnd);
            double timingRatio = (maxTime - minTime) / maxTime;

            // Timing differences should be minimal (within tolerance)
            assertTrue(timingRatio < TIMING_TOLERANCE,
                    String.format(
                            "Timing attack vulnerability detected: timing ratio %.3f exceeds tolerance %.3f "

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

        assertNull(sd.getOwnerGroupSid());
    }

    @Test
    @DisplayName("Test constructor with buffer decodes SecurityDescriptor")
    void testConstructorWithBuffer() throws IOException {
        // Prepare minimal valid SecurityDescriptor buffer
        prepareMinimalSecurityDescriptorBuffer(testBuffer, 0, true, true, false);

        SecurityDescriptor sd = new SecurityDescriptor(testBuffer, 0, testBuffer.length);

 */
@ExtendWith(MockitoExtension.class)
public class SmbResourceLocatorTest {

    /**
     * A very small concrete implementation used only by the tests. It parses
     * the URL string and performs minimal validation – just enough to make the
     * happy-path expectations deterministic.
     */
    private static class DummySmbResourceLocator implements SmbResourceLocator {
        private final String urlStr;