}

  public void testZeros100() {
    // Test 100 byte array of 0x00.
    byte[] zeros = new byte[100];
    assertCrc(0x07cb9ff6, zeros);
  }

  public void testFull() {
    // Test 32 byte array of 0xFF.
    byte[] fulls = new byte[32];
    Arrays.fill(fulls, (byte) 0xFF);
    assertCrc(0x62a8ab43, fulls);
  }

  public void testFull100() {
    // Test 100 byte array of 0xFF.
    byte[] fulls = new byte[100];

        // Test with large input
        StringBuilder largeInput = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            largeInput.append("key").append(i).append("=value").append(i).append("\n");
        }

        Map<String, String> result = ParameterUtil.parse(largeInput.toString());
        assertEquals(1000, result.size());
        assertEquals("value500", result.get("key500"));

/**
 * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011}
 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *
 * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent

        @DisplayName("Should handle complete read-write cycle")
        void testCompleteReadWriteCycle() throws SMBProtocolDecodingException {
            // Given
            byte[] writeBuffer = new byte[100];
            byte[] readBuffer = new byte[100];

            // Prepare valid read buffer
            SMBUtil.writeInt2(4, readBuffer, 10);
            SMBUtil.writeInt2(0, readBuffer, 12);

            // When

        }
        if (form.lang != null) {
            final Set<String> langSet = new HashSet<>();
            for (final String lang : form.lang) {
                if (StringUtil.isNotBlank(lang) && lang.length() < 1000) {
                    if (Constants.ALL_LANGUAGES.equals(lang)) {
                        langSet.clear();
                        break;
                    }

    /** Working directory for command execution. */
    protected File workingDirectory = null;

    /** Maximum number of output lines to capture. */
    protected int maxOutputLine = 1000;

    /** Command execution timeout in milliseconds. */
    protected long executionTimeout = 30L * 1000L; // 30sec

    /** Character encoding for command output. */

    }

    public void test_longMessage() {
        // Setup - test with a very long message
        final StringBuilder longMessageBuilder = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            longMessageBuilder.append("Query segment ").append(i).append("; ");
        }
        final String longMessage = longMessageBuilder.toString();

        mockConfig = mock(Configuration.class);
        when(mockContext.getConfig()).thenReturn(mockConfig);
        when(mockConfig.getLeaseTimeout()).thenReturn(30000);
        when(mockConfig.getMaxLeases()).thenReturn(1000);
        when(mockConfig.getLeaseBreakTimeout()).thenReturn(60);
        leaseManager = new LeaseManager(mockContext);
    }

    @AfterEach
    void tearDown() {
        if (leaseManager != null) {

            w.write(payload, payload.length, out);

            // Give the writer thread time to process and set exception
            w.wait(100);
        }

        // Wait a bit more to ensure exception is captured
        Thread.sleep(100);

        // Act + Assert: checkException should throw the SmbException captured by the thread
        assertThrows(SmbException.class, w::checkException);

     */
    protected String replaceHighlightQueries(final String cache, final String[] queries) {
        final StringBuffer buf = new StringBuffer(cache.length() + 100);
        final StringBuffer segBuf = new StringBuffer(1000);
        final Pattern p = Pattern.compile("<[^>]+>");
        final Matcher m = p.matcher(cache);
        final String[] regexQueries = new String[queries.length];