*/

package jcifs.smb;

/**
 * Filter interface for SMB filename filtering.
 *
 * This interface allows selective filtering of filenames
 * when listing directory contents in SMB shares.
 */
public interface SmbFilenameFilter {

    /**
     * Tests whether the specified filename should be included in a file list.
     *
     * @param dir the directory containing the file

    /**
     * Animate a typed line.
     * @param {Node} line - The line element to render.
     */
    async type(line) {
        const chars = [...line.textContent];
        line.textContent = '';
        this.container.appendChild(line);

        for (let char of chars) {
            const delay = line.getAttribute(`${this.pfx}-typeDelay`) || this.typeDelay;
            await this._wait(delay);

                // List shares
                String[] shares = server.list();
                assertNotNull(shares, "Share list should not be null");
                assertTrue(shares.length >= 2, "Should have at least 2 shares (public and shared)");

                // Verify expected shares are present
                List<String> shareList = List.of(shares);

     * <code>smb://server/</code>, or <code>smb://server/share/</code> URLs
     * because workgroups, servers, and shares cannot be dynamically created
     * (although in the future it may be possible to create shares).
     *
     * @throws CIFSException if an error occurs creating the directories
     */
    void mkdirs() throws CIFSException;

    /**

## Dispatch

For synchronous calls, you bring your own thread and are responsible for managing how many simultaneous requests you make. Too many simultaneous connections wastes resources; too few harms latency.

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

  /* Overridden for performance. */

            assertTrue(result.startsWith("NtlmChallenge[challenge=0x"));
            assertTrue(result.endsWith(",dc=SERVER123]"));

            // Hexdump.toHexString with size = length * 2 produces 8 uppercase hex chars
            // The hex should be "010203FF"
            assertTrue(result.contains("010203FF"));
        }

        @Test
        @DisplayName("toString with empty challenge array")

    int pos = indexIn(string);
    if (pos == -1) {
      return string;
    }
    char[] chars = string.toCharArray();
    chars[pos] = replacement;
    for (int i = pos + 1; i < chars.length; i++) {
      if (matches(chars[i])) {
        chars[i] = replacement;
      }
    }
    return new String(chars);
  }

  /**

    String allMatchingChars = allMatchingChars(bitSet);
    char[] result = new char[STRING_LENGTH];
    // Fill with matching chars.
    for (int i = 0; i < result.length; i++) {
      result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
    }
    // Replace some of chars by non-matching.
    int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
    while (remaining > 0) {

    String allMatchingChars = allMatchingChars(bitSet);
    char[] result = new char[STRING_LENGTH];
    // Fill with matching chars.
    for (int i = 0; i < result.length; i++) {
      result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
    }
    // Replace some of chars by non-matching.
    int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
    while (remaining > 0) {