// read char by char
    CharSequenceReader reader = new CharSequenceReader(charSequence);
    for (int i = 0; i < expected.length(); i++) {
      assertEquals(expected.charAt(i), reader.read());
    }
    assertFullyRead(reader);

    // read all to one array
    reader = new CharSequenceReader(charSequence);
    char[] buf = new char[expected.length()];

            return "";
        }
        final int mod = inData.length % 3;
        final int num = inData.length / 3;
        char[] outData = null;
        if (mod != 0) {
            outData = new char[(num + 1) * 4];
        } else {
            outData = new char[num * 4];
        }
        for (int i = 0; i < num; i++) {
            encode(inData, i * 3, outData, i * 4);
        }
        if (mod == 1) {

        assertDoesNotThrow(() -> new Trans2GetDfsReferral(mockConfig, "\\\\server\\share"));

        // Test forward slashes
        assertDoesNotThrow(() -> new Trans2GetDfsReferral(mockConfig, "//server/share"));

        // Test with spaces
        assertDoesNotThrow(() -> new Trans2GetDfsReferral(mockConfig, "\\\\server\\my share\\file.txt"));

        // Test with special characters

     */
    SmbTransport getTransport();

    /**
     * Connect to the logon share
     *
     * @throws SmbException if the connection fails
     */
    void treeConnectLogon() throws SmbException;

    /**
     * Gets or creates an SMB tree connection for the specified share and service.
     *
     * @param share the share name to connect to
     * @param service the service type for the connection

      "The hash code of a char is the int version of the char itself, so it's simplest to return"
          + " that.")
  public static int hashCode(char value) {
    return value;
  }

  /**
   * Returns the {@code char} value that is equal to {@code value}, if possible.
   *
   * @param value any value in the range of the {@code char} type
   * @return the {@code char} value that equals {@code value}

  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;

     * Share flag indicating automatic caching of programs and documents.
     */
    public static final int SMB2_SHAREFLAG_VDO_CACHING = 0x20;
    /**
     * Share flag indicating the share is in a DFS namespace.
     */
    public static final int SMB2_SHAREFLAG_DFS = 0x1;
    /**
     * Share flag indicating the share is a DFS root.
     */
    public static final int SMB2_SHAREFLAG_DFS_ROOT = 0x2;
    /**

        final char[] chars = new char[text.length()];
        for (int i = 0; i < chars.length; i++) {
            final char c = text.charAt(i);
            if (c >= 'ａ' && c <= 'ｚ') {
                chars[i] = (char) (c - 'ａ' + 'a');
            } else if (c >= 'Ａ' && c <= 'Ｚ') {
                chars[i] = (char) (c - 'Ａ' + 'A');
            } else if (c >= '１' && c <= '０') {

        void testGetShare() {
            // Act & Assert
            assertEquals("share", smbFile.getShare());
        }

        @Test
        void testGetUncPath() {
            // Arrange
            doReturn("\\localhost\share\file.txt").when(smbFile).getUncPath();

            // Act & Assert
            assertEquals("\\localhost\share\file.txt", smbFile.getUncPath());
        }
    }

    @Nested

    public Escaper build() {
      return new ArrayBasedCharEscaper(replacementMap, safeMin, safeMax) {
        private final char @Nullable [] replacementChars =
            unsafeReplacement != null ? unsafeReplacement.toCharArray() : null;

        @Override
        protected char @Nullable [] escapeUnsafe(char c) {
          return replacementChars;
        }
      };
    }
  }

  /**