data-structure-typed 1.21.4 → 1.31.0

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

@@ -1,82 +1,136 @@
 "use strict";
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Trie = exports.TrieNode = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-class TrieNode {
-    constructor(v) {
+var TrieNode = (function () {
+    function TrieNode(v) {
         this._val = v;
         this._isEnd = false;
         this._children = new Map();
     }
-    get val() {
-        return this._val;
-    }
-    set val(v) {
-        this._val = v;
-    }
-    get children() {
-        return this._children;
-    }
-    set children(v) {
-        this._children = v;
-    }
-    get isEnd() {
-        return this._isEnd;
-    }
-    set isEnd(v) {
-        this._isEnd = v;
-    }
-}
+    Object.defineProperty(TrieNode.prototype, "val", {
+        get: function () {
+            return this._val;
+        },
+        set: function (v) {
+            this._val = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TrieNode.prototype, "children", {
+        get: function () {
+            return this._children;
+        },
+        set: function (v) {
+            this._children = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TrieNode.prototype, "isEnd", {
+        get: function () {
+            return this._isEnd;
+        },
+        set: function (v) {
+            this._isEnd = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return TrieNode;
+}());
 exports.TrieNode = TrieNode;
-class Trie {
-    constructor(words) {
+var Trie = (function () {
+    function Trie(words) {
+        var e_1, _a;
         this._root = new TrieNode('');
         if (words) {
-            for (const i of words) {
-                this.add(i);
+            try {
+                for (var words_1 = __values(words), words_1_1 = words_1.next(); !words_1_1.done; words_1_1 = words_1.next()) {
+                    var i = words_1_1.value;
+                    this.add(i);
+                }
+            }
+            catch (e_1_1) { e_1 = { error: e_1_1 }; }
+            finally {
+                try {
+                    if (words_1_1 && !words_1_1.done && (_a = words_1.return)) _a.call(words_1);
+                }
+                finally { if (e_1) throw e_1.error; }
             }
         }
     }
-    get root() {
-        return this._root;
-    }
-    set root(v) {
-        this._root = v;
-    }
-    add(word) {
-        let cur = this._root;
-        for (const c of word) {
-            let nodeC = cur.children.get(c);
-            if (!nodeC) {
-                nodeC = new TrieNode(c);
-                cur.children.set(c, nodeC);
-            }
-            cur = nodeC;
+    Object.defineProperty(Trie.prototype, "root", {
+        get: function () {
+            return this._root;
+        },
+        set: function (v) {
+            this._root = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Trie.prototype.add = function (word) {
+        var e_2, _a;
+        var cur = this._root;
+        try {
+            for (var word_1 = __values(word), word_1_1 = word_1.next(); !word_1_1.done; word_1_1 = word_1.next()) {
+                var c = word_1_1.value;
+                var nodeC = cur.children.get(c);
+                if (!nodeC) {
+                    nodeC = new TrieNode(c);
+                    cur.children.set(c, nodeC);
+                }
+                cur = nodeC;
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (word_1_1 && !word_1_1.done && (_a = word_1.return)) _a.call(word_1);
+            }
+            finally { if (e_2) throw e_2.error; }
         }
         cur.isEnd = true;
         return true;
-    }
-    has(input) {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
+    };
+    Trie.prototype.has = function (input) {
+        var e_3, _a;
+        var cur = this._root;
+        try {
+            for (var input_1 = __values(input), input_1_1 = input_1.next(); !input_1_1.done; input_1_1 = input_1.next()) {
+                var c = input_1_1.value;
+                var nodeC = cur.children.get(c);
+                if (!nodeC)
+                    return false;
+                cur = nodeC;
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (input_1_1 && !input_1_1.done && (_a = input_1.return)) _a.call(input_1);
+            }
+            finally { if (e_3) throw e_3.error; }
         }
         return cur.isEnd;
-    }
-    remove(word) {
-        let isDeleted = false;
-        const dfs = (cur, i) => {
-            const char = word[i];
-            const child = cur.children.get(char);
+    };
+    Trie.prototype.remove = function (word) {
+        var isDeleted = false;
+        var dfs = function (cur, i) {
+            var char = word[i];
+            var child = cur.children.get(char);
             if (child) {
                 if (i === word.length - 1) {
                     if (child.isEnd) {
@@ -91,7 +145,7 @@ class Trie {
                     }
                     return false;
                 }
-                const res = dfs(child, i + 1);
+                var res = dfs(child, i + 1);
                 if (res && !cur.isEnd && child.children.size === 0) {
                     cur.children.delete(char);
                     return true;
@@ -102,47 +156,52 @@ class Trie {
         };
         dfs(this.root, 0);
         return isDeleted;
-    }
-    // --- start additional methods ---
-    /**
-     * The function checks if a given input string has an absolute prefix in a tree data structure.Only can present as a prefix, not a word
-     * @param {string} input - The input parameter is a string that represents the input value for the function.
-     * @returns a boolean value.
-     */
-    isAbsPrefix(input) {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
+    };
+    Trie.prototype.isAbsPrefix = function (input) {
+        var e_4, _a;
+        var cur = this._root;
+        try {
+            for (var input_2 = __values(input), input_2_1 = input_2.next(); !input_2_1.done; input_2_1 = input_2.next()) {
+                var c = input_2_1.value;
+                var nodeC = cur.children.get(c);
+                if (!nodeC)
+                    return false;
+                cur = nodeC;
+            }
+        }
+        catch (e_4_1) { e_4 = { error: e_4_1 }; }
+        finally {
+            try {
+                if (input_2_1 && !input_2_1.done && (_a = input_2.return)) _a.call(input_2);
+            }
+            finally { if (e_4) throw e_4.error; }
         }
         return !cur.isEnd;
-    }
-    /**
-     * The function checks if a given input string is a prefix of any existing string in a tree structure.Can present as a abs prefix or word
-     * @param {string} input - The input parameter is a string that represents the prefix we want to check.
-     * @returns a boolean value.
-     */
-    isPrefix(input) {
-        let cur = this._root;
-        for (const c of input) {
-            const nodeC = cur.children.get(c);
-            if (!nodeC)
-                return false;
-            cur = nodeC;
+    };
+    Trie.prototype.isPrefix = function (input) {
+        var e_5, _a;
+        var cur = this._root;
+        try {
+            for (var input_3 = __values(input), input_3_1 = input_3.next(); !input_3_1.done; input_3_1 = input_3.next()) {
+                var c = input_3_1.value;
+                var nodeC = cur.children.get(c);
+                if (!nodeC)
+                    return false;
+                cur = nodeC;
+            }
+        }
+        catch (e_5_1) { e_5 = { error: e_5_1 }; }
+        finally {
+            try {
+                if (input_3_1 && !input_3_1.done && (_a = input_3.return)) _a.call(input_3);
+            }
+            finally { if (e_5) throw e_5.error; }
         }
         return true;
-    }
-    /**
-     * The function checks if the input string is a common prefix in a Trie data structure.Check if the input string is the common prefix of all the words
-     * @param {string} input - The input parameter is a string that represents the common prefix that we want to check for
-     * in the Trie data structure.
-     * @returns a boolean value indicating whether the input string is a common prefix in the Trie data structure.
-     */
-    isCommonPrefix(input) {
-        let commonPre = '';
-        const dfs = (cur) => {
+    };
+    Trie.prototype.isCommonPrefix = function (input) {
+        var commonPre = '';
+        var dfs = function (cur) {
             commonPre += cur.val;
             if (commonPre === input)
                 return;
@@ -155,16 +214,10 @@ class Trie {
         };
         dfs(this._root);
         return commonPre === input;
-    }
-    /**
-     * The function `getLongestCommonPrefix` returns the longest common prefix among all the words stored in a Trie data
-     * structure.
-     * @returns The function `getLongestCommonPrefix` returns a string, which is the longest common prefix found in the
-     * Trie.
-     */
-    getLongestCommonPrefix() {
-        let commonPre = '';
-        const dfs = (cur) => {
+    };
+    Trie.prototype.getLongestCommonPrefix = function () {
+        var commonPre = '';
+        var dfs = function (cur) {
             commonPre += cur.val;
             if (cur.isEnd)
                 return;
@@ -175,36 +228,55 @@ class Trie {
         };
         dfs(this._root);
         return commonPre;
-    }
-    /**
-     * The `getAll` function returns an array of all words in a Trie data structure that start with a given prefix.
-     * @param [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.
-     * @returns an array of strings.
-     */
-    getAll(prefix = '') {
-        const words = [];
+    };
+    Trie.prototype.getAll = function (prefix) {
+        var e_6, _a;
+        if (prefix === void 0) { prefix = ''; }
+        var words = [];
         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));
+            var e_7, _a;
+            try {
+                for (var _b = __values(node.children.keys()), _c = _b.next(); !_c.done; _c = _b.next()) {
+                    var char = _c.value;
+                    var charNode = node.children.get(char);
+                    if (charNode !== undefined) {
+                        dfs(charNode, word.concat(char));
+                    }
                 }
             }
+            catch (e_7_1) { e_7 = { error: e_7_1 }; }
+            finally {
+                try {
+                    if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+                }
+                finally { if (e_7) throw e_7.error; }
+            }
             if (node.isEnd) {
                 words.push(word);
             }
         }
-        let startNode = this._root;
+        var startNode = this._root;
         if (prefix) {
-            for (const c of prefix) {
-                const nodeC = startNode.children.get(c);
-                if (nodeC)
-                    startNode = nodeC;
+            try {
+                for (var prefix_1 = __values(prefix), prefix_1_1 = prefix_1.next(); !prefix_1_1.done; prefix_1_1 = prefix_1.next()) {
+                    var c = prefix_1_1.value;
+                    var nodeC = startNode.children.get(c);
+                    if (nodeC)
+                        startNode = nodeC;
+                }
+            }
+            catch (e_6_1) { e_6 = { error: e_6_1 }; }
+            finally {
+                try {
+                    if (prefix_1_1 && !prefix_1_1.done && (_a = prefix_1.return)) _a.call(prefix_1);
+                }
+                finally { if (e_6) throw e_6.error; }
             }
         }
         dfs(startNode, prefix);
         return words;
-    }
-}
+    };
+    return Trie;
+}());
 exports.Trie = Trie;
+//# sourceMappingURL=trie.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"trie.js","sourceRoot":"","sources":["../../../src/data-structures/trie/trie.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAOA;IACE,kBAAY,CAAS;QACnB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,CAAC;IAID,sBAAI,yBAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,CAAS;YACf,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,CAAC;;;OAJA;IAQD,sBAAI,8BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,CAAwB;YACnC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACrB,CAAC;;;OAJA;IAQD,sBAAI,2BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,CAAU;YAClB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,CAAC;;;OAJA;IAKH,eAAC;AAAD,CAAC,AApCD,IAoCC;AApCY,4BAAQ;AAsCrB;IACE,cAAY,KAAgB;;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,KAAK,EAAE;;gBACT,KAAgB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;oBAAlB,IAAM,CAAC,kBAAA;oBACV,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACb;;;;;;;;;SACF;IACH,CAAC;IAID,sBAAI,sBAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,CAAW;YAClB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACjB,CAAC;;;OAJA;IAMD,kBAAG,GAAH,UAAI,IAAY;;QACd,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;;YACrB,KAAgB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;gBAAjB,IAAM,CAAC,iBAAA;gBACV,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,CAAC,KAAK,EAAE;oBACV,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;oBACxB,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;iBAC5B;gBACD,GAAG,GAAG,KAAK,CAAC;aACb;;;;;;;;;QACD,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,kBAAG,GAAH,UAAI,KAAa;;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;;YACrB,KAAgB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;gBAAlB,IAAM,CAAC,kBAAA;gBACV,IAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAC;gBACzB,GAAG,GAAG,KAAK,CAAC;aACb;;;;;;;;;QACD,OAAO,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,qBAAM,GAAN,UAAO,IAAY;QACjB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAM,GAAG,GAAG,UAAC,GAAa,EAAE,CAAS;YACnC,IAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,KAAK,EAAE;gBACT,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;oBACzB,IAAI,KAAK,CAAC,KAAK,EAAE;wBACf,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;4BAC3B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;yBACrB;6BAAM;4BACL,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;yBAC3B;wBACD,SAAS,GAAG,IAAI,CAAC;wBACjB,OAAO,IAAI,CAAC;qBACb;oBACD,OAAO,KAAK,CAAC;iBACd;gBACD,IAAM,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;oBAClD,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,OAAO,IAAI,CAAC;iBACb;gBACD,OAAO,KAAK,CAAC;aACd;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClB,OAAO,SAAS,CAAC;IACnB,CAAC;IAQD,0BAAW,GAAX,UAAY,KAAa;;QACvB,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;;YACrB,KAAgB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;gBAAlB,IAAM,CAAC,kBAAA;gBACV,IAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAC;gBACzB,GAAG,GAAG,KAAK,CAAC;aACb;;;;;;;;;QACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;IACpB,CAAC;IAOD,uBAAQ,GAAR,UAAS,KAAa;;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;;YACrB,KAAgB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;gBAAlB,IAAM,CAAC,kBAAA;gBACV,IAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClC,IAAI,CAAC,KAAK;oBAAE,OAAO,KAAK,CAAC;gBACzB,GAAG,GAAG,KAAK,CAAC;aACb;;;;;;;;;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAQD,6BAAc,GAAd,UAAe,KAAa;QAC1B,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAM,GAAG,GAAG,UAAC,GAAa;YACxB,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,KAAK,CAAC,CAAC;QAChB,OAAO,SAAS,KAAK,KAAK,CAAC;IAC7B,CAAC;IAQD,qCAAsB,GAAtB;QACE,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAM,GAAG,GAAG,UAAC,GAAa;YACxB,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,KAAK,CAAC,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IAQD,qBAAM,GAAN,UAAO,MAAW;;QAAX,uBAAA,EAAA,WAAW;QAChB,IAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,SAAS,GAAG,CAAC,IAAc,EAAE,IAAY;;;gBACvC,KAAmB,IAAA,KAAA,SAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA,gBAAA,4BAAE;oBAApC,IAAM,IAAI,WAAA;oBACb,IAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACzC,IAAI,QAAQ,KAAK,SAAS,EAAE;wBAC1B,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;qBAClC;iBACF;;;;;;;;;YACD,IAAI,IAAI,CAAC,KAAK,EAAE;gBACd,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAClB;QACH,CAAC;QAED,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;QAE3B,IAAI,MAAM,EAAE;;gBACV,KAAgB,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE;oBAAnB,IAAM,CAAC,mBAAA;oBACV,IAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,KAAK;wBAAE,SAAS,GAAG,KAAK,CAAC;iBAC9B;;;;;;;;;SACF;QAED,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAGH,WAAC;AAAD,CAAC,AAnLD,IAmLC;AAnLY,oBAAI"}

package/dist/index.js

@@ -18,3 +18,4 @@ __exportStar(require("./data-structures"), exports);
 __exportStar(require("./utils"), exports);
 __exportStar(require("./interfaces"), exports);
 __exportStar(require("./types"), exports);
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

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

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

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

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

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

package/dist/interfaces/abstract-graph.js

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

package/dist/interfaces/abstract-graph.js.map

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

package/dist/interfaces/avl-tree.js

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

package/dist/interfaces/avl-tree.js.map

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

package/dist/interfaces/binary-tree.js

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

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

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

package/dist/interfaces/bst.js

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

package/dist/interfaces/bst.js.map

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

package/dist/interfaces/directed-graph.js

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

package/dist/interfaces/directed-graph.js.map

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

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

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

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

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

package/dist/interfaces/heap.js

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

package/dist/interfaces/heap.js.map

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

package/dist/interfaces/index.js

@@ -29,3 +29,4 @@ __exportStar(require("./segment-tree"), exports);
 __exportStar(require("./singly-linked-list"), exports);
 __exportStar(require("./tree-multiset"), exports);
 __exportStar(require("./undirected-graph"), exports);
+//# sourceMappingURL=index.js.map

package/dist/interfaces/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/interfaces/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,yDAAuC;AACvC,mDAAiC;AACjC,6CAA2B;AAC3B,gDAA8B;AAC9B,wCAAsB;AACtB,mDAAiC;AACjC,uDAAqC;AACrC,yCAAuB;AACvB,8CAA4B;AAC5B,mDAAiC;AACjC,4CAA0B;AAC1B,iDAA+B;AAC/B,uDAAqC;AACrC,kDAAgC;AAChC,qDAAmC"}

package/dist/interfaces/navigator.js

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

package/dist/interfaces/navigator.js.map

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

package/dist/interfaces/priority-queue.js

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

package/dist/interfaces/priority-queue.js.map

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

package/dist/interfaces/rb-tree.js

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

package/dist/interfaces/rb-tree.js.map

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

package/dist/interfaces/segment-tree.js

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

package/dist/interfaces/segment-tree.js.map

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

package/dist/interfaces/singly-linked-list.js

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

package/dist/interfaces/singly-linked-list.js.map

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

package/dist/interfaces/tree-multiset.js

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

package/dist/interfaces/tree-multiset.js.map

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

package/dist/interfaces/undirected-graph.js

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

package/dist/interfaces/undirected-graph.js.map

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

package/dist/types/data-structures/abstract-binary-tree.js

@@ -1,18 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.FamilyPosition = exports.LoopType = void 0;
-/**
- * Enum representing different loop types.
- *
- * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
- * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
- */
 var LoopType;
 (function (LoopType) {
     LoopType["ITERATIVE"] = "ITERATIVE";
     LoopType["RECURSIVE"] = "RECURSIVE";
 })(LoopType = exports.LoopType || (exports.LoopType = {}));
-/* This enumeration defines the position of a node within a family tree composed of three associated nodes, where 'root' represents the root node of the family tree, 'left' represents the left child node, and 'right' represents the right child node. */
 var FamilyPosition;
 (function (FamilyPosition) {
     FamilyPosition["ROOT"] = "ROOT";
@@ -23,3 +16,4 @@ var FamilyPosition;
     FamilyPosition["ISOLATED"] = "ISOLATED";
     FamilyPosition["MAL_NODE"] = "MAL_NODE";
 })(FamilyPosition = exports.FamilyPosition || (exports.FamilyPosition = {}));
+//# sourceMappingURL=abstract-binary-tree.js.map

package/dist/types/data-structures/abstract-binary-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abstract-binary-tree.js","sourceRoot":"","sources":["../../../src/types/data-structures/abstract-binary-tree.ts"],"names":[],"mappings":";;;AASA,IAAY,QAGX;AAHD,WAAY,QAAQ;IAClB,mCAAuB,CAAA;IACvB,mCAAuB,CAAA;AACzB,CAAC,EAHW,QAAQ,GAAR,gBAAQ,KAAR,gBAAQ,QAGnB;AAGD,IAAY,cAQX;AARD,WAAY,cAAc;IACxB,+BAAa,CAAA;IACb,+BAAa,CAAA;IACb,iCAAe,CAAA;IACf,yCAAuB,CAAA;IACvB,2CAAyB,CAAA;IACzB,uCAAqB,CAAA;IACrB,uCAAqB,CAAA;AACvB,CAAC,EARW,cAAc,GAAd,sBAAc,KAAd,sBAAc,QAQzB"}

package/dist/types/data-structures/abstract-graph.js

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

package/dist/types/data-structures/abstract-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abstract-graph.js","sourceRoot":"","sources":["../../../src/types/data-structures/abstract-graph.ts"],"names":[],"mappings":""}

package/dist/types/data-structures/avl-tree.js

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

package/dist/types/data-structures/avl-tree.js.map

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

package/dist/types/data-structures/binary-tree.js

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

package/dist/types/data-structures/binary-tree.js.map

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

package/dist/types/data-structures/bst.js

@@ -7,3 +7,4 @@ var CP;
     CP["eq"] = "eq";
     CP["gt"] = "gt";
 })(CP = exports.CP || (exports.CP = {}));
+//# sourceMappingURL=bst.js.map

package/dist/types/data-structures/bst.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bst.js","sourceRoot":"","sources":["../../../src/types/data-structures/bst.ts"],"names":[],"mappings":";;;AAYA,IAAY,EAAoC;AAAhD,WAAY,EAAE;IAAE,eAAS,CAAA;IAAE,eAAS,CAAA;IAAE,eAAS,CAAA;AAAA,CAAC,EAApC,EAAE,GAAF,UAAE,KAAF,UAAE,QAAkC"}

package/dist/types/data-structures/directed-graph.js

@@ -7,3 +7,4 @@ var TopologicalProperty;
     TopologicalProperty["NODE"] = "NODE";
     TopologicalProperty["ID"] = "ID";
 })(TopologicalProperty = exports.TopologicalProperty || (exports.TopologicalProperty = {}));
+//# sourceMappingURL=directed-graph.js.map