verify(tree, times(1)).send(isA(Trans2FindFirst2.class), any(Trans2FindFirst2Response.class));
        // Verify that Trans2FindNext2 was sent twice for fetching more entries
        verify(tree, times(2)).send(isA(Trans2FindNext2.class), any(Trans2FindFirst2Response.class));

        // Close should have sent FindClose2 exactly once
        ArgumentCaptor<SmbComFindClose2> captor = ArgumentCaptor.forClass(SmbComFindClose2.class);

     *
     * @param primary true if primary
     */
    public void setPrimary(boolean primary) {
        this.isPrimary = primary;
    }

    /**
     * Get number of bytes sent
     *
     * @return bytes sent
     */
    public long getBytesSent() {
        return bytesSent.get();
    }

    /**
     * Get number of bytes received
     *
     * @return bytes received
     */

labels.advance_search_filetype_excel=MS Excel
labels.advance_search_filetype_powerpoint=MS PowerPoint
labels.advance_search_occt=Szukaj w
labels.advance_search_occt_default=Cała strona
labels.advance_search_occt_allintitle=Tytuł strony
labels.advance_search_occt_allinurl=URL strony
labels.advance_search_sitesearch=Witryna lub domena
labels.advance_search_timestamp=Data aktualizacji
labels.advance_search_timestamp_default=Dowolna data

        assertDoesNotThrow(() -> outputStream.write(data, 0, 10)); // valid - will consume first mock (10)
        assertDoesNotThrow(() -> outputStream.write(data, 5, 5)); // valid - will consume second mock (5)
    }

    @Test
    void testAppendMode() throws IOException, CIFSException {
        // Given
        when(mockTreeHandle.isSMB2()).thenReturn(true);

        }

        // Second read (should overwrite)
        byte[] secondData = { 10, 20, 30, 40 };
        byte[] buffer2 = new byte[10];
        System.arraycopy(secondData, 0, buffer2, 0, secondData.length);
        response.readDataWireFormat(buffer2, 0, secondData.length);

        // Verify second data overwrote first
        for (int i = 0; i < secondData.length; i++) {

        assertTrue(it.hasNext(), "Iterator should have second element");
        assertSame(fe2, it.next(), "Second element must match first page");

        // Next page fetched via fetchMore()
        assertTrue(it.hasNext(), "Iterator should have third element after fetchMore");
        assertSame(fe3, it.next(), "Third element from second page");

        field.setInt(response, headerStart);
    }

    /**
     * Helper method to set status using reflection
     */
    private void setStatus(Smb2ChangeNotifyResponse response, int status) throws Exception {
        Field statusField = ServerMessageBlock2.class.getDeclaredField("status");
        statusField.setAccessible(true);
        statusField.setInt(response, status);
    }

        Subject first = auth.getSubject();

        // Second call should return cached value (same as first)
        Subject second = auth.getSubject();
        if (first == null && second == null) {
            // Both null - caching is working
            assertNull(second, "Second getSubject should return same result as first (both null)");
        } else if (first != null && second != null) {
            // Both non-null - should be same instance

import java.util.Map;

/**
 * {@link HashMap} with an upper limit on the number of entries. When a new entry is added, the oldest entry is discarded using LRU if the limit is exceeded.
 * <p>
 * <strong>Thread-Safety:</strong> This class is <strong>NOT thread-safe</strong>.
 * It extends {@link LinkedHashMap} without synchronization. If multiple threads access
 * an instance concurrently, and at least one thread modifies the map structurally,

        ChannelInfo second = loadBalancer.selectChannel(mockMessage);

        assertNotNull(first);
        assertNotNull(second);
        // Due to round-robin, should get different channels or same order
        assertTrue(Arrays.asList(channel1, channel2).contains(first));
        assertTrue(Arrays.asList(channel1, channel2).contains(second));
    }

    @Test