}

    /**
     * Share information level 0 structure containing basic share information.
     */
    public static class ShareInfo0 extends NdrObject {

        /**
         * Default constructor for ShareInfo0.
         */
        public ShareInfo0() {
        }

        /**
         * The network name of the share.
         */
        public String netname;

    }

    @ParameterizedTest
    @DisplayName("Test valid share names")
    @ValueSource(strings = { "share", "share$", "SHARE", "share123", "share-name", "share_name", "share.name" })
    void testValidShareNames(String share) {
        assertDoesNotThrow(() -> InputValidator.validateShareName(share));
    }

    @Test
    @DisplayName("Test port validation")
    void testPortValidation() {

        @ParameterizedTest
        @CsvSource({ "'\\server', 'server', '', ''", "'\\server\\share', 'server', 'share', ''",
                "'\\server\\share\\path', 'server', 'share', 'path'",
                "'\\server\\share\\path\\file.txt', 'server', 'share', 'path\\file.txt'",
                "'\\server.domain.com\\share\\deep\\path\\structure', 'server.domain.com', 'share', 'deep\\path\\structure'" })
        @DisplayName("Should split DFS paths correctly")

        assertEquals(testString, result);
    }

    @ParameterizedTest
    @DisplayName("Test readDataWireFormat with various share types")
    @CsvSource({ "0, SHARE, Normal share", "1, PRINTER, Printer share", "3, IPC$, IPC share", "32768, HIDDEN, Hidden share", // 0x8000 - hidden flag in lower 16 bits
            "32769, HIDDENP, Hidden printer" // 0x8001 - hidden flag + printer type
    })

  private final char innerNodeCode;

  /** The character used for a leaf node in the trie encoding */
  private final char leafNodeCode;

  PublicSuffixType(char innerNodeCode, char leafNodeCode) {
    this.innerNodeCode = innerNodeCode;
    this.leafNodeCode = leafNodeCode;
  }

  char getLeafNodeCode() {
    return leafNodeCode;
  }

  char getInnerNodeCode() {
    return innerNodeCode;

 * supporting various checksum algorithms including HMAC-MD5 and HMAC-SHA1 with AES.
 */
public class PacSignature {

    /**
     * Kerberos checksum type for HMAC-MD5 (ARCFOUR-HMAC).
     */
    public static final int KERB_CHECKSUM_HMAC_MD5 = 0xFFFFFF76;
    /**
     * Kerberos checksum type for HMAC-SHA1-96 with AES-128.
     */
    public static final int HMAC_SHA1_96_AES128 = 0x0000000F;
    /**

      }
    }
  }

  private static String mikeRepeat(String string, int count) {
    int len = string.length();
    char[] strCopy = new char[len * Integer.highestOneBit(count)];
    string.getChars(0, len, strCopy, 0);

    char[] array = new char[len * count];

    int strCopyLen = len;
    int pos = 0;
    while (count != 0) {
      if ((count & 1) != 0) {

        // Test integer conversion
        char[] dst1 = new char[8];
        Hexdump.toHexChars(0x1234ABCD, dst1, 0, 8);
        assertEquals("1234ABCD", new String(dst1));

        // Test with smaller size
        char[] dst2 = new char[4];
        Hexdump.toHexChars(0xABCD, dst2, 0, 4);
        assertEquals("ABCD", new String(dst2));

        // Test with offset
        char[] dst3 = new char[10];

    }

    /**
     * Generates the NT password hash for the given password.
     * This version accepts char[] for better security.
     *
     * @param password the password to hash as char array
     * @return nt password hash
     */
    public static byte[] getNTHash(final char[] password) {
        if (password == null) {
            throw new NullPointerException("Password parameter is required");

   */
  @Override
  protected final char @Nullable [] escape(char c) {
    if (c < replacementsLength) {
      char[] chars = replacements[c];
      if (chars != null) {
        return chars;
      }
    }
    if (c >= safeMin && c <= safeMax) {
      return null;
    }
    return escapeUnsafe(c);
  }

  /**