}

    /**
     * Test getMessageByDcerpcError() with an error code smaller than any known.
     */
    @Test
    void testGetMessageByDcerpcError_smallerThanAny() {
        int unknownCode = -1;
        String message = DcerpcException.getMessageByDcerpcError(unknownCode);
        assertEquals("0xFFFFFFFF", message, "Should return hex string for code smaller than any known.");
    }

    /**

    Table<String, Integer, C> smaller = create("foo", 1, 'a', "bar", 1, 'b');
    Table<String, Integer, C> swapOuter = create("bar", 1, 'a', "foo", 1, 'b', "bar", 3, 'c');
    Table<String, Integer, C> swapValues = create("foo", 1, 'c', "bar", 1, 'b', "foo", 3, 'a');

    new EqualsTester()
        .addEqualityGroup(table, hashCopy, reordered)
        .addEqualityGroup(smaller)
        .addEqualityGroup(swapOuter)

    void testSizeCalculationWithDifferentBufferSizes() {
        // Test with smaller maximum buffer size
        when(mockConfig.getMaximumBufferSize()).thenReturn(8192);
        when(mockConfig.getListSize()).thenReturn(16384);

        request = new Smb2QueryDirectoryRequest(mockConfig);
        assertNotNull(request);

        // Test with smaller list size
        when(mockConfig.getMaximumBufferSize()).thenReturn(16384);

      stripes[i] = i;
    }
    List<Integer> asList = Ints.asList(stripes);
    Collections.shuffle(asList, new Random(0xdeadbeef));

    // do bulk gets with exactly 10 keys (possibly <10 stripes) (or less if numStripes is smaller)
    bulkGetSet = ImmutableList.copyOf(limit(cycle(asList), 10));
  }

  @Footprint
  Object sizeOfStriped() {
    return impl.get(numStripes);
  }

        // Any PACDecodingException is acceptable for this test
        assertNotNull(e.getMessage());
    }

    @Test
    void testTooSmallPac() {
        // Test that PAC smaller than 8 bytes is rejected
        byte[] smallData = new byte[4];

        PACDecodingException e = assertThrows(PACDecodingException.class, () -> new Pac(smallData, keys));

     */
    double estimateCompressionRatio(byte[] data, int algorithm);

    /**
     * Gets the minimum data size threshold for compression.
     * Data smaller than this threshold should not be compressed.
     *
     * @return minimum size in bytes for compression to be beneficial
     */
    int getMinCompressionSize();

    /**

    }

    @Test
    @DisplayName("Test small data handling")
    public void testSmallDataHandling() throws CIFSException {
        byte[] smallData = new byte[100]; // Below minimum compression size

        byte[] compressed = compressionService.compress(smallData, CompressionService.COMPRESSION_LZ77);
        // Should return uncompressed data for small inputs
        assertArrayEquals(smallData, compressed);
    }

    //     imagine a line separating the first block from the second, we can proceed by exchanging
    //     the smaller of these blocks with the far end of the other one. That leaves us with a
    //     smaller version of the same problem.
    //     Say we are rotating abcdefgh by 5. We start with abcde|fgh. The smaller block is [fgh]:
    //     [abc]de|[fgh] -> [fgh]de|[abc]. Now [fgh] is in the right place, but we need to swap [de]

  @SuppressWarnings("Immutable")
  private final long[] array;

  /*
   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0

  @SuppressWarnings("Immutable")
  private final int[] array;

  /*
   * TODO(kevinb): evaluate the trade-offs of going bimorphic to save these two fields from most
   * instances. Note that the instances that would get smaller are the right set to care about
   * optimizing, because the rest have the option of calling `trimmed`.
   */

  private final transient int start; // it happens that we only serialize instances where this is 0