testBlock.setUseUnicode(true);
            // Test reading Unicode string with alignment

            byte[] buffer = new byte[100];
            // Write "Test" in UTF-16LE directly at position 2 (even offset)
            System.arraycopy(Strings.getUNIBytes("Test\0"), 0, buffer, 2, 10);

            String result = testBlock.readString(buffer, 2);

            assertEquals("Test", result);
        }

     * @param requestedTime The time the search was requested.
     * @param queryId The ID of the search query.
     * @param query The search query string.
     * @param pageStart The start position of the page.
     * @param pageSize The size of the page.
     * @param queryResponseList The list of query responses.
     * @param context The search log context holding resolved dependencies.
     */

        byte[] nameBytes = serverName.getBytes(StandardCharsets.US_ASCII);
        System.arraycopy(nameBytes, 0, buffer, bufferIndex, 15);
        buffer[15] = 0; // null terminator at position 15
        bufferIndex += 16;

        // Write version
        buffer[bufferIndex++] = 6;
        buffer[bufferIndex++] = 1;

        // Write type
        SMBUtil.writeInt4(0, buffer, bufferIndex);

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *

     * This method always compares the full length of both arrays, regardless of when
     * differences are found, making the execution time independent of the position
     * of differing characters.
     *
     * @param a first char array to compare
     * @param b second char array to compare
     * @return true if arrays are equal, false otherwise
     */

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *

dropend"))return It;if(t.classList.contains("dropstart"))return Dt;if(t.classList.contains("dropup-center"))return"top";if(t.classList.contains("dropdown-center"))return"bottom";const e="end"===getComputedStyle(this._menu).getPropertyValue("--bs-position").trim();return t.classList.contains("dropup")?e?St:kt:e?Ot:Lt}_detectNavbar(){return null!==this._element.closest(".navbar")}_getOffset(){const{offset:t}=this._config;return"string"==typeof t?t.split(",").map((t=>Number.parseInt(t,10))):"function"==typeof...

   * successful input futures. The list of results is in the same order as the input list, and if
   * any of the provided futures fails or is canceled, its corresponding position will contain
   * {@code null} (which is indistinguishable from the future having a successful value of {@code
   * null}).
   *
   * <p>The list of results is in the same order as the input list.
   *

        buffer.putInt(action);
        buffer.putInt(fileNameBytes.length);
        buffer.put(fileNameBytes);

        // Return only the used portion of the buffer
        byte[] result = new byte[buffer.position()];
        buffer.rewind();
        buffer.get(result);
        return result;
    }

    /**
     * Helper method to create a buffer with multiple notifications
     */

    return indexIn(sequence, 0);
  }

  /**
   * Returns the index of the first matching BMP character in a character sequence, starting from a
   * given position, or {@code -1} if no character matches after that position.
   *
   * <p>The default implementation iterates over the sequence in forward order, beginning at {@code
   * start}, calling {@link #matches} for each character.
   *