nlptoolkit-datastructure 1.0.8 → 1.0.9

package/dist/tree/BTreeNode.js

@@ -1,191 +1,186 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
-    }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.BTreeNode = void 0;
-    class BTreeNode {
-        /**
-         * Another constructor of a B+ Tree node. By default, it is not a leaf node. Adds two children.
-         * @param d d in d-ary tree.
-         * @param firstChild First child of the root node.
-         * @param secondChild Second child of the root node.
-         * @param newK First value in the node.
-         */
-        constructor(d, firstChild, secondChild, newK) {
-            this.d = d;
-            this.K = [];
-            this.children = [];
-            if (firstChild == undefined) {
-                this.m = 0;
-                this.leaf = true;
-            }
-            else {
-                this.m = 1;
-                this.leaf = false;
-                this.children[0] = firstChild;
-                if (secondChild != undefined) {
-                    this.children[1] = secondChild;
-                }
-                if (newK != undefined) {
-                    this.K[0] = newK;
-                }
-            }
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BTreeNode = void 0;
+class BTreeNode {
+    K;
+    m;
+    d;
+    leaf;
+    children;
+    /**
+     * Another constructor of a B+ Tree node. By default, it is not a leaf node. Adds two children.
+     * @param d d in d-ary tree.
+     * @param firstChild First child of the root node.
+     * @param secondChild Second child of the root node.
+     * @param newK First value in the node.
+     */
+    constructor(d, firstChild, secondChild, newK) {
+        this.d = d;
+        this.K = [];
+        this.children = [];
+        if (firstChild == undefined) {
+            this.m = 0;
+            this.leaf = true;
         }
-        /**
-         * Searches the position of value in the list K. If the searched value is larger than the last value of node, we
-         * need to continue the search with the rightmost child. If the searched value is smaller than the i. value of node,
-         * we need to continue the search with the i. child.
-         * @param value Searched value
-         * @param comparator Comparator function which compares two elements.
-         * @return The position of searched value in array K.
-         */
-        position(value, comparator) {
-            if (this.m == 0) {
-                return 0;
+        else {
+            this.m = 1;
+            this.leaf = false;
+            this.children[0] = firstChild;
+            if (secondChild != undefined) {
+                this.children[1] = secondChild;
             }
-            if (comparator(value, this.K[this.m - 1]) > 0) {
-                return this.m;
+            if (newK != undefined) {
+                this.K[0] = newK;
             }
-            else {
-                for (let i = 0; i < this.m; i++) {
-                    if (comparator(value, this.K[i]) <= 0) {
-                        return i;
-                    }
+        }
+    }
+    /**
+     * Searches the position of value in the list K. If the searched value is larger than the last value of node, we
+     * need to continue the search with the rightmost child. If the searched value is smaller than the i. value of node,
+     * we need to continue the search with the i. child.
+     * @param value Searched value
+     * @param comparator Comparator function which compares two elements.
+     * @return The position of searched value in array K.
+     */
+    position(value, comparator) {
+        if (this.m == 0) {
+            return 0;
+        }
+        if (comparator(value, this.K[this.m - 1]) > 0) {
+            return this.m;
+        }
+        else {
+            for (let i = 0; i < this.m; i++) {
+                if (comparator(value, this.K[i]) <= 0) {
+                    return i;
                 }
             }
-            return -1;
         }
-        /**
-         * Add the new value insertedK to the array K into the calculated position index.
-         * @param index Place to insert new value
-         * @param insertedK New value to be inserted.
-         */
-        insertIntoK(index, insertedK) {
-            for (let i = this.m; i > index; i--) {
-                this.K[i] = this.K[i - 1];
-            }
-            this.K[index] = insertedK;
+        return -1;
+    }
+    /**
+     * Add the new value insertedK to the array K into the calculated position index.
+     * @param index Place to insert new value
+     * @param insertedK New value to be inserted.
+     */
+    insertIntoK(index, insertedK) {
+        for (let i = this.m; i > index; i--) {
+            this.K[i] = this.K[i - 1];
         }
-        /**
-         * Transfers the last d values of the current node to the newNode.
-         * @param newNode New node.
-         */
-        moveHalfOfTheKToNewNode(newNode) {
-            for (let i = 0; i < this.d; i++) {
-                newNode.K[i] = this.K[i + this.d + 1];
-            }
-            newNode.m = this.d;
+        this.K[index] = insertedK;
+    }
+    /**
+     * Transfers the last d values of the current node to the newNode.
+     * @param newNode New node.
+     */
+    moveHalfOfTheKToNewNode(newNode) {
+        for (let i = 0; i < this.d; i++) {
+            newNode.K[i] = this.K[i + this.d + 1];
         }
-        /**
-         * Transfers the last d links of the current node to the newNode.
-         * @param newNode New node.
-         */
-        moveHalfOfTheChildrenToNewNode(newNode) {
-            for (let i = 0; i < this.d; i++) {
-                newNode.children[i] = this.children[i + this.d + 1];
-            }
+        newNode.m = this.d;
+    }
+    /**
+     * Transfers the last d links of the current node to the newNode.
+     * @param newNode New node.
+     */
+    moveHalfOfTheChildrenToNewNode(newNode) {
+        for (let i = 0; i < this.d; i++) {
+            newNode.children[i] = this.children[i + this.d + 1];
         }
-        /**
-         * Transfers the last d values and the last d links of the current node to the newNode.
-         * @param newNode New node.
-         */
-        moveHalfOfTheElementsToNewNode(newNode) {
-            this.moveHalfOfTheKToNewNode(newNode);
-            this.moveHalfOfTheChildrenToNewNode(newNode);
+    }
+    /**
+     * Transfers the last d values and the last d links of the current node to the newNode.
+     * @param newNode New node.
+     */
+    moveHalfOfTheElementsToNewNode(newNode) {
+        this.moveHalfOfTheKToNewNode(newNode);
+        this.moveHalfOfTheChildrenToNewNode(newNode);
+    }
+    /**
+     * First the function position is used to determine the node or the subtree to which the new node will be added.
+     * If this subtree is a leaf node, we call the function insertLeaf that will add the value to a leaf node. If this
+     * subtree is not a leaf node the function calls itself with the determined subtree. Both insertNode and insertLeaf
+     * functions, if adding a new value/node to that node/subtree necessitates a new child node to be added to the
+     * parent node, they will both return the new added node and the node obtained by dividing the original node. If
+     * there is not such a restructuring, these functions will return null. If we add a new child node to the parent
+     * node, first we open a space for that child node in the value array K, then we add this new node to the array K.
+     * After adding there are two possibilities:
+     * <ul>
+     *     <li>After inserting the new child node, the current node did not exceed its capacity. In this case, we open
+     *     space for the link, which points to the new node, in the array children and place that link inside of this
+     *     array.</li>
+     *     <li>After inserting the new child node, the current node exceed its capacity. In this case, we need to create
+     *     newNode, transfer the last d values and the last d links of the current node to the newNode. As a last case,
+     *     if the divided node is the root node, we need to create a new root node and the first child of this new root
+     *     node will be b, and the second child of the new root node will be newNode.</li>
+     * </ul>
+     * @param value Value to be inserted into B+ tree.
+     * @param comparator Comparator function to compare two elements.
+     * @param isRoot If true, value is inserted as a root node, otherwise false.
+     * @return If inserted node results in a creation of a node, the function returns that node, otherwise null.
+     */
+    insertNode(value, comparator, isRoot) {
+        let s;
+        let newNode;
+        let child;
+        child = this.position(value, comparator);
+        if (!this.children[child].leaf) {
+            s = this.children[child].insertNode(value, comparator, false);
         }
-        /**
-         * First the function position is used to determine the node or the subtree to which the new node will be added.
-         * If this subtree is a leaf node, we call the function insertLeaf that will add the value to a leaf node. If this
-         * subtree is not a leaf node the function calls itself with the determined subtree. Both insertNode and insertLeaf
-         * functions, if adding a new value/node to that node/subtree necessitates a new child node to be added to the
-         * parent node, they will both return the new added node and the node obtained by dividing the original node. If
-         * there is not such a restructuring, these functions will return null. If we add a new child node to the parent
-         * node, first we open a space for that child node in the value array K, then we add this new node to the array K.
-         * After adding there are two possibilities:
-         * <ul>
-         *     <li>After inserting the new child node, the current node did not exceed its capacity. In this case, we open
-         *     space for the link, which points to the new node, in the array children and place that link inside of this
-         *     array.</li>
-         *     <li>After inserting the new child node, the current node exceed its capacity. In this case, we need to create
-         *     newNode, transfer the last d values and the last d links of the current node to the newNode. As a last case,
-         *     if the divided node is the root node, we need to create a new root node and the first child of this new root
-         *     node will be b, and the second child of the new root node will be newNode.</li>
-         * </ul>
-         * @param value Value to be inserted into B+ tree.
-         * @param comparator Comparator function to compare two elements.
-         * @param isRoot If true, value is inserted as a root node, otherwise false.
-         * @return If inserted node results in a creation of a node, the function returns that node, otherwise null.
-         */
-        insertNode(value, comparator, isRoot) {
-            let s;
-            let newNode;
-            let child;
-            child = this.position(value, comparator);
-            if (!this.children[child].leaf) {
-                s = this.children[child].insertNode(value, comparator, false);
-            }
-            else {
-                s = this.children[child].insertLeaf(value, comparator);
-            }
-            if (s == null) {
-                return null;
-            }
-            this.insertIntoK(child, this.children[child].K[this.d]);
-            if (this.m < 2 * this.d) {
-                this.children[child + 1] = s;
-                this.m++;
-                return null;
-            }
-            else {
-                newNode = new BTreeNode(this.d, undefined, undefined, undefined);
-                newNode.leaf = false;
-                this.moveHalfOfTheElementsToNewNode(newNode);
-                newNode.children[this.d] = s;
-                this.m = this.d;
-                if (isRoot) {
-                    return new BTreeNode(this.d, this, newNode, this.K[this.d]);
-                }
-                else {
-                    return newNode;
-                }
-            }
+        else {
+            s = this.children[child].insertLeaf(value, comparator);
+        }
+        if (s == null) {
+            return null;
+        }
+        this.insertIntoK(child, this.children[child].K[this.d]);
+        if (this.m < 2 * this.d) {
+            this.children[child + 1] = s;
+            this.m++;
+            return null;
         }
-        /**
-         * First the function position is used to determine the position where the new value will be placed Then we open a
-         * space for that value in the value array K, then we add this new value to the array K into the calculated
-         * position. At this stage there are again two possibilities:
-         * <ul>
-         *     <li>After inserting the new value, the current leaf node did not exceed its capacity. The function returns
-         *     null.</li>
-         *     <li>After inserting the new value, the current leaf node exceed its capacity. In this case, we need to create
-         *     the newNode, and transfer the last d values of node b to this newNode.</li>
-         * </ul>
-         * @param value Value to be inserted into B+ tree.
-         * @param comparator Comparator function to compare two elements.
-         * @return If inserted node results in a creation of a node, the function returns that node, otherwise null.
-         */
-        insertLeaf(value, comparator) {
-            let child = this.position(value, comparator);
-            this.insertIntoK(child, value);
-            if (this.m < 2 * this.d) {
-                this.m++;
-                return null;
+        else {
+            newNode = new BTreeNode(this.d, undefined, undefined, undefined);
+            newNode.leaf = false;
+            this.moveHalfOfTheElementsToNewNode(newNode);
+            newNode.children[this.d] = s;
+            this.m = this.d;
+            if (isRoot) {
+                return new BTreeNode(this.d, this, newNode, this.K[this.d]);
             }
             else {
-                let newNode = new BTreeNode(this.d, undefined, undefined, undefined);
-                this.moveHalfOfTheKToNewNode(newNode);
-                this.m = this.d;
                 return newNode;
             }
         }
     }
-    exports.BTreeNode = BTreeNode;
-});
+    /**
+     * First the function position is used to determine the position where the new value will be placed Then we open a
+     * space for that value in the value array K, then we add this new value to the array K into the calculated
+     * position. At this stage there are again two possibilities:
+     * <ul>
+     *     <li>After inserting the new value, the current leaf node did not exceed its capacity. The function returns
+     *     null.</li>
+     *     <li>After inserting the new value, the current leaf node exceed its capacity. In this case, we need to create
+     *     the newNode, and transfer the last d values of node b to this newNode.</li>
+     * </ul>
+     * @param value Value to be inserted into B+ tree.
+     * @param comparator Comparator function to compare two elements.
+     * @return If inserted node results in a creation of a node, the function returns that node, otherwise null.
+     */
+    insertLeaf(value, comparator) {
+        let child = this.position(value, comparator);
+        this.insertIntoK(child, value);
+        if (this.m < 2 * this.d) {
+            this.m++;
+            return null;
+        }
+        else {
+            let newNode = new BTreeNode(this.d, undefined, undefined, undefined);
+            this.moveHalfOfTheKToNewNode(newNode);
+            this.m = this.d;
+            return newNode;
+        }
+    }
+}
+exports.BTreeNode = BTreeNode;
 //# sourceMappingURL=BTreeNode.js.map

package/dist/tree/BTreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"BTreeNode.js","sourceRoot":"","sources":["../../source/tree/BTreeNode.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,SAAS;QAQlB;;;;;;WAMG;QACH,YAAY,CAAS,EAAE,UAAoC,EAAE,WAAqC,EAAE,IAAoB;YACpH,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;YACZ,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,IAAI,UAAU,IAAI,SAAS,EAAC;gBACxB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;gBACV,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;aACnB;iBAAM;gBACH,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;gBACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;gBACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;gBAC9B,IAAI,WAAW,IAAI,SAAS,EAAC;oBACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;iBAClC;gBACD,IAAI,IAAI,IAAI,SAAS,EAAC;oBAClB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;iBACpB;aACJ;QACL,CAAC;QAED;;;;;;;WAOG;QACH,QAAQ,CAAC,KAAQ,EAAE,UAA6C;YAC5D,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAC;gBACZ,OAAO,CAAC,CAAA;aACX;YACD,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAC;gBAC1C,OAAO,IAAI,CAAC,CAAC,CAAA;aAChB;iBAAM;gBACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC;oBAC5B,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAC;wBAClC,OAAO,CAAC,CAAA;qBACX;iBACJ;aACJ;YACD,OAAO,CAAC,CAAC,CAAA;QACb,CAAC;QAED;;;;WAIG;QACK,WAAW,CAAC,KAAa,EAAE,SAAY;YAC3C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAC;gBAChC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;aAC5B;YACD,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;QAC7B,CAAC;QAED;;;WAGG;QACK,uBAAuB,CAAC,OAAqB;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC7B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;aACxC;YACD,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QACtB,CAAC;QAED;;;WAGG;QACK,8BAA8B,CAAC,OAAqB;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC;gBAC7B,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;aACvD;QACL,CAAC;QAED;;;WAGG;QACK,8BAA8B,CAAC,OAAqB;YACxD,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,8BAA8B,CAAC,OAAO,CAAC,CAAC;QACjD,CAAC;QAED;;;;;;;;;;;;;;;;;;;;;;WAsBG;QACI,UAAU,CAAC,KAAQ,EAAE,UAA6C,EAAE,MAAe;YACtF,IAAI,CAAuB,CAAA;YAC3B,IAAI,OAAsB,CAAA;YAC1B,IAAI,KAAc,CAAA;YAClB,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAC;gBAC3B,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;aACjE;iBAAM;gBACH,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;aAC1D;YACD,IAAI,CAAC,IAAI,IAAI,EAAC;gBACV,OAAO,IAAI,CAAA;aACd;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YACvD,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC;gBACpB,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC5B,IAAI,CAAC,CAAC,EAAE,CAAC;gBACT,OAAO,IAAI,CAAA;aACd;iBAAM;gBACH,OAAO,GAAG,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,OAAO,CAAC,IAAI,GAAG,KAAK,CAAA;gBACpB,IAAI,CAAC,8BAA8B,CAAC,OAAO,CAAC,CAAA;gBAC5C,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;gBAC5B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;gBACf,IAAI,MAAM,EAAC;oBACP,OAAO,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;iBACjE;qBAAM;oBACH,OAAO,OAAO,CAAA;iBACjB;aACJ;QACL,CAAC;QAED;;;;;;;;;;;;;WAaG;QACI,UAAU,CAAC,KAAQ,EAAE,UAA6C;YACrE,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;YAC5C,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YAC9B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC;gBACpB,IAAI,CAAC,CAAC,EAAE,CAAC;gBACT,OAAO,IAAI,CAAA;aACd;iBAAM;gBACH,IAAI,OAAO,GAAG,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gBACxE,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;gBACtC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChB,OAAO,OAAO,CAAC;aAClB;QACL,CAAC;KAEJ;IAxLD,8BAwLC"}
+{"version":3,"file":"BTreeNode.js","sourceRoot":"","sources":["../../source/tree/BTreeNode.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAElB,CAAC,CAAY;IACb,CAAC,CAAS;IACV,CAAC,CAAS;IACV,IAAI,CAAS;IACb,QAAQ,CAAsB;IAE9B;;;;;;OAMG;IACH,YAAY,CAAS,EAAE,UAAoC,EAAE,WAAqC,EAAE,IAAoB;QACpH,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;QACZ,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,UAAU,IAAI,SAAS,EAAC,CAAC;YACzB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QACpB,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;YACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;YAC9B,IAAI,WAAW,IAAI,SAAS,EAAC,CAAC;gBAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YACnC,CAAC;YACD,IAAI,IAAI,IAAI,SAAS,EAAC,CAAC;gBACnB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACrB,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,KAAQ,EAAE,UAA6C;QAC5D,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAC,CAAC;YACb,OAAO,CAAC,CAAA;QACZ,CAAC;QACD,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAC,CAAC;YAC3C,OAAO,IAAI,CAAC,CAAC,CAAA;QACjB,CAAC;aAAM,CAAC;YACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC,CAAC;gBAC7B,IAAI,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAC,CAAC;oBACnC,OAAO,CAAC,CAAA;gBACZ,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,CAAC,CAAC,CAAA;IACb,CAAC;IAED;;;;OAIG;IACK,WAAW,CAAC,KAAa,EAAE,SAAY;QAC3C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAC,CAAC;YACjC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC7B,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;IAC7B,CAAC;IAED;;;OAGG;IACK,uBAAuB,CAAC,OAAqB;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACzC,CAAC;QACD,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;IACtB,CAAC;IAED;;;OAGG;IACK,8BAA8B,CAAC,OAAqB;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC,CAAC;YAC9B,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,8BAA8B,CAAC,OAAqB;QACxD,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,8BAA8B,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACI,UAAU,CAAC,KAAQ,EAAE,UAA6C,EAAE,MAAe;QACtF,IAAI,CAAuB,CAAA;QAC3B,IAAI,OAAsB,CAAA;QAC1B,IAAI,KAAc,CAAA;QAClB,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAC,CAAC;YAC5B,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACJ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;YACX,OAAO,IAAI,CAAA;QACf,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACvD,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YAC5B,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,OAAO,IAAI,CAAA;QACf,CAAC;aAAM,CAAC;YACJ,OAAO,GAAG,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACpE,OAAO,CAAC,IAAI,GAAG,KAAK,CAAA;YACpB,IAAI,CAAC,8BAA8B,CAAC,OAAO,CAAC,CAAA;YAC5C,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAC5B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;YACf,IAAI,MAAM,EAAC,CAAC;gBACR,OAAO,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YAClE,CAAC;iBAAM,CAAC;gBACJ,OAAO,OAAO,CAAA;YAClB,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;OAaG;IACI,UAAU,CAAC,KAAQ,EAAE,UAA6C;QACrE,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QAC5C,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC9B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,CAAC;YACrB,IAAI,CAAC,CAAC,EAAE,CAAC;YACT,OAAO,IAAI,CAAA;QACf,CAAC;aAAM,CAAC;YACJ,IAAI,OAAO,GAAG,IAAI,SAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACxE,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YAChB,OAAO,OAAO,CAAC;QACnB,CAAC;IACL,CAAC;CAEJ;AAxLD,8BAwLC"}

package/dist/tree/Tree.js

@@ -1,106 +1,97 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
-    }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "./TreeNode"], factory);
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Tree = void 0;
+const TreeNode_1 = require("./TreeNode");
+/**
+ * Tree structure is also a non-linear data structure. Different from the tree structure we see in the nature, the
+ * tree data structure has its root on top and develops its branches down.
+ * @param T Type of the data stored in the tree node.
+ */
+class Tree {
+    root = null;
+    comparator;
+    /**
+     * Constructor of the tree. According to the comparator, the tree could contain any object.
+     * @param comparator Comparator function to compare two elements.
+     */
+    constructor(comparator) {
+        this.comparator = comparator;
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.Tree = void 0;
-    const TreeNode_1 = require("./TreeNode");
     /**
-     * Tree structure is also a non-linear data structure. Different from the tree structure we see in the nature, the
-     * tree data structure has its root on top and develops its branches down.
-     * @param T Type of the data stored in the tree node.
+     * The search starts from the root node, and we represent the node, with which we compare the searched value, with
+     * d. If the searched value is equal to the value of the current node, we have found the node we search for, the
+     * function will return that node. If the searched value is smaller than the value of the current node , the number
+     * we search for must be on the left subtree of the current node, therefore the new current node must be the left
+     * child of the current node. As the last case, if the searched value is larger than the value of the current node,
+     * the number we search for must be on the right subtree of the current node, therefore the new current node must be
+     * the right child of the current node. If this search continues until the leaf nodes of the tree and we can't find
+     * the node we search for, node d will be null and the function will return null.
+     * @param value Searched value
+     * @return If the value exists in the tree, the function returns the node that contains the node. Otherwise, it
+     * returns null.
      */
-    class Tree {
-        /**
-         * Constructor of the tree. According to the comparator, the tree could contain any object.
-         * @param comparator Comparator function to compare two elements.
-         */
-        constructor(comparator) {
-            this.root = null;
-            this.comparator = comparator;
-        }
-        /**
-         * The search starts from the root node, and we represent the node, with which we compare the searched value, with
-         * d. If the searched value is equal to the value of the current node, we have found the node we search for, the
-         * function will return that node. If the searched value is smaller than the value of the current node , the number
-         * we search for must be on the left subtree of the current node, therefore the new current node must be the left
-         * child of the current node. As the last case, if the searched value is larger than the value of the current node,
-         * the number we search for must be on the right subtree of the current node, therefore the new current node must be
-         * the right child of the current node. If this search continues until the leaf nodes of the tree and we can't find
-         * the node we search for, node d will be null and the function will return null.
-         * @param value Searched value
-         * @return If the value exists in the tree, the function returns the node that contains the node. Otherwise, it
-         * returns null.
-         */
-        search(value) {
-            let d = this.root;
-            while (d != null) {
-                if (this.comparator(d.data, value) == 0) {
-                    return d;
+    search(value) {
+        let d = this.root;
+        while (d != null) {
+            if (this.comparator(d.data, value) == 0) {
+                return d;
+            }
+            else {
+                if (this.comparator(d.data, value) > 0) {
+                    d = d.left;
                 }
                 else {
-                    if (this.comparator(d.data, value) > 0) {
-                        d = d.left;
-                    }
-                    else {
-                        d = d.right;
-                    }
+                    d = d.right;
                 }
             }
-            return null;
         }
-        /**
-         * Inserts a child to its parent as left or right child.
-         * @param parent New parent of the child node.
-         * @param child Child node.
-         */
-        insertChild(parent, child) {
-            if (parent == null) {
-                this.root = child;
+        return null;
+    }
+    /**
+     * Inserts a child to its parent as left or right child.
+     * @param parent New parent of the child node.
+     * @param child Child node.
+     */
+    insertChild(parent, child) {
+        if (parent == null) {
+            this.root = child;
+        }
+        else {
+            if (this.comparator(child.data, parent.data) < 0) {
+                parent.left = child;
             }
             else {
-                if (this.comparator(child.data, parent.data) < 0) {
-                    parent.left = child;
-                }
-                else {
-                    parent.right = child;
-                }
+                parent.right = child;
             }
         }
-        /**
-         * In order to add a new node into a binary search tree, we need to first find out the place where we will insert
-         * the new node. For this, we start from the root node and traverse the tree down. At each step, we compare the
-         * value of the new node with the value of the current node. If the value of the new node is smaller than the value
-         * of the current node, the new node will be inserted into the left subtree of the current node. To accomplish this,
-         * we continue the process with the left child of the current node. If the situation is reverse, that is, if the
-         * value of the new node is larger than the value of the current node, the new node will be inserted into the right
-         * subtree of the current node. In this case, we continue the process with the right child of the current node.
-         * @param node Node to be inserted.
-         */
-        insert(node) {
-            let y = null;
-            let x = this.root;
-            while (x != null) {
-                y = x;
-                if (this.comparator(node.data, x.data) < 0) {
-                    x = x.left;
-                }
-                else {
-                    x = x.right;
-                }
+    }
+    /**
+     * In order to add a new node into a binary search tree, we need to first find out the place where we will insert
+     * the new node. For this, we start from the root node and traverse the tree down. At each step, we compare the
+     * value of the new node with the value of the current node. If the value of the new node is smaller than the value
+     * of the current node, the new node will be inserted into the left subtree of the current node. To accomplish this,
+     * we continue the process with the left child of the current node. If the situation is reverse, that is, if the
+     * value of the new node is larger than the value of the current node, the new node will be inserted into the right
+     * subtree of the current node. In this case, we continue the process with the right child of the current node.
+     * @param node Node to be inserted.
+     */
+    insert(node) {
+        let y = null;
+        let x = this.root;
+        while (x != null) {
+            y = x;
+            if (this.comparator(node.data, x.data) < 0) {
+                x = x.left;
+            }
+            else {
+                x = x.right;
             }
-            this.insertChild(y, node);
-        }
-        insertData(data) {
-            this.insert(new TreeNode_1.TreeNode(data));
         }
+        this.insertChild(y, node);
+    }
+    insertData(data) {
+        this.insert(new TreeNode_1.TreeNode(data));
     }
-    exports.Tree = Tree;
-});
+}
+exports.Tree = Tree;
 //# sourceMappingURL=Tree.js.map

package/dist/tree/Tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"Tree.js","sourceRoot":"","sources":["../../source/tree/Tree.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,yCAAoC;IAEpC;;;;OAIG;IACH,MAAa,IAAI;QAKb;;;WAGG;QACH,YAAY,UAA6C;YAP/C,SAAI,GAAwB,IAAI,CAAA;YAQtC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;QAChC,CAAC;QAED;;;;;;;;;;;;WAYG;QACI,MAAM,CAAC,KAAQ;YAClB,IAAI,CAAC,GAAwB,IAAI,CAAC,IAAI,CAAA;YACtC,OAAO,CAAC,IAAI,IAAI,EAAC;gBACb,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAC;oBACpC,OAAO,CAAC,CAAA;iBACX;qBAAM;oBACH,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAC;wBACnC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;qBACb;yBAAM;wBACH,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;qBACd;iBACJ;aACJ;YACD,OAAO,IAAI,CAAA;QACf,CAAC;QAED;;;;WAIG;QACO,WAAW,CAAC,MAA2B,EAAE,KAAkB;YACjE,IAAI,MAAM,IAAI,IAAI,EAAE;gBAChB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;aACpB;iBAAM;gBACH,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;oBAC9C,MAAM,CAAC,IAAI,GAAG,KAAK,CAAA;iBACtB;qBAAM;oBACH,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;iBACvB;aACJ;QACL,CAAC;QAED;;;;;;;;;WASG;QACI,MAAM,CAAC,IAAiB;YAC3B,IAAI,CAAC,GAAwB,IAAI,CAAA;YACjC,IAAI,CAAC,GAAwB,IAAI,CAAC,IAAI,CAAC;YACvC,OAAO,CAAC,IAAI,IAAI,EAAC;gBACb,CAAC,GAAG,CAAC,CAAC;gBACN,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC;oBACvC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;iBACd;qBAAM;oBACH,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;iBACf;aACJ;YACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QAEM,UAAU,CAAC,IAAO;YACrB,IAAI,CAAC,MAAM,CAAC,IAAI,mBAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,CAAC;KAEJ;IAvFD,oBAuFC"}
+{"version":3,"file":"Tree.js","sourceRoot":"","sources":["../../source/tree/Tree.ts"],"names":[],"mappings":";;;AAAA,yCAAoC;AAEpC;;;;GAIG;AACH,MAAa,IAAI;IAEH,IAAI,GAAwB,IAAI,CAAA;IAChC,UAAU,CAAoC;IAExD;;;OAGG;IACH,YAAY,UAA6C;QACrD,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;IAChC,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,KAAQ;QAClB,IAAI,CAAC,GAAwB,IAAI,CAAC,IAAI,CAAA;QACtC,OAAO,CAAC,IAAI,IAAI,EAAC,CAAC;YACd,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAC,CAAC;gBACrC,OAAO,CAAC,CAAA;YACZ,CAAC;iBAAM,CAAC;gBACJ,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAC,CAAC;oBACpC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAA;gBACd,CAAC;qBAAM,CAAC;oBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;gBACf,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;OAIG;IACO,WAAW,CAAC,MAA2B,EAAE,KAAkB;QACjE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;QACrB,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/C,MAAM,CAAC,IAAI,GAAG,KAAK,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;YACxB,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,IAAiB;QAC3B,IAAI,CAAC,GAAwB,IAAI,CAAA;QACjC,IAAI,CAAC,GAAwB,IAAI,CAAC,IAAI,CAAC;QACvC,OAAO,CAAC,IAAI,IAAI,EAAC,CAAC;YACd,CAAC,GAAG,CAAC,CAAC;YACN,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,CAAC;gBACxC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;YACf,CAAC;iBAAM,CAAC;gBACJ,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YAChB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAEM,UAAU,CAAC,IAAO;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,mBAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;CAEJ;AAvFD,oBAuFC"}

package/dist/tree/TreeNode.js

@@ -1,22 +1,13 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeNode = void 0;
+class TreeNode {
+    data;
+    left = null;
+    right = null;
+    constructor(data) {
+        this.data = data;
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.TreeNode = void 0;
-    class TreeNode {
-        constructor(data) {
-            this.left = null;
-            this.right = null;
-            this.data = data;
-        }
-    }
-    exports.TreeNode = TreeNode;
-});
+}
+exports.TreeNode = TreeNode;
 //# sourceMappingURL=TreeNode.js.map

package/dist/tree/TreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.js","sourceRoot":"","sources":["../../source/tree/TreeNode.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,QAAQ;QAMjB,YAAY,IAAO;YAHnB,SAAI,GAAwB,IAAI,CAAA;YAChC,UAAK,GAAwB,IAAI,CAAA;YAG7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QACpB,CAAC;KAEJ;IAVD,4BAUC"}
+{"version":3,"file":"TreeNode.js","sourceRoot":"","sources":["../../source/tree/TreeNode.ts"],"names":[],"mappings":";;;AAAA,MAAa,QAAQ;IAEjB,IAAI,CAAI;IACR,IAAI,GAAwB,IAAI,CAAA;IAChC,KAAK,GAAwB,IAAI,CAAA;IAEjC,YAAY,IAAO;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IACpB,CAAC;CAEJ;AAVD,4BAUC"}