buffer.putInt(4, data.length);
        result = NtlmMessage.readSecurityBuffer(data, 0);
        assertEquals(0, result.length, "Should return empty array if offset is out of bounds but length is zero.");

        // Test with offset pointing outside array bounds (should throw ArrayIndexOutOfBoundsException)
        buffer.putShort(0, (short) 1);
        buffer.putShort(2, (short) 1);
        buffer.putInt(4, data.length + 1); // Invalid offset

    @ParameterizedTest
    @DisplayName("Test decode with various ACE counts")
    @ValueSource(ints = { 0, 1, 10, 100, 1000, 4096 })
    void testDecodeWithVariousAceCounts(int aceCount) throws SMBProtocolDecodingException {
        // This test is theoretical as we can't create huge buffers
        // but tests the boundary conditions
        if (aceCount <= 10) { // Only test small counts practically
            byte[] buffer = new byte[2048];

            assertEquals(0, context.getSalt().length);
        }

        @ParameterizedTest
        @ValueSource(ints = { 0, 1, 3, 5, 10 })
        @DisplayName("Should calculate size correctly for different hash algo counts")
        void testSizeCalculation(int hashAlgoCount) {
            // Arrange
            int[] hashAlgos = new int[hashAlgoCount];
            byte[] salt = new byte[16];

    }

    /**
     * Test getMessageByDcerpcError() with an error code larger than any known.
     * The binary search implementation has a bug where it accesses array out of bounds.
     */
    @Test
    void testGetMessageByDcerpcError_largerThanAny() {
        int unknownCode = 0x7FFFFFFF; // Max int value

     * This method applies search conditions from the pager and updates the pager with
     * pagination information including page numbers and result counts.
     *
     * @param fileConfigPager the pager containing search criteria and pagination settings
     * @return a list of file configurations matching the criteria
     */

/**
 * A fault-tolerant wrapper for CrawlerClient that implements retry logic for failed requests.
 * This client will attempt to execute requests multiple times before giving up, with configurable
 * retry counts and intervals between attempts.
 *
 * <p>The client supports a RequestListener interface to monitor the request lifecycle and handle
 * exceptions during retries.</p>
 *
 * <p>Key features:</p>
 * <ul>

    }

    @Test
    @DisplayName("size should return correct message size")
    void testSize() {
        int expectedSize = Smb2Constants.SMB2_HEADER_LENGTH + 24;
        // size8 method rounds up to 8-byte boundary
        int expectedAlignedSize = (expectedSize + 7) & ~7;

        assertEquals(expectedAlignedSize, request.size());
    }

    @Test

    class SizeTests {

        @Test
        @DisplayName("Should return correct size")
        void testSize() {
            int expectedSize = Smb2Constants.SMB2_HEADER_LENGTH + 4;
            // size8 rounds up to 8-byte boundary
            int expectedAlignedSize = (expectedSize + 7) & ~7;

            assertEquals(expectedAlignedSize, echoRequest.size());
        }

        @Test

            assertNull(context.getSalt());
            assertEquals(4, context.size()); // Only header
        }

        @ParameterizedTest
        @DisplayName("Should encode with different hash algorithm counts")
        @ValueSource(ints = { 0, 1, 2, 5, 10 })
        void testEncodeWithDifferentHashAlgoCounts(int count) {
            int[] hashAlgos = new int[count];
            for (int i = 0; i < count; i++) {

            assertArrayEquals(salt, Arrays.copyOfRange(buffer, 4, 7));
        }

        @ParameterizedTest
        @ValueSource(ints = { 1, 3, 5, 10, 20 })
        @DisplayName("Should encode various hash algorithm counts correctly")
        void testEncodeVariousHashAlgoCounts(int algoCount) {
            int[] hashAlgos = new int[algoCount];
            for (int i = 0; i < algoCount; i++) {
                hashAlgos[i] = i + 1;