*/
        p.setProperty("jcifs.smb.client.soTimeout", "1800000");
        p.setProperty("jcifs.netbios.cachePolicy", "1200");
        /*
         * The Filter can only work with NTLMv1 as it uses a man-in-the-middle
         * technique that NTLMv2 specifically thwarts. A real NTLM Filter would
         * need to do a NETLOGON RPC that JCIFS will likely never implement

        assertNull(emptyIterator.next(), "Final next call");
    }

    @Test
    @DisplayName("EmptyIterator should be lightweight and efficient")
    void testPerformanceCharacteristics() {
        // When - create many instances quickly
        long startTime = System.currentTimeMillis();

        for (int i = 0; i < 10000; i++) {
            EmptyIterator iterator = new EmptyIterator();
            iterator.hasNext();

        assertEquals(32, sid.sub_authority[0]);
        assertEquals(544, sid.sub_authority[1]);
        assertEquals(adminSidString, sid.toString());
    }

    /**
     * Test byte array constructor with too many sub-authorities.
     */
    @Test
    void testByteArrayConstructorTooManySubAuthorities() {
        byte[] badSid = new byte[10];
        badSid[1] = 101; // sub_authority_count > 100

            "The specified network name is no longer available.", "Network access is denied.", "The network name cannot be found.",
            "No more connections can be made to this remote computer at this time because there are already as many connections as the computer can accept.",
            "Indicates a Windows NT Server could not be contacted or that objects within the domain are protected such that necessary information could not be retrieved.",

    /** Executor service for concurrent search operations across multiple searchers */
    protected ExecutorService executorService;

    /** Size of the window for rank fusion processing, determines how many results to consider */
    protected int windowSize;

    /** Set of available searcher names that can be used for search processing */
    protected Set<String> availableSearcherNameSet;

    /**

     * Test memory efficiency with large number of patterns
     */
    public void test_largeNumberOfPatterns() {
        String sessionId = "test-session-028";
        urlFilter.init(sessionId);

        // Add many patterns
        for (int i = 0; i < 1000; i++) {
            urlFilter.addInclude("https://site" + i + ".com/.*");
            urlFilter.addExclude(".*\\.exclude" + i + "$");
        }

        fileNameField.setAccessible(true);
        assertEquals("", fileNameField.get(emptyNameRequest));

        // Test with long fileName
        String longFileName = "very-long-file-name-with-many-characters-that-could-potentially-cause-issues.txt";
        Smb2CloseRequest longNameRequest = new Smb2CloseRequest(mockConfig, testFileId, longFileName);
        assertEquals(longFileName, fileNameField.get(longNameRequest));

        DirectoryCacheEntry entry = leaseManager.getCacheEntry(directoryPath);
        if (entry != null) {
            entry.removeChild(fileName);
            
            // If too many inconsistencies, invalidate entire cache
            if (entry.getInconsistencyCount() > 5) {
                entry.invalidate();
            }
        }
    }
}
```

     * common functionality into the superclass and read wordCount
     * and byteCount worth of data.
     *
     * We will still use the readXxxWireFormat return values to
     * indicate how many bytes(note: readParameterWordsWireFormat
     * returns bytes read and not the number of words(but the
     * wordCount member DOES store the number of words)) we
     * actually read. Incedentally this is important to the

     * character matches any number of characters in part of a name. If
     * the expression begins with one or more '?'s then exactly that
     * many characters will be matched whereas if it ends with '?'s
     * it will match that many characters <i>or less</i>.
     * <p>
     * Wildcard expressions will not filter workgroup names or server names.
     *
     * @param wildcard the wildcard pattern to match