before a garbage collection delays that cycle. Less frequent cycles means
the CPU cost of the garbage collector is incurred less frequently.

This functionality in this package is mostly captured in the Arena type.
Arenas allocate large chunks of memory for Go values, so they're likely to
be inefficient for allocating only small amounts of small Go values. They're
best used in bulk, on the order of MiB of memory allocated on each use.

        RdmaMemoryRegion region1 = bufferManager.getSendRegion(131072); // 128KB > 64KB pool size
        RdmaMemoryRegion region2 = bufferManager.getSendRegion(131072); // Another large allocation

        assertTrue(bufferManager.getTotalAllocated() > initialAllocated, "Total allocated should increase");
        assertTrue(bufferManager.getActiveRegions() > 0, "Active regions should be positive");

    private ChannelInfo selectAdaptive(SMBMessage message, Collection<ChannelInfo> channels) {
        // Adaptive strategy based on message type and size
        
        if (isLargeTransfer(message)) {
            // For large transfers, prefer high-bandwidth channels
            return channels.stream()
                .max(Comparator.comparingInt(c -> c.getRemoteInterface().getLinkSpeed()))
                .orElseThrow();
        }
        

        assertNotNull(signingKey, "Should handle null preauth for SMB 3.0.0");
        assertEquals(16, signingKey.length, "Should produce 16-byte key");
    }

    @Test
    @DisplayName("Should handle large session key")
    void testDeriveKeys_LargeSessionKey() {
        // Given
        byte[] largeSessionKey = new byte[256]; // Larger than typical 16-byte key
        new SecureRandom().nextBytes(largeSessionKey);

        assertNotNull(suggestItem.getRoles());
    }

    @Test
    public void testToSuggestItemWithLargeBoost() {
        // Test toSuggestItem with large boost value
        String word = "large boost";
        float boost = Float.MAX_VALUE;
        List<String> readings = Arrays.asList("reading1");
        List<String> fields = Arrays.asList("field1");

                if (params != null && params.size() > 100) {
                    return createMockRescorerBuilder();
                }
                return null;
            }
        };

        // Test with large number of parameters
        Map<String, Object> largeParams = new HashMap<>();
        for (int i = 0; i < 150; i++) {
            largeParams.put("key" + i, "value" + i);
        }

            // Should not throw when converting to byte array
            assertDoesNotThrow(() -> init.toByteArray());
        }

        @Test
        @DisplayName("Large MIC values are handled correctly")
        void testLargeMicValue() throws Exception {
            byte[] largeMic = new byte[1024];
            Arrays.fill(largeMic, (byte) 0xAB);

        thumbnailManager.setExceptionMessage(null);

        String result = purgeThumbnailJob.execute();

        assertTrue(result.contains("Test exception"));
    }

    // Test execute with large number of deleted files
    public void test_execute_largeNumberOfFiles() {
        thumbnailManager.setPurgeCallCount(Long.MAX_VALUE);

        String result = purgeThumbnailJob.execute();

        .addEqualityGroup(isNull)
        .addEqualityGroup(Equivalence.identity().equivalentTo("1"))
        .testEquals();
  }

  /*
   * We use large numbers to avoid the integer cache. Normally, we'd accomplish that merely by using
   * `new Integer` (as we do) instead of `Integer.valueOf`. However, under J2KT, `new Integer`

        .addEqualityGroup(isNull)
        .addEqualityGroup(Equivalence.identity().equivalentTo("1"))
        .testEquals();
  }

  /*
   * We use large numbers to avoid the integer cache. Normally, we'd accomplish that merely by using
   * `new Integer` (as we do) instead of `Integer.valueOf`. However, under J2KT, `new Integer`