* @return a hexadecimal string representation of the value, padded to the specified size
     */
    public static String toHexString(final int val, final int size) {
        final char[] c = new char[size];
        toHexChars(val, c, 0, size);
        return new String(c);
    }

    /**
     * Converts a long value to a hexadecimal string representation with specified padding.
     *

    }
  }

  public void testUtf8() {
    char[] charsA = new char[128];
    char[] charsB = new char[128];

    for (int i = 0; i < charsA.length; i++) {
      if (i < 100) {
        charsA[i] = 'a';
        charsB[i] = 'a';
      } else {
        // Both two-byte characters, but must be different
        charsA[i] = (char) (0x0180 + i);
        charsB[i] = (char) (0x0280 + i);
      }
    }

        @ParameterizedTest
        @DisplayName("Should calculate correct size for various path lengths")
        @CsvSource({ "'', 4", "'a', 6", "'\\\\', 8", "'\\\\server', 20", "'\\\\server\\share', 32", "'\\\\server\\share\\path', 42",
                "'\\\\server\\share\\very\\long\\path\\with\\many\\segments', 100" })
        void testSizeCalculation(String path, int expectedSize) {
            buffer = new DfsReferralRequestBuffer(path, 3);

    /**
     * Performs constant-time comparison of two char arrays to prevent timing attacks.
     * 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

     */
    CLIENT_MOVE(2),

    /**
     * Share moved to different node - share mobility event
     */
    SHARE_MOVE(3),

    /**
     * IP address changed - network configuration change
     */
    IP_CHANGE(4),

    /**
     * Share deleted - share removal notification
     */
    SHARE_DELETE(5),

    /**

  }

  static void checkExactMatches(CharMatcher m, char[] chars) {
    Set<Character> positive = Sets.newHashSetWithExpectedSize(chars.length);
    for (char c : chars) {
      positive.add(c);
    }
    for (int c = 0; c <= Character.MAX_VALUE; c++) {
      assertFalse(positive.contains(Character.valueOf((char) c)) ^ m.matches((char) c));
    }
  }

  static char[] randomChars(Random rand, int size) {

      int h1 = seed;
      int i = 0;
      int len = 0;

      // This loop optimizes for pure ASCII.
      while (i + 4 <= utf16Length) {
        char c0 = input.charAt(i);
        char c1 = input.charAt(i + 1);
        char c2 = input.charAt(i + 2);
        char c3 = input.charAt(i + 3);
        if (c0 < 0x80 && c1 < 0x80 && c2 < 0x80 && c3 < 0x80) {
          int k1 = c0 | (c1 << 8) | (c2 << 16) | (c3 << 24);

    }

    @Test
    @DisplayName("Should get share")
    void testGetShare() {
        // Given
        String share = "testshare";
        when(mockReferralData.getShare()).thenReturn(share);

        // When
        String result = mockReferralData.getShare();

        // Then
        assertEquals(share, result);
        verify(mockReferralData).getShare();
    }

    @Test

        validator.validatePath("\\share\\folder\\file.txt");
        validator.validatePath("C:\\Windows\\System32");
        validator.validatePath(null); // Null should be allowed
        validator.validatePath(""); // Empty should be allowed
    }

    @Test
    public void testPathTooLong() throws Exception {
        String longPath = "\\share" + "\\folder".repeat(5000);

   */
  private static char[] growBuffer(char[] dest, int index, int size) {
    if (size < 0) { // overflow - should be OutOfMemoryError but GWT/j2cl don't support it
      throw new AssertionError("Cannot increase internal buffer any further");
    }
    char[] copy = new char[size];
    if (index > 0) {
      System.arraycopy(dest, 0, copy, 0, index);
    }