data-structure-typed 2.0.5 → 2.1.1

package/dist/cjs/data-structures/trie/trie.js

@@ -1,594 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Trie = exports.TrieNode = void 0;
-const base_1 = require("../base");
-class TrieNode {
-    constructor(key) {
-        this._key = key;
-        this._isEnd = false;
-        this._children = new Map();
-    }
-    /**
-     * 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;
-    }
-    /**
-     * 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() {
-        return this._children;
-    }
-    /**
-     * 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) {
-        this._children = value;
-    }
-    /**
-     * 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() {
-        return this._isEnd;
-    }
-    /**
-     * 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) {
-        this._isEnd = value;
-    }
-}
-exports.TrieNode = TrieNode;
-/**
- * 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
- */
-class Trie extends base_1.IterableElementBase {
-    /**
-     * 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 = [], options) {
-        super(options);
-        this._size = 0;
-        this._caseSensitive = true;
-        this._root = new TrieNode('');
-        if (options) {
-            const { caseSensitive } = options;
-            if (caseSensitive !== undefined)
-                this._caseSensitive = caseSensitive;
-        }
-        if (words) {
-            this.addMany(words);
-        }
-    }
-    /**
-     * The size function returns the size of the stack.
-     * @return The number of elements in the list
-     */
-    get size() {
-        return this._size;
-    }
-    /**
-     * 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() {
-        return this._caseSensitive;
-    }
-    /**
-     * The root function returns the root node of the tree.
-     * @return The root node
-     */
-    get root() {
-        return this._root;
-    }
-    /**
-     * 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) {
-        word = this._caseProcess(word);
-        let cur = this.root;
-        let isNewWord = false;
-        for (const c of word) {
-            let nodeC = cur.children.get(c);
-            if (!nodeC) {
-                nodeC = new TrieNode(c);
-                cur.children.set(c, nodeC);
-            }
-            cur = nodeC;
-        }
-        if (!cur.isEnd) {
-            isNewWord = true;
-            cur.isEnd = true;
-            this._size++;
-        }
-        return isNewWord;
-    }
-    /**
-     * 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) {
-        const ans = [];
-        for (const word of words) {
-            if (this.toElementFn) {
-                ans.push(this.add(this.toElementFn(word)));
-            }
-            else {
-                ans.push(this.add(word));
-            }
-        }
-        return ans;
-    }
-    /**
-     * 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) {
-        word = this._caseProcess(word);
-        let cur = this.root;
-        for (const c of word) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
-        }
-        return cur.isEnd;
-    }
-    /**
-     * 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() {
-        return this._size === 0;
-    }
-    /**
-     * 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() {
-        this._size = 0;
-        this._root = new TrieNode('');
-    }
-    /**
-     * 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) {
-        word = this._caseProcess(word);
-        let isDeleted = false;
-        const dfs = (cur, i) => {
-            const char = word[i];
-            const child = cur.children.get(char);
-            if (child) {
-                if (i === word.length - 1) {
-                    if (child.isEnd) {
-                        if (child.children.size > 0) {
-                            child.isEnd = false;
-                        }
-                        else {
-                            cur.children.delete(char);
-                        }
-                        isDeleted = true;
-                        return true;
-                    }
-                    return false;
-                }
-                const res = dfs(child, i + 1);
-                if (res && !cur.isEnd && child.children.size === 0) {
-                    cur.children.delete(char);
-                    return true;
-                }
-                return false;
-            }
-            return false;
-        };
-        dfs(this.root, 0);
-        if (isDeleted) {
-            this._size--;
-        }
-        return isDeleted;
-    }
-    /**
-     * 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() {
-        const startNode = this.root;
-        let maxDepth = 0;
-        if (startNode) {
-            const bfs = (node, level) => {
-                if (level > maxDepth) {
-                    maxDepth = level;
-                }
-                const { children } = node;
-                if (children) {
-                    for (const child of children.entries()) {
-                        bfs(child[1], level + 1);
-                    }
-                }
-            };
-            bfs(startNode, 0);
-        }
-        return maxDepth;
-    }
-    /**
-     * 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) {
-        input = this._caseProcess(input);
-        let cur = this.root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
-        }
-        return !cur.isEnd;
-    }
-    /**
-     * 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) {
-        input = this._caseProcess(input);
-        let cur = this.root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
-        }
-        return true;
-    }
-    /**
-     * 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) {
-        input = this._caseProcess(input);
-        let commonPre = '';
-        const dfs = (cur) => {
-            commonPre += cur.key;
-            if (commonPre === input)
-                return;
-            if (cur.isEnd)
-                return;
-            if (cur && cur.children && cur.children.size === 1)
-                dfs(Array.from(cur.children.values())[0]);
-            else
-                return;
-        };
-        dfs(this.root);
-        return commonPre === input;
-    }
-    /**
-     * 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() {
-        let commonPre = '';
-        const dfs = (cur) => {
-            commonPre += cur.key;
-            if (cur.isEnd)
-                return;
-            if (cur && cur.children && cur.children.size === 1)
-                dfs(Array.from(cur.children.values())[0]);
-            else
-                return;
-        };
-        dfs(this.root);
-        return commonPre;
-    }
-    /**
-     * 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 = '', max = Number.MAX_SAFE_INTEGER, isAllWhenEmptyPrefix = false) {
-        prefix = this._caseProcess(prefix);
-        const words = [];
-        let found = 0;
-        function dfs(node, word) {
-            for (const char of node.children.keys()) {
-                const charNode = node.children.get(char);
-                if (charNode !== undefined) {
-                    dfs(charNode, word.concat(char));
-                }
-            }
-            if (node.isEnd) {
-                if (found > max - 1)
-                    return;
-                words.push(word);
-                found++;
-            }
-        }
-        let startNode = this.root;
-        if (prefix) {
-            for (const c of prefix) {
-                const nodeC = startNode.children.get(c);
-                if (nodeC) {
-                    startNode = nodeC;
-                }
-                else {
-                    // Early return if the whole prefix is not found
-                    return [];
-                }
-            }
-        }
-        if (isAllWhenEmptyPrefix || startNode !== this.root)
-            dfs(startNode, prefix);
-        return words;
-    }
-    /**
-     * 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() {
-        return new Trie(this, { caseSensitive: this.caseSensitive, toElementFn: this.toElementFn });
-    }
-    /**
-     * 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, thisArg) {
-        const results = new Trie([], { toElementFn: this.toElementFn, caseSensitive: this.caseSensitive });
-        let index = 0;
-        for (const word of this) {
-            if (predicate.call(thisArg, word, index, this)) {
-                results.add(word);
-            }
-            index++;
-        }
-        return results;
-    }
-    /**
-     * 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(callback, toElementFn, thisArg) {
-        const newTrie = new Trie([], { toElementFn, caseSensitive: this.caseSensitive });
-        let index = 0;
-        for (const word of this) {
-            newTrie.add(callback.call(thisArg, word, index, this));
-            index++;
-        }
-        return newTrie;
-    }
-    /**
-     * 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.
-     */
-    *_getIterator() {
-        function* _dfs(node, path) {
-            if (node.isEnd) {
-                yield path;
-            }
-            for (const [char, childNode] of node.children) {
-                yield* _dfs(childNode, path + char);
-            }
-        }
-        yield* _dfs(this.root, '');
-    }
-    get _total() {
-        return this._size;
-    }
-    /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * @param str
-     * @protected
-     */
-    _caseProcess(str) {
-        if (!this._caseSensitive) {
-            str = str.toLowerCase(); // Convert str to lowercase if case-insensitive
-        }
-        return str;
-    }
-}
-exports.Trie = Trie;
-//# sourceMappingURL=trie.js.map

package/dist/cjs/data-structures/trie/trie.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"trie.js","sourceRoot":"","sources":["../../../../src/data-structures/trie/trie.ts"],"names":[],"mappings":";;;AAQA,kCAA8C;AAE9C,MAAa,QAAQ;IACnB,YAAY,GAAW;QACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,CAAC;IAID;;;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;IAID;;;;OAIG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;;;OAMG;IACH,IAAI,QAAQ,CAAC,KAA4B;QACvC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAID;;;OAGG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,IAAI,KAAK,CAAC,KAAc;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AAlED,4BAkEC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6FG;AACH,MAAa,IAAc,SAAQ,0BAA8B;IAC/D;;;;;;;;;;;OAWG;IACH,YAAY,QAAwC,EAAE,EAAE,OAAwB;QAC9E,KAAK,CAAC,OAAO,CAAC,CAAC;QAUP,UAAK,GAAW,CAAC,CAAC;QAUlB,mBAAc,GAAY,IAAI,CAAC;QAU/B,UAAK,GAAa,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;QA7B3C,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;YAClC,IAAI,aAAa,KAAK,SAAS;gBAAE,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACvE,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAID;;;OAGG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAID;;;OAGG;IACH,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAID;;;OAGG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,IAAY;QACd,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxB,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,GAAG,GAAG,KAAK,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,CAAC;YACjB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,KAAqC;QAC3C,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,IAAS,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAc,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;OAOG;IACM,GAAG,CAAC,IAAY;QACvB,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,IAAY;QACjB,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,CAAS,EAAW,EAAE;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;wBAChB,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;4BAC5B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;wBACtB,CAAC;6BAAM,CAAC;4BACN,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBAC5B,CAAC;wBACD,SAAS,GAAG,IAAI,CAAC;wBACjB,OAAO,IAAI,CAAC;oBACd,CAAC;oBACD,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACnD,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClB,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS;QACP,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,CAAC,IAAc,EAAE,KAAa,EAAE,EAAE;gBAC5C,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrB,QAAQ,GAAG,KAAK,CAAC;gBACnB,CAAC;gBACD,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;gBAC1B,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;wBACvC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC,CAAC;YACF,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,aAAa,CAAC,KAAa;QACzB,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;QACd,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,SAAS,CAAC,KAAa;QACrB,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzB,GAAG,GAAG,KAAK,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,KAAa;QAC3B,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,EAAE;YAC5B,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,SAAS,KAAK,KAAK;gBAAE,OAAO;YAChC,IAAI,GAAG,CAAC,KAAK;gBAAE,OAAO;YACtB,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;gBACzF,OAAO;QACd,CAAC,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,OAAO,SAAS,KAAK,KAAK,CAAC;IAC7B,CAAC;IAED;;;;;;OAMG;IACH,sBAAsB;QACpB,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAa,EAAE,EAAE;YAC5B,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,GAAG,CAAC,KAAK;gBAAE,OAAO;YACtB,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;gBACzF,OAAO;QACd,CAAC,CAAC;QACF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,GAAG,MAAM,CAAC,gBAAgB,EAAE,oBAAoB,GAAG,KAAK;QAC/E,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,SAAS,GAAG,CAAC,IAAc,EAAE,IAAY;YACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC;oBAAE,OAAO;gBAC5B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QAED,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAE1B,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxC,IAAI,KAAK,EAAE,CAAC;oBACV,SAAS,GAAG,KAAK,CAAC;gBACpB,CAAC;qBAAM,CAAC;oBACN,gDAAgD;oBAChD,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,oBAAoB,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI;YAAE,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE5E,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,KAAK;QACH,OAAO,IAAI,IAAI,CAAI,IAAI,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACjG,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,SAA8C,EAAE,OAAa;QAClE,MAAM,OAAO,GAAG,IAAI,IAAI,CAAI,EAAE,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACtG,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;YACD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,GAAG,CACD,QAA4C,EAC5C,WAAwC,EACxC,OAAa;QAEb,MAAM,OAAO,GAAG,IAAI,IAAI,CAAK,EAAE,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACrF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACvD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACO,CAAC,YAAY;QACrB,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAc,EAAE,IAAY;YACzC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,CAAC;YACb,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9C,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,IAAc,MAAM;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACO,YAAY,CAAC,GAAW;QAChC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,+CAA+C;QAC1E,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAxcD,oBAwcC"}

package/dist/cjs/index.js

@@ -1,22 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./data-structures"), exports);
-__exportStar(require("./utils"), exports);
-__exportStar(require("./interfaces"), exports);
-__exportStar(require("./types"), exports);
-__exportStar(require("./common"), exports);
-//# sourceMappingURL=index.js.map

package/dist/cjs/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,oDAAkC;AAClC,0CAAwB;AACxB,+CAA6B;AAC7B,0CAAwB;AACxB,2CAAyB"}

package/dist/cjs/interfaces/binary-tree.d.ts

@@ -1,9 +0,0 @@
-import { BinaryTreeNode } from '../data-structures';
-import type { BinaryTreeDeleteResult, BinaryTreeOptions, BTNRep, NodePredicate } from '../types';
-export interface IBinaryTree<K = any, V = any, R = object, MK = any, MV = any, MR = object> {
-    createNode(key: K, value?: BinaryTreeNode['value']): BinaryTreeNode;
-    createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): IBinaryTree<K, V, R, MK, MV, MR>;
-    add(keyOrNodeOrEntryOrRawElement: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V, count?: number): boolean;
-    addMany(nodes: Iterable<BTNRep<K, V, BinaryTreeNode<K, V>>>, values?: Iterable<V | undefined>): boolean[];
-    delete(predicate: R | BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
-}

package/dist/cjs/interfaces/binary-tree.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=binary-tree.js.map

package/dist/cjs/interfaces/binary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-tree.js","sourceRoot":"","sources":["../../../src/interfaces/binary-tree.ts"],"names":[],"mappings":""}

package/dist/cjs/interfaces/doubly-linked-list.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=doubly-linked-list.js.map

package/dist/cjs/interfaces/doubly-linked-list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"doubly-linked-list.js","sourceRoot":"","sources":["../../../src/interfaces/doubly-linked-list.ts"],"names":[],"mappings":""}

package/dist/cjs/interfaces/graph.d.ts

@@ -1,5 +0,0 @@
-import { VertexKey } from '../types';
-export interface IGraph<V, E, VO, EO> {
-    createVertex(key: VertexKey, value?: V): VO;
-    createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
-}

package/dist/cjs/interfaces/graph.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=graph.js.map