assertEquals("c", result[2]);
    }

    public void test_simplifyArray_withSingleElement() {
        String[] input = { "single" };
        String[] result = SearchRequestParams.simplifyArray(input);
        assertEquals(1, result.length);
        assertEquals("single", result[0]);
    }

    public void test_simplifyArray_withEmpty() {
        String[] input = {};

    }

    public void test_specialCharactersInMessage() {
        // Test with special characters in message
        String messageWithSpecialChars = "Error: offset > 1000 && offset < 2000 | \"quotes\" 'single' \n\t tab";
        ResultOffsetExceededException exception = new ResultOffsetExceededException(messageWithSpecialChars);

        assertEquals(messageWithSpecialChars, exception.getMessage());
    }

                } catch (final IOException e) {
                    throw new CrawlerSystemException(e);
                }
            }
        }

        /**
         * Gets the captured output as a single string.
         * @return The captured output with newlines.
         */
        public String getOutput() {
            final StringBuilder buf = new StringBuilder(100);
            for (final String value : list) {

        i += 4;
        SMBUtil.writeInt4(0, body, i); // CreateContextsLength
        i += 4;

        assert i == body.length;
        return body;
    }

    /**
     * Build a CREATE response body with a single, unrecognized create context.
     * The parser should iterate it but produce an empty contexts array.
     */
    private static byte[] buildCreateBodyWithContext(byte[] fileId, int contextStartOffsetFromHeader) {

        byte[] out7 = new byte[8];

        // Act
        NtlmUtil.E(key14, data8, out14);
        NtlmUtil.E(key7, data8, out7);

        // Assert: first block identical to single-chunk encryption
        assertArrayEquals(Arrays.copyOfRange(out14, 0, 8), out7);
        // And second block is present and not all zeros
        assertFalse(Arrays.equals(new byte[8], Arrays.copyOfRange(out14, 8, 16)));

        int charIndex = 0;
        int i = 0;

        while (i < bytes.length) {
            byte b = bytes[i];
            if ((b & 0x80) == 0) {
                // Single byte character
                chars[charIndex++] = (char) b;
                i++;
            } else if ((b & 0xE0) == 0xC0) {
                // Two byte character
                if (i + 1 < bytes.length) {

 * Katakana string into a list of possible Alphabet readings. It uses a predefined mapping of Katakana
 * characters to their Alphabet equivalents, handling both single and double Katakana character combinations.
 * </p>
 *
 * <p>
 * The conversion process involves iterating through the input string, identifying Katakana characters,

 * It also includes a builder for creating extractors.
 *
 * <p>
 * The factory maintains a map of keys to an array of {@link Extractor} objects.
 * When multiple extractors are associated with a single key, they are sorted by weight
 * in descending order. The {@link #getExtractor(String)} method returns a composite
 * extractor that iterates through the available extractors until one successfully
 * extracts the data.
 * </p>

   *
   * <p>This test might fail in GWT because the GWT emulations might count on the input collection
   * not to change during the copy. It is safe to do so in GWT because javascript is
   * single-threaded.
   */
  @GwtIncompatible // GWT is single threaded
  public void testCopyOf_threadSafe() {
    /*
     * The actual collections that we pass as inputs will be wrappers around these, so

   * Double#NEGATIVE_INFINITY}, or {@link Double#NaN}) then the result is {@link Double#NaN}.
   *
   * @throws IllegalStateException if the dataset is empty or contains a single value
   */
  public final double sampleVariance() {
    checkState(count > 1);
    if (isNaN(sumOfSquaresOfDeltas)) {
      return NaN;
    }
    return ensureNonNegative(sumOfSquaresOfDeltas) / (count - 1);