}

        // Check total memory allocation
        long totalSize = (long) size * (long) elementSize;
        long maxAllocation = 100 * 1024 * 1024; // 100MB max

        if (totalSize > maxAllocation) {
            failedValidations.incrementAndGet();
            log.warn("Array allocation too large: {} bytes", totalSize);

}

// BenchmarkPutObject100KbFS - Benchmark FS.PutObject() for object size of 100KB.
func BenchmarkPutObject100KbFS(b *testing.B) {
	benchmarkPutObject(b, "FS", 100*humanize.KiByte)
}

// BenchmarkPutObject100KbErasure - Benchmark Erasure.PutObject() for object size of 100KB.
func BenchmarkPutObject100KbErasure(b *testing.B) {
	benchmarkPutObject(b, "Erasure", 100*humanize.KiByte)
}

        void shouldHandleTypicalNTFSConfiguration() throws SMBProtocolDecodingException {
            // Given - typical NTFS: 4KB clusters (8 sectors * 512 bytes)
            long totalClusters = 26214400L; // 100GB / 4KB
            long freeClusters = 13107200L; // 50GB / 4KB

            ByteBuffer buffer = ByteBuffer.allocate(32);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(totalClusters);

        void shouldHandleTypicalNTFSConfiguration() throws SMBProtocolDecodingException {
            // Given - typical NTFS: 4KB clusters (8 sectors * 512 bytes)
            long totalClusters = 26214400L; // 100GB / 4KB
            long freeClusters = 13107200L; // 50GB / 4KB

            ByteBuffer buffer = ByteBuffer.allocate(24);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(totalClusters);

labels.facet_contentLength_10k=  - 10KB
labels.facet_contentLength_10kto100k=10KB - 100KB
labels.facet_contentLength_100kto500k=100KB - 500KB
labels.facet_contentLength_500kto1m=500KB - 1MB
labels.facet_contentLength_1m=1MB -  
labels.facet_contentLength_10kto50k=10KB - 50KB
labels.facet_contentLength_50kto100k=50KB - 100KB
labels.facet_contentLength_100kto250k=100KB - 250KB
labels.facet_contentLength_250kto500k=250KB - 500KB

        try (RankFusionProcessor processor = new RankFusionProcessor()) {
            processor.setSearcher(new TestSearcher(100));
            processor.register(new SlowSearcher(100)); // 100ms delay
            processor.init();

            // Should complete even with slow searcher
            final long startTime = System.currentTimeMillis();

        @Test
        @DisplayName("Should return mocked capacity value")
        void shouldReturnMockedCapacity() {
            // Given
            long expectedCapacity = 1024L * 1024L * 1024L * 100L; // 100GB
            when(mockAllocInfo.getCapacity()).thenReturn(expectedCapacity);

            // When
            long actualCapacity = mockAllocInfo.getCapacity();

            // Then

   * QPS=5 (5 tokens per second), if we ensure that a request isn't granted earlier than 200ms after
   * the last one, then we achieve the intended rate. If a request comes and the last request was
   * granted only 100ms ago, then we wait for another 100ms. At this rate, serving 15 fresh permits
   * (i.e. for an acquire(15) request) naturally takes 3 seconds.
   *
   * It is important to realize that such a RateLimiter has a very superficial memory of the past:

            fail(); // Time Out
        }

        logger.info("Crawler is running");
        count = 0;
        isRunning = true;
        sleepTime = 100; // Reset to 100ms for termination wait

        // Wait until the crawler terminates (with exponential backoff)
        while (count < 3000 && isRunning) {
            ThreadUtil.sleep(sleepTime);
            count++;

    }

    @Test
    public void testArrayAllocationMemoryLimit() throws Exception {
        assertThrows(SmbException.class, () -> {
            validator.validateArrayAllocation(1000000, 200, 1000000); // 200MB
        });
    }

    @Test
    public void testStatistics() throws Exception {
        // Reset stats
        validator.resetStats();