data-structure-typed 2.1.0 → 2.1.1

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

@@ -1 +0,0 @@
-{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../../../src/data-structures/stack/stack.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAC;AAE9C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoIG;AACH,MAAM,OAAO,KAAwB,SAAQ,mBAAyB;IAC1D,OAAO,GAA4B,MAAM,CAAC,EAAwC,CAAC;IAE7F;;;;;;OAMG;IAEH,YAAY,WAAsC,EAAE,EAAE,OAA4B;QAChF,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1B,CAAC;IAES,SAAS,GAAQ,EAAE,CAAC;IAE9B;;;;OAIG;IAEH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;;;OAIG;IAEH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;;;;OASG;IAEH,MAAM,CAAC,SAAS,CAEd,QAAa,EACb,OAA4B;QAE5B,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrC,CAAC;IAED;;;;OAIG;IAEH,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IAEH,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED;;;;;OAKG;IAEH,IAAI,CAAC,OAAU;QACb,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IAEH,GAAG;QACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IAEH,QAAQ,CAAC,QAAmC;QAC1C,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,WAAW;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,EAAO,CAAC,CAAC,CAAC,CAAC;;gBAChE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAO,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IAEH,MAAM,CAAC,OAAU;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;OAKG;IAEH,QAAQ,CAAC,KAAa;QACpB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC7D,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/C,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IAEH,WAAW,CAAC,SAA4D;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC3B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IAEH,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAED;;;;OAIG;IAEH,KAAK;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACpE,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IAEH,MAAM,CAAC,SAAyC,EAAE,OAAiB;QACjE,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACpE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IAEH,OAAO,CAAC,QAAkC,EAAE,OAAiB;QAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACpE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,EAAE,GAAG,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YACzG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;OASG;IAEH,GAAG,CACD,QAAmC,EACnC,OAA4C,EAC5C,OAAiB;QAEjB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAS,EAAE,EAAE,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACpG,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IAEH,WAAW,CAAC,MAA+B;QACzC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IAEO,gBAAgB,CAAC,MAAS;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;gBAAE,OAAO,CAAC,CAAC;QACpG,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED;;;;;OAKG;IAEO,eAAe,CAAC,OAA4B;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,WAA+F,CAAC;QAClH,OAAO,IAAI,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;;OAQG;IAEO,WAAW,CACnB,WAAuC,EAAE,EACzC,OAA6B;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAGD,CAAC;QAClB,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrC,CAAC;IAED;;;;OAIG;IAEO,CAAC,YAAY;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;CACF"}

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

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

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

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

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

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

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,350 +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';
-/**
- * Node used by Trie to store one character and its children.
- * @remarks Time O(1), Space O(1)
- */
-export declare class TrieNode {
-    /**
-     * Create a Trie node with a character key.
-     * @remarks Time O(1), Space O(1)
-     * @returns New TrieNode instance.
-     */
-    constructor(key: string);
-    protected _key: string;
-    /**
-     * Get the character key of this node.
-     * @remarks Time O(1), Space O(1)
-     * @returns Character key string.
-     */
-    get key(): string;
-    /**
-     * Set the character key of this node.
-     * @remarks Time O(1), Space O(1)
-     * @param value - New character key.
-     * @returns void
-     */
-    set key(value: string);
-    protected _children: Map<string, TrieNode>;
-    /**
-     * Get the child map of this node.
-     * @remarks Time O(1), Space O(1)
-     * @returns Map from character to child node.
-     */
-    get children(): Map<string, TrieNode>;
-    /**
-     * Replace the child map of this node.
-     * @remarks Time O(1), Space O(1)
-     * @param value - New map of character → node.
-     * @returns void
-     */
-    set children(value: Map<string, TrieNode>);
-    protected _isEnd: boolean;
-    /**
-     * Check whether this node marks the end of a word.
-     * @remarks Time O(1), Space O(1)
-     * @returns True if this node ends a word.
-     */
-    get isEnd(): boolean;
-    /**
-     * Mark this node as the end of a word or not.
-     * @remarks Time O(1), Space O(1)
-     * @param value - Whether this node ends a word.
-     * @returns void
-     */
-    set isEnd(value: boolean);
-}
-/**
- * Prefix tree (Trie) for fast prefix queries and word storage.
- * @remarks Time O(1), Space O(1)
- * @template R
- * 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> {
-    /**
-     * Create a Trie and optionally bulk-insert words.
-     * @remarks Time O(totalChars), Space O(totalChars)
-     * @param [words] - Iterable of strings (or raw records if toElementFn is provided).
-     * @param [options] - Options such as toElementFn and caseSensitive.
-     * @returns New Trie instance.
-     */
-    constructor(words?: Iterable<string> | Iterable<R>, options?: TrieOptions<R>);
-    protected _size: number;
-    /**
-     * Get the number of stored words.
-     * @remarks Time O(1), Space O(1)
-     * @returns Word count.
-     */
-    get size(): number;
-    protected _caseSensitive: boolean;
-    /**
-     * Get whether comparisons are case-sensitive.
-     * @remarks Time O(1), Space O(1)
-     * @returns True if case-sensitive.
-     */
-    get caseSensitive(): boolean;
-    protected _root: TrieNode;
-    /**
-     * Get the root node.
-     * @remarks Time O(1), Space O(1)
-     * @returns Root TrieNode.
-     */
-    get root(): TrieNode;
-    /**
-     * (Protected) Get total count for base class iteration.
-     * @remarks Time O(1), Space O(1)
-     * @returns Total number of elements.
-     */
-    protected get _total(): number;
-    /**
-     * Insert one word into the trie.
-     * @remarks Time O(L), Space O(L)
-     * @param word - Word to insert.
-     * @returns True if the word was newly added.
-     */
-    add(word: string): boolean;
-    /**
-     * Insert many words from an iterable.
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @param words - Iterable of strings (or raw records if toElementFn is provided).
-     * @returns Array of per-word 'added' flags.
-     */
-    addMany(words: Iterable<string> | Iterable<R>): boolean[];
-    /**
-     * Check whether a word exists.
-     * @remarks Time O(L), Space O(1)
-     * @param word - Word to search for.
-     * @returns True if present.
-     */
-    has(word: string): boolean;
-    /**
-     * Check whether the trie is empty.
-     * @remarks Time O(1), Space O(1)
-     * @returns True if size is 0.
-     */
-    isEmpty(): boolean;
-    /**
-     * Remove all words and reset to a fresh root.
-     * @remarks Time O(1), Space O(1)
-     * @returns void
-     */
-    clear(): void;
-    /**
-     * Delete one word if present.
-     * @remarks Time O(L), Space O(1)
-     * @param word - Word to delete.
-     * @returns True if a word was removed.
-     */
-    delete(word: string): boolean;
-    /**
-     * Compute the height (max depth) of the trie.
-     * @remarks Time O(N), Space O(H)
-     * @returns Maximum depth from root to a leaf.
-     */
-    getHeight(): number;
-    /**
-     * Check whether input is a proper prefix of at least one word.
-     * @remarks Time O(L), Space O(1)
-     * @param input - String to test as prefix.
-     * @returns True if input is a prefix but not a full word.
-     */
-    hasPurePrefix(input: string): boolean;
-    /**
-     * Check whether any word starts with input.
-     * @remarks Time O(L), Space O(1)
-     * @param input - String to test as prefix.
-     * @returns True if input matches a path from root.
-     */
-    hasPrefix(input: string): boolean;
-    /**
-     * Check whether the trie’s longest common prefix equals input.
-     * @remarks Time O(min(H,L)), Space O(1)
-     * @param input - Candidate longest common prefix.
-     * @returns True if input equals the common prefix.
-     */
-    hasCommonPrefix(input: string): boolean;
-    /**
-     * Return the longest common prefix among all words.
-     * @remarks Time O(H), Space O(1)
-     * @returns The longest common prefix string.
-     */
-    getLongestCommonPrefix(): string;
-    /**
-     * Collect words under a prefix up to a maximum count.
-     * @remarks Time O(K·L), Space O(K·L)
-     * @param [prefix] - Prefix to match; default empty string for root.
-     * @param [max] - Maximum number of words to return; default is Number.MAX_SAFE_INTEGER.
-     * @param [isAllWhenEmptyPrefix] - When true, collect from root even if prefix is empty.
-     * @returns Array of collected words (at most max).
-     */
-    getWords(prefix?: string, max?: number, isAllWhenEmptyPrefix?: boolean): string[];
-    /**
-     * Deep clone this trie by iterating and inserting all words.
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @returns A new trie with the same words and options.
-     */
-    clone(): this;
-    /**
-     * Filter words into a new trie of the same class.
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @param predicate - Predicate (word, index, trie) → boolean to keep word.
-     * @param [thisArg] - Value for `this` inside the predicate.
-     * @returns A new trie containing words that satisfy the predicate.
-     */
-    filter(predicate: ElementCallback<string, R, boolean>, thisArg?: any): this;
-    map<RM>(callback: ElementCallback<string, R, string>, options?: TrieOptions<RM>, thisArg?: any): Trie<RM>;
-    /**
-     * Map words into a new trie (possibly different record type).
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @template EM
-     * @template RM
-     * @param callback - Mapping function (word, index, trie) → newWord (string).
-     * @param [options] - Options for the output trie (e.g., toElementFn, caseSensitive).
-     * @param [thisArg] - Value for `this` inside the callback.
-     * @returns A new Trie constructed from mapped words.
-     */
-    map<EM, RM>(callback: ElementCallback<string, R, EM>, options?: TrieOptions<RM>, thisArg?: any): IterableElementBase<EM, RM>;
-    /**
-     * Map words into a new trie of the same element type.
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @param callback - Mapping function (word, index, trie) → string.
-     * @param [thisArg] - Value for `this` inside the callback.
-     * @returns A new trie with mapped words.
-     */
-    mapSame(callback: ElementCallback<string, R, string>, thisArg?: any): this;
-    /**
-     * (Protected) Create an empty instance of the same concrete class.
-     * @remarks Time O(1), Space O(1)
-     * @param [options] - Options forwarded to the constructor.
-     * @returns An empty like-kind trie instance.
-     */
-    protected _createInstance(options?: TrieOptions<R>): this;
-    /**
-     * (Protected) Create a like-kind trie and seed it from an iterable.
-     * @remarks Time O(ΣL), Space O(ΣL)
-     * @template RM
-     * @param [elements] - Iterable used to seed the new trie.
-     * @param [options] - Options forwarded to the constructor.
-     * @returns A like-kind Trie instance.
-     */
-    protected _createLike<RM>(elements?: Iterable<string> | Iterable<RM>, options?: TrieOptions<RM>): Trie<RM>;
-    /**
-     * (Protected) Spawn an empty like-kind trie instance.
-     * @remarks Time O(1), Space O(1)
-     * @template RM
-     * @param [options] - Options forwarded to the constructor.
-     * @returns An empty like-kind Trie instance.
-     */
-    protected _spawnLike<RM>(options?: TrieOptions<RM>): Trie<RM>;
-    /**
-     * (Protected) Iterate all words in lexicographic order of edges.
-     * @remarks Time O(ΣL), Space O(H)
-     * @returns Iterator of words.
-     */
-    protected _getIterator(): IterableIterator<string>;
-    /**
-     * (Protected) Normalize a string according to case sensitivity.
-     * @remarks Time O(L), Space O(L)
-     * @param str - Input string to normalize.
-     * @returns Normalized string based on caseSensitive.
-     */
-    protected _caseProcess(str: string): string;
-}