data-structure-typed 2.0.5 → 2.1.1

package/dist/esm/data-structures/tree/tree.d.ts

@@ -1,62 +0,0 @@
-export declare class TreeNode<V = any> {
-    /**
-     * The constructor function initializes a TreeNode object with a key, optional value, and optional
-     * children.
-     * @param {string} key - A string representing the key of the tree node.
-     * @param {V} [value] - The `value` parameter is an optional parameter of type `V`. It represents the
-     * value associated with the node. If no value is provided, it defaults to `undefined`.
-     * @param {TreeNode<V>[]} [children] - The `children` parameter is an optional array of `TreeNode<V>`
-     * objects. It represents the child nodes of the current node. If no children are provided, the
-     * default value is an empty array.
-     */
-    constructor(key: string, value?: V, children?: TreeNode<V>[]);
-    protected _key: string;
-    /**
-     * The function returns the value of the protected variable _key.
-     * @returns The value of the `_key` property, which is a string.
-     */
-    get key(): string;
-    /**
-     * The above function sets the value of a protected variable called "key".
-     * @param {string} value - The value parameter is a string that represents the value to be assigned
-     * to the key.
-     */
-    set key(value: string);
-    protected _value?: V | undefined;
-    /**
-     * The function returns the value stored in a variable, or undefined if the variable is empty.
-     * @returns The value of the variable `_value` is being returned.
-     */
-    get value(): V | undefined;
-    /**
-     * The function sets the value of a variable.
-     * @param {V | undefined} value - The parameter "value" is of type "V | undefined", which means it
-     * can accept a value of type "V" or it can be undefined.
-     */
-    set value(value: V | undefined);
-    protected _children?: TreeNode<V>[] | undefined;
-    /**
-     * The function returns an array of TreeNode objects or undefined.
-     * @returns The `children` property is being returned. It is of type `TreeNode<V>[] | undefined`,
-     * which means it can either be an array of `TreeNode<V>` objects or `undefined`.
-     */
-    get children(): TreeNode<V>[] | undefined;
-    /**
-     * The function sets the value of the children property of a TreeNode object.
-     * @param {TreeNode<V>[] | undefined} value - The value parameter is of type TreeNode<V>[] |
-     * undefined. This means that it can accept an array of TreeNode objects or undefined.
-     */
-    set children(value: TreeNode<V>[] | undefined);
-    /**
-     * The function `addChildren` adds one or more child nodes to the current node.
-     * @param {TreeNode<V> | TreeNode<V>[]} children - The `children` parameter can be either a single
-     * `TreeNode<V>` object or an array of `TreeNode<V>` objects.
-     */
-    addChildren(children: TreeNode<V> | TreeNode<V>[]): void;
-    /**
-     * The function `getHeight()` calculates the maximum depth of a tree structure by performing a
-     * breadth-first search.
-     * @returns the maximum depth or height of the tree.
-     */
-    getHeight(): number;
-}

package/dist/esm/data-structures/tree/tree.js

@@ -1,107 +0,0 @@
-export class TreeNode {
-    /**
-     * The constructor function initializes a TreeNode object with a key, optional value, and optional
-     * children.
-     * @param {string} key - A string representing the key of the tree node.
-     * @param {V} [value] - The `value` parameter is an optional parameter of type `V`. It represents the
-     * value associated with the node. If no value is provided, it defaults to `undefined`.
-     * @param {TreeNode<V>[]} [children] - The `children` parameter is an optional array of `TreeNode<V>`
-     * objects. It represents the child nodes of the current node. If no children are provided, the
-     * default value is an empty array.
-     */
-    constructor(key, value, children) {
-        this._key = key;
-        this._value = value || undefined;
-        if (children)
-            this._children = children;
-    }
-    _key;
-    /**
-     * The function returns the value of the protected variable _key.
-     * @returns The value of the `_key` property, which is a string.
-     */
-    get key() {
-        return this._key;
-    }
-    /**
-     * The above function sets the value of a protected variable called "key".
-     * @param {string} value - The value parameter is a string that represents the value to be assigned
-     * to the key.
-     */
-    set key(value) {
-        this._key = value;
-    }
-    _value;
-    /**
-     * The function returns the value stored in a variable, or undefined if the variable is empty.
-     * @returns The value of the variable `_value` is being returned.
-     */
-    get value() {
-        return this._value;
-    }
-    /**
-     * The function sets the value of a variable.
-     * @param {V | undefined} value - The parameter "value" is of type "V | undefined", which means it
-     * can accept a value of type "V" or it can be undefined.
-     */
-    set value(value) {
-        this._value = value;
-    }
-    _children;
-    /**
-     * The function returns an array of TreeNode objects or undefined.
-     * @returns The `children` property is being returned. It is of type `TreeNode<V>[] | undefined`,
-     * which means it can either be an array of `TreeNode<V>` objects or `undefined`.
-     */
-    get children() {
-        return this._children;
-    }
-    /**
-     * The function sets the value of the children property of a TreeNode object.
-     * @param {TreeNode<V>[] | undefined} value - The value parameter is of type TreeNode<V>[] |
-     * undefined. This means that it can accept an array of TreeNode objects or undefined.
-     */
-    set children(value) {
-        this._children = value;
-    }
-    /**
-     * The function `addChildren` adds one or more child nodes to the current node.
-     * @param {TreeNode<V> | TreeNode<V>[]} children - The `children` parameter can be either a single
-     * `TreeNode<V>` object or an array of `TreeNode<V>` objects.
-     */
-    addChildren(children) {
-        if (!this._children) {
-            this._children = [];
-        }
-        if (children instanceof TreeNode) {
-            this._children.push(children);
-        }
-        else {
-            this._children = this._children.concat(children);
-        }
-    }
-    /**
-     * The function `getHeight()` calculates the maximum depth of a tree structure by performing a
-     * breadth-first search.
-     * @returns the maximum depth or height of the tree.
-     */
-    getHeight() {
-        let maxDepth = 0;
-        if (this) {
-            const bfs = (node, level) => {
-                if (level > maxDepth) {
-                    maxDepth = level;
-                }
-                const { _children } = node;
-                if (_children) {
-                    for (let i = 0, len = _children.length; i < len; i++) {
-                        bfs(_children[i], level + 1);
-                    }
-                }
-            };
-            bfs(this, 0);
-        }
-        return maxDepth;
-    }
-}
-//# sourceMappingURL=tree.js.map

package/dist/esm/data-structures/tree/tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../../src/data-structures/tree/tree.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,QAAQ;IACnB;;;;;;;;;OASG;IACH,YAAY,GAAW,EAAE,KAAS,EAAE,QAAwB;QAC1D,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,SAAS,CAAC;QACjC,IAAI,QAAQ;YAAE,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC1C,CAAC;IAES,IAAI,CAAS;IAEvB;;;OAGG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,IAAI,GAAG,CAAC,KAAa;QACnB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;IACpB,CAAC;IAES,MAAM,CAAiB;IAEjC;;;OAGG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,IAAI,KAAK,CAAC,KAAoB;QAC5B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,SAAS,CAA6B;IAEhD;;;;OAIG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,IAAI,QAAQ,CAAC,KAAgC;QAC3C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,QAAqC;QAC/C,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACtB,CAAC;QACD,IAAI,QAAQ,YAAY,QAAQ,EAAE,CAAC;YACjC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,SAAS;QACP,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,GAAG,GAAG,CAAC,IAAiB,EAAE,KAAa,EAAE,EAAE;gBAC/C,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,QAAQ,GAAG,KAAK,CAAC;gBACnB,CAAC;gBACD,MAAM,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;gBAC3B,IAAI,SAAS,EAAE,CAAC;oBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBACrD,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC,CAAC;YACF,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACf,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/dist/esm/data-structures/trie/index.d.ts

@@ -1 +0,0 @@
-export * from './trie';

package/dist/esm/data-structures/trie/index.js

@@ -1,2 +0,0 @@
-export * from './trie';
-//# sourceMappingURL=index.js.map

package/dist/esm/data-structures/trie/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/data-structures/trie/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC"}

package/dist/esm/data-structures/trie/trie.d.ts

@@ -1,351 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import type { ElementCallback, TrieOptions } from '../../types';
-import { IterableElementBase } from '../base';
-export declare class TrieNode {
-    constructor(key: string);
-    protected _key: string;
-    /**
-     * The function returns the value of the protected variable _key.
-     * @returns The value of the `_key` property, which is a string.
-     */
-    get key(): string;
-    /**
-     * The above function sets the value of a protected variable called "key".
-     * @param {string} value - The value parameter is a string that represents the value to be assigned
-     * to the key.
-     */
-    set key(value: string);
-    protected _children: Map<string, TrieNode>;
-    /**
-     * The function returns the children of a TrieNode as a Map.
-     * @returns The `children` property of the TrieNode object, which is a Map containing string keys and
-     * TrieNode values.
-     */
-    get children(): Map<string, TrieNode>;
-    /**
-     * The function sets the value of the `_children` property of a TrieNode object.
-     * @param value - The value parameter is a Map object that represents the children of a TrieNode. The
-     * keys of the map are strings, which represent the characters that are associated with each child
-     * TrieNode. The values of the map are TrieNode objects, which represent the child nodes of the
-     * current TrieNode.
-     */
-    set children(value: Map<string, TrieNode>);
-    protected _isEnd: boolean;
-    /**
-     * The function returns a boolean value indicating whether a certain condition is met.
-     * @returns The method is returning a boolean value, specifically the value of the variable `_isEnd`.
-     */
-    get isEnd(): boolean;
-    /**
-     * The function sets the value of the "_isEnd" property.
-     * @param {boolean} value - The value parameter is a boolean value that indicates whether the current
-     * state is the end state or not.
-     */
-    set isEnd(value: boolean);
-}
-/**
- * 1. Node Structure: Each node in a Trie represents a string (or a part of a string). The root node typically represents an empty string.
- * 2. Child Node Relationship: Each node's children represent the strings that can be formed by adding one character to the string at the current node. For example, if a node represents the string 'ca', one of its children might represent 'cat'.
- * 3. Fast Retrieval: Trie allows retrieval in O(m) time complexity, where m is the length of the string to be searched.
- * 4. Space Efficiency: Trie can store a large number of strings very space-efficiently, especially when these strings share common prefixes.
- * 5. Autocomplete and Prediction: Trie can be used for implementing autocomplete and word prediction features, as it can quickly find all strings with a common prefix.
- * 6. Sorting: Trie can be used to sort a set of strings in alphabetical order.
- * 7. String Retrieval: For example, searching for a specific string in a large set of strings.
- * 8. Autocomplete: Providing recommended words or phrases as a user types.
- * 9. Spell Check: Checking the spelling of words.
- * 10. IP Routing: Used in certain types of IP routing algorithms.
- * 11. Text Word Frequency Count: Counting and storing the frequency of words in a large amount of text data.
- * @example
- * // Autocomplete: Prefix validation and checking
- *     const autocomplete = new Trie<string>(['gmail.com', 'gmail.co.nz', 'gmail.co.jp', 'yahoo.com', 'outlook.com']);
- *
- *     // Get all completions for a prefix
- *     const gmailCompletions = autocomplete.getWords('gmail');
- *     console.log(gmailCompletions); // ['gmail.com', 'gmail.co.nz', 'gmail.co.jp']
- * @example
- * // File System Path Operations
- *     const fileSystem = new Trie<string>([
- *       '/home/user/documents/file1.txt',
- *       '/home/user/documents/file2.txt',
- *       '/home/user/pictures/photo.jpg',
- *       '/home/user/pictures/vacation/',
- *       '/home/user/downloads'
- *     ]);
- *
- *     // Find common directory prefix
- *     console.log(fileSystem.getLongestCommonPrefix()); // '/home/user/'
- *
- *     // List all files in a directory
- *     const documentsFiles = fileSystem.getWords('/home/user/documents/');
- *     console.log(documentsFiles); // ['/home/user/documents/file1.txt', '/home/user/documents/file2.txt']
- * @example
- * // Autocomplete: Basic word suggestions
- *     // Create a trie for autocomplete
- *     const autocomplete = new Trie<string>([
- *       'function',
- *       'functional',
- *       'functions',
- *       'class',
- *       'classes',
- *       'classical',
- *       'closure',
- *       'const',
- *       'constructor'
- *     ]);
- *
- *     // Test autocomplete with different prefixes
- *     console.log(autocomplete.getWords('fun')); // ['functional', 'functions', 'function']
- *     console.log(autocomplete.getWords('cla')); // ['classes', 'classical', 'class']
- *     console.log(autocomplete.getWords('con')); // ['constructor', 'const']
- *
- *     // Test with non-matching prefix
- *     console.log(autocomplete.getWords('xyz')); // []
- * @example
- * // Dictionary: Case-insensitive word lookup
- *     // Create a case-insensitive dictionary
- *     const dictionary = new Trie<string>([], { caseSensitive: false });
- *
- *     // Add words with mixed casing
- *     dictionary.add('Hello');
- *     dictionary.add('WORLD');
- *     dictionary.add('JavaScript');
- *
- *     // Test lookups with different casings
- *     console.log(dictionary.has('hello')); // true
- *     console.log(dictionary.has('HELLO')); // true
- *     console.log(dictionary.has('Hello')); // true
- *     console.log(dictionary.has('javascript')); // true
- *     console.log(dictionary.has('JAVASCRIPT')); // true
- * @example
- * // IP Address Routing Table
- *     // Add IP address prefixes and their corresponding routes
- *     const routes = {
- *       '192.168.1': 'LAN_SUBNET_1',
- *       '192.168.2': 'LAN_SUBNET_2',
- *       '10.0.0': 'PRIVATE_NETWORK_1',
- *       '10.0.1': 'PRIVATE_NETWORK_2'
- *     };
- *
- *     const ipRoutingTable = new Trie<string>(Object.keys(routes));
- *
- *     // Check IP address prefix matching
- *     console.log(ipRoutingTable.hasPrefix('192.168.1')); // true
- *     console.log(ipRoutingTable.hasPrefix('192.168.2')); // true
- *
- *     // Validate IP address belongs to subnet
- *     const ip = '192.168.1.100';
- *     const subnet = ip.split('.').slice(0, 3).join('.');
- *     console.log(ipRoutingTable.hasPrefix(subnet)); // true
- */
-export declare class Trie<R = any> extends IterableElementBase<string, R> {
-    /**
-     * The constructor initializes a Trie data structure with optional options and words provided as
-     * input.
-     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the constructor is an
-     * iterable containing either strings or elements of type `R`. It is used to initialize the Trie with
-     * a list of words or elements. If no `words` are provided, an empty iterable is used as the default
-     * value.
-     * @param [options] - The `options` parameter in the constructor is an optional object that can
-     * contain configuration options for the Trie data structure. One of the options it can have is
-     * `caseSensitive`, which is a boolean value indicating whether the Trie should be case-sensitive or
-     * not. If `caseSensitive` is set to `
-     */
-    constructor(words?: Iterable<string> | Iterable<R>, options?: TrieOptions<R>);
-    protected _size: number;
-    /**
-     * The size function returns the size of the stack.
-     * @return The number of elements in the list
-     */
-    get size(): number;
-    protected _caseSensitive: boolean;
-    /**
-     * The caseSensitive function is a getter that returns the value of the protected _caseSensitive property.
-     * @return The value of the _caseSensitive protected variable
-     */
-    get caseSensitive(): boolean;
-    protected _root: TrieNode;
-    /**
-     * The root function returns the root node of the tree.
-     * @return The root node
-     */
-    get root(): TrieNode;
-    /**
-     * Time Complexity: O(l), where l is the length of the word being added.
-     * Space Complexity: O(l) - Each character in the word adds a TrieNode.
-     *
-     * Add a word to the Trie structure.
-     * @param {string} word - The word to add.
-     * @returns {boolean} True if the word was successfully added.
-     */
-    add(word: string): boolean;
-    /**
-     * Time Complexity: O(n * l)
-     * Space Complexity: O(1)
-     *
-     * The `addMany` function in TypeScript takes an iterable of strings or elements of type R, converts
-     * them using a provided function if available, and adds them to a data structure while returning an
-     * array of boolean values indicating success.
-     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the `addMany` function is
-     * an iterable that contains either strings or elements of type `R`.
-     * @returns The `addMany` method returns an array of boolean values indicating whether each word in
-     * the input iterable was successfully added to the data structure.
-     */
-    addMany(words: Iterable<string> | Iterable<R>): boolean[];
-    /**
-     * Time Complexity: O(l), where l is the length of the input word.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if the Trie contains a given word.
-     * @param {string} word - The word to check for.
-     * @returns {boolean} True if the word is present in the Trie.
-     */
-    has(word: string): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The isEmpty function checks if the size of the queue is 0.
-     * @return True if the size of the queue is 0
-     */
-    isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The clear function resets the size of the Trie to 0 and creates a new root TrieNode.
-     */
-    clear(): void;
-    /**
-     * Time Complexity: O(l), where l is the length of the word being deleted.
-     * Space Complexity: O(n) - Due to the recursive DFS approach.
-     *
-     * Remove a word from the Trie structure.
-     * @param{string} word - The word to delete.
-     * @returns {boolean} True if the word was successfully removed.
-     */
-    delete(word: string): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `getHeight` calculates the height of a trie data structure starting from the root
-     * node.
-     * @returns The `getHeight` method returns the maximum depth or height of the trie tree starting from
-     * the root node. It calculates the depth using a breadth-first search (BFS) traversal of the trie
-     * tree and returns the maximum depth found.
-     */
-    getHeight(): number;
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if a given input string has an absolute prefix in the Trie, meaning it's not a complete word.
-     * @param {string} input - The input string to check.
-     * @returns {boolean} True if it's an absolute prefix in the Trie.
-     */
-    hasPurePrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if a given input string is a prefix of any existing word in the Trie, whether as an absolute prefix or a complete word.
-     * @param {string} input - The input string representing the prefix to check.
-     * @returns {boolean} True if it's a prefix in the Trie.
-     */
-    hasPrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the input prefix.
-     *
-     * Check if the input string is a common prefix in the Trie, meaning it's a prefix shared by all words in the Trie.
-     * @param {string} input - The input string representing the common prefix to check for.
-     * @returns {boolean} True if it's a common prefix in the Trie.
-     */
-    hasCommonPrefix(input: string): boolean;
-    /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the longest common prefix.
-     *
-     * Get the longest common prefix among all the words stored in the Trie.
-     * @returns {string} The longest common prefix found in the Trie.
-     */
-    getLongestCommonPrefix(): string;
-    /**
-     * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
-     * Space Complexity: O(w * l) - The space required for the output array.
-     *
-     * The `getAll` function returns an array of all words in a Trie data structure that start with a given prefix.
-     * @param {string} prefix - The `prefix` parameter is a string that represents the prefix that we want to search for in the
-     * trie. It is an optional parameter, so if no prefix is provided, it will default to an empty string.
-     * @param {number} max - The max count of words will be found
-     * @param isAllWhenEmptyPrefix - If true, when the prefix provided as '', returns all the words in the trie.
-     * @returns {string[]} an array of strings.
-     */
-    getWords(prefix?: string, max?: number, isAllWhenEmptyPrefix?: boolean): string[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `clone` function returns a new instance of the Trie class with the same values and case
-     * sensitivity as the original Trie.
-     * @returns A new instance of the Trie class is being returned.
-     */
-    clone(): Trie<R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `filter` function takes a predicate function and returns a new array containing all the
-     * elements for which the predicate function returns true.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * `word`, `index`, and `this`. It should return a boolean value indicating whether the current
-     * element should be included in the filtered results or not.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to
-     * specify the value of `this` within the `predicate` function. It is used when you want to bind a
-     * specific object as the context for the `predicate` function. If `thisArg` is provided, it will be
-     * @returns The `filter` method is returning an array of strings (`string[]`).
-     */
-    filter(predicate: ElementCallback<string, R, boolean>, thisArg?: any): Trie<R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `map` function creates a new Trie by applying a callback function to each element in the
-     * current Trie.
-     * @param callback - The callback parameter is a function that will be called for each element in the
-     * Trie. It takes four arguments:
-     * @param [toElementFn] - The `toElementFn` parameter is an optional function that can be used to
-     * convert the raw element (`RM`) into a string representation. This can be useful if the raw element
-     * is not already a string or if you want to customize how the element is converted into a string. If
-     * this parameter is
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to
-     * specify the value of `this` within the callback function. It is used to set the context or scope
-     * in which the callback function will be executed. If `thisArg` is provided, it will be used as the
-     * value of
-     * @returns a new Trie object.
-     */
-    map<RM>(callback: ElementCallback<string, R, string>, toElementFn?: (rawElement: RM) => string, thisArg?: any): Trie<RM>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function `_getIterator` returns an iterable iterator that performs a depth-first search on a
-     * trie data structure and yields all the paths to the end nodes.
-     */
-    protected _getIterator(): IterableIterator<string>;
-    protected get _total(): number;
-    /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * @param str
-     * @protected
-     */
-    protected _caseProcess(str: string): string;
-}