nlptoolkit-datastructure 1.0.8 → 1.0.9

package/dist/tree/AvlTree.js

@@ -1,188 +1,178 @@
-(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.AvlTree = void 0;
+const Tree_1 = require("./Tree");
+const AvlTreeNode_1 = require("./AvlTreeNode");
+const Stack_1 = require("../Stack");
+/**
+ * <p>AVL (Adelson-Velskii and Landis) tree is a balanced binary search tree structure. The balance property is very simple
+ * and ensures the depth of the tree is in the level of O(log N).</p>
+ *
+ * <p>In AVL tree, the heights of the left and right subtrees of each node can differ by at most 1. If the heights of the
+ * left and right subtrees of a single node differ by more than 1, then that binary search tree is not an AVL tree.</p>
+ * @param T Type of the data stored in the tree node.
+ */
+class AvlTree extends Tree_1.Tree {
+    constructor(comparator) {
+        super(comparator);
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "./Tree", "./AvlTreeNode", "../Stack"], factory);
+    height(d) {
+        if (d == null) {
+            return 0;
+        }
+        else {
+            return d.height;
+        }
+    }
+    /**
+     * In rotate left, we move node k1 one level up, since due to the binary search tree
+     * property k2 > k1, we move node k2 one level down. The links updated are:
+     * <ul>
+     *     <li>Since k2 > B > k1, the left child of node k2 is now the old right child of k1</li>
+     *     <li>The right child of k1 is now k2 </li>
+     * </ul>
+     * Note that, the root node of the subtree is now k1. In order to modify the parent link of k2, the new root of the
+     * subtree is returned by the function.
+     * @param k2 Root of the subtree, which does not satisfy the AVL tree property.
+     * @return The new root of the subtree
+     */
+    rotateLeft(k2) {
+        let k1 = k2.left;
+        k2.left = k1.right;
+        k1.right = k2;
+        k2.height = Math.max(this.height(k2.left), this.height(k2.right)) + 1;
+        k1.height = Math.max(this.height(k1.left), k1.right.height) + 1;
+        return k1;
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.AvlTree = void 0;
-    const Tree_1 = require("./Tree");
-    const AvlTreeNode_1 = require("./AvlTreeNode");
-    const Stack_1 = require("../Stack");
     /**
-     * <p>AVL (Adelson-Velskii and Landis) tree is a balanced binary search tree structure. The balance property is very simple
-     * and ensures the depth of the tree is in the level of O(log N).</p>
+     * In order to restore the AVL tree property, we move node k2 one level up, since due to the binary search tree
+     * property k2 > k1, we move node k1 one level down. The links updated are:
+     * <ul>
+     *     <li>Since k2 > B > k1, the right child of node k1 is now the old left child of k2.</li>
+     *     <li>The left child of k2 is now k1</li>
+     * </ul>
+     * Note that, the root node of the subtree is now k2. In order to modify the parent link of k1, the new root of the
+     * subtree is returned by the function.
+     * @param k1 Root of the subtree, which does not satisfy the AVL tree property.
+     * @return The new root of the subtree
+     */
+    rotateRight(k1) {
+        let k2 = k1.right;
+        k1.right = k2.left;
+        k2.left = k1;
+        k2.height = Math.max(k2.left.height, this.height(k2.right)) + 1;
+        k1.height = Math.max(this.height(k1.left), this.height(k1.right)) + 1;
+        return k2;
+    }
+    /**
+     * <p>In the first phase we will do single right rotation on the subtree rooted with k1. With this rotation, the left
+     * child of node k2 will be k1, whereas the right child of node k1 will be B (the old left child of node k2).</p>
+     *
+     * <p>In the second phase, we will do single left rotation on the subtree rooted with k3. With this rotation, the
+     * right child of node k2 will be k3, whereas the left child of node k3 will be C (the old right child of k2).</p>
      *
-     * <p>In AVL tree, the heights of the left and right subtrees of each node can differ by at most 1. If the heights of the
-     * left and right subtrees of a single node differ by more than 1, then that binary search tree is not an AVL tree.</p>
-     * @param T Type of the data stored in the tree node.
+     * Note that, the new root node of the subtree is now k2. In order to modify the parent link of k3, the new root of
+     * the subtree is returned by the function.
+     * @param k3 Root of the subtree, which does not satisfy the AVL tree property.
+     * @return The new root of the subtree
      */
-    class AvlTree extends Tree_1.Tree {
-        constructor(comparator) {
-            super(comparator);
-        }
-        height(d) {
-            if (d == null) {
-                return 0;
+    doubleRotateLeft(k3) {
+        k3.left = this.rotateRight(k3.left);
+        return this.rotateLeft(k3);
+    }
+    /**
+     * <p>In the first phase we will do single right rotation on the subtree rooted with k3. With this rotation, the right
+     * child of node k2 will be k3, whereas the left child of node k3 will be C (the old right child of node k2).</p>
+     *
+     * <p>In the second phase, we will do single right rotation on the subtree rooted with k1. With this rotation, the left
+     * child of node k2 will be k1, whereas the left child of node k1 will be B (the old left child of k2).</p>
+     *
+     * Note that, the new root node of the subtree is now k2. In order to modify the parent link of k1, the new root of
+     * the subtree is returned by the function.
+     * @param k1 Root of the subtree, which does not satisfy the AVL tree property.
+     * @return The new root of the subtree
+     */
+    doubleRotateRight(k1) {
+        k1.right = this.rotateLeft(k1.right);
+        return this.rotateRight(k1);
+    }
+    /**
+     * <p>First we will proceed with the stages the same when we add a new node into a binary search tree. For this, we
+     * start from the root node and traverse in down manner. The current node we visit is represented with x and the
+     * previous node is represented with y. At each time we compare the value of the current node with the value of the
+     * new 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. For this, we will continue with the left child to process. If
+     * the reverse is true, 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 will continue with the right
+     * child to process. At each step, we store the current node in a separate stack.</p>
+     *
+     * <p>When we insert a new node into an AVL tree, we need to change the heights of the nodes and check if the AVL tree
+     * property is satisfied or not. Only the height of the nodes, which we visit while we are finding the place for the
+     * new node, can be changed. So, what we should do is to pop those nodes from the stack one by one and change the
+     * heights of those nodes.</p>
+     *
+     * <p>Similarly, the nodes, which we visit while we are finding the place for the new node, may no longer satisfy the
+     * AVL tree property. So what we should do is to pop those nodes from the stack one by one and calculate the
+     * difference of the heights of their left and right subtrees. If the height difference is 2, the AVL tree property
+     * is not satisfied. If we added the new node into the left subtree of the left child, we need to do left single
+     * rotation, if we added into the right subtree of the left child, we need to do left double rotation, if we added
+     * into the left subtree of the right child, we need to do right double rotation, if we added into the right subtree
+     * of the right child, we need to the right single rotation. Since  the root node of the subtree will be changed
+     * after a rotation, the new child of y will be the new root node t.</p>
+     * @param node Node to be inserted.
+     */
+    insert(node) {
+        let LEFT = 1, RIGHT = 2;
+        let y = null;
+        let x = this.root;
+        let t;
+        let dir1 = 0, dir2 = 0;
+        let c = new Stack_1.Stack();
+        while (x != null) {
+            y = x;
+            c.push(y);
+            dir1 = dir2;
+            if (this.comparator(node.data, x.data) < 0) {
+                x = x.left;
+                dir2 = LEFT;
             }
             else {
-                return d.height;
+                x = x.right;
+                dir2 = RIGHT;
             }
         }
-        /**
-         * In rotate left, we move node k1 one level up, since due to the binary search tree
-         * property k2 > k1, we move node k2 one level down. The links updated are:
-         * <ul>
-         *     <li>Since k2 > B > k1, the left child of node k2 is now the old right child of k1</li>
-         *     <li>The right child of k1 is now k2 </li>
-         * </ul>
-         * Note that, the root node of the subtree is now k1. In order to modify the parent link of k2, the new root of the
-         * subtree is returned by the function.
-         * @param k2 Root of the subtree, which does not satisfy the AVL tree property.
-         * @return The new root of the subtree
-         */
-        rotateLeft(k2) {
-            let k1 = k2.left;
-            k2.left = k1.right;
-            k1.right = k2;
-            k2.height = Math.max(this.height(k2.left), this.height(k2.right)) + 1;
-            k1.height = Math.max(this.height(k1.left), k1.right.height) + 1;
-            return k1;
-        }
-        /**
-         * In order to restore the AVL tree property, we move node k2 one level up, since due to the binary search tree
-         * property k2 > k1, we move node k1 one level down. The links updated are:
-         * <ul>
-         *     <li>Since k2 > B > k1, the right child of node k1 is now the old left child of k2.</li>
-         *     <li>The left child of k2 is now k1</li>
-         * </ul>
-         * Note that, the root node of the subtree is now k2. In order to modify the parent link of k1, the new root of the
-         * subtree is returned by the function.
-         * @param k1 Root of the subtree, which does not satisfy the AVL tree property.
-         * @return The new root of the subtree
-         */
-        rotateRight(k1) {
-            let k2 = k1.right;
-            k1.right = k2.left;
-            k2.left = k1;
-            k2.height = Math.max(k2.left.height, this.height(k2.right)) + 1;
-            k1.height = Math.max(this.height(k1.left), this.height(k1.right)) + 1;
-            return k2;
-        }
-        /**
-         * <p>In the first phase we will do single right rotation on the subtree rooted with k1. With this rotation, the left
-         * child of node k2 will be k1, whereas the right child of node k1 will be B (the old left child of node k2).</p>
-         *
-         * <p>In the second phase, we will do single left rotation on the subtree rooted with k3. With this rotation, the
-         * right child of node k2 will be k3, whereas the left child of node k3 will be C (the old right child of k2).</p>
-         *
-         * Note that, the new root node of the subtree is now k2. In order to modify the parent link of k3, the new root of
-         * the subtree is returned by the function.
-         * @param k3 Root of the subtree, which does not satisfy the AVL tree property.
-         * @return The new root of the subtree
-         */
-        doubleRotateLeft(k3) {
-            k3.left = this.rotateRight(k3.left);
-            return this.rotateLeft(k3);
-        }
-        /**
-         * <p>In the first phase we will do single right rotation on the subtree rooted with k3. With this rotation, the right
-         * child of node k2 will be k3, whereas the left child of node k3 will be C (the old right child of node k2).</p>
-         *
-         * <p>In the second phase, we will do single right rotation on the subtree rooted with k1. With this rotation, the left
-         * child of node k2 will be k1, whereas the left child of node k1 will be B (the old left child of k2).</p>
-         *
-         * Note that, the new root node of the subtree is now k2. In order to modify the parent link of k1, the new root of
-         * the subtree is returned by the function.
-         * @param k1 Root of the subtree, which does not satisfy the AVL tree property.
-         * @return The new root of the subtree
-         */
-        doubleRotateRight(k1) {
-            k1.right = this.rotateLeft(k1.right);
-            return this.rotateRight(k1);
-        }
-        /**
-         * <p>First we will proceed with the stages the same when we add a new node into a binary search tree. For this, we
-         * start from the root node and traverse in down manner. The current node we visit is represented with x and the
-         * previous node is represented with y. At each time we compare the value of the current node with the value of the
-         * new 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. For this, we will continue with the left child to process. If
-         * the reverse is true, 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 will continue with the right
-         * child to process. At each step, we store the current node in a separate stack.</p>
-         *
-         * <p>When we insert a new node into an AVL tree, we need to change the heights of the nodes and check if the AVL tree
-         * property is satisfied or not. Only the height of the nodes, which we visit while we are finding the place for the
-         * new node, can be changed. So, what we should do is to pop those nodes from the stack one by one and change the
-         * heights of those nodes.</p>
-         *
-         * <p>Similarly, the nodes, which we visit while we are finding the place for the new node, may no longer satisfy the
-         * AVL tree property. So what we should do is to pop those nodes from the stack one by one and calculate the
-         * difference of the heights of their left and right subtrees. If the height difference is 2, the AVL tree property
-         * is not satisfied. If we added the new node into the left subtree of the left child, we need to do left single
-         * rotation, if we added into the right subtree of the left child, we need to do left double rotation, if we added
-         * into the left subtree of the right child, we need to do right double rotation, if we added into the right subtree
-         * of the right child, we need to the right single rotation. Since  the root node of the subtree will be changed
-         * after a rotation, the new child of y will be the new root node t.</p>
-         * @param node Node to be inserted.
-         */
-        insert(node) {
-            let LEFT = 1, RIGHT = 2;
-            let y = null;
-            let x = this.root;
-            let t;
-            let dir1 = 0, dir2 = 0;
-            let c = new Stack_1.Stack();
-            while (x != null) {
-                y = x;
-                c.push(y);
-                dir1 = dir2;
-                if (this.comparator(node.data, x.data) < 0) {
-                    x = x.left;
-                    dir2 = LEFT;
-                }
-                else {
-                    x = x.right;
-                    dir2 = RIGHT;
-                }
-            }
-            this.insertChild(y, node);
-            while (!c.isEmpty()) {
-                x = c.pop();
-                if (x != null) {
-                    x.height = Math.max(this.height(x.left), this.height(x.right)) + 1;
-                    if (Math.abs(this.height(x.left) - this.height(x.right)) == 2) {
-                        if (dir1 == LEFT) {
-                            if (dir2 == LEFT) {
-                                t = this.rotateLeft(x);
-                            }
-                            else {
-                                t = this.doubleRotateLeft(x);
-                            }
+        this.insertChild(y, node);
+        while (!c.isEmpty()) {
+            x = c.pop();
+            if (x != null) {
+                x.height = Math.max(this.height(x.left), this.height(x.right)) + 1;
+                if (Math.abs(this.height(x.left) - this.height(x.right)) == 2) {
+                    if (dir1 == LEFT) {
+                        if (dir2 == LEFT) {
+                            t = this.rotateLeft(x);
+                        }
+                        else {
+                            t = this.doubleRotateLeft(x);
+                        }
+                    }
+                    else {
+                        if (dir2 == LEFT) {
+                            t = this.doubleRotateRight(x);
                         }
                         else {
-                            if (dir2 == LEFT) {
-                                t = this.doubleRotateRight(x);
-                            }
-                            else {
-                                t = this.rotateRight(x);
-                            }
+                            t = this.rotateRight(x);
                         }
-                        y = c.pop();
-                        this.insertChild(y, t);
-                        break;
                     }
+                    y = c.pop();
+                    this.insertChild(y, t);
+                    break;
                 }
             }
         }
-        insertData(item) {
-            this.insert(new AvlTreeNode_1.AvlTreeNode(item));
-        }
     }
-    exports.AvlTree = AvlTree;
-});
+    insertData(item) {
+        this.insert(new AvlTreeNode_1.AvlTreeNode(item));
+    }
+}
+exports.AvlTree = AvlTree;
 //# sourceMappingURL=AvlTree.js.map

package/dist/tree/AvlTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"AvlTree.js","sourceRoot":"","sources":["../../source/tree/AvlTree.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,iCAA4B;IAC5B,+CAA0C;IAC1C,oCAA+B;IAE/B;;;;;;;OAOG;IACH,MAAa,OAAW,SAAQ,WAAO;QAEnC,YAAY,UAA6C;YACrD,KAAK,CAAC,UAAU,CAAC,CAAA;QACrB,CAAC;QAEM,MAAM,CAAC,CAAiB;YAC3B,IAAI,CAAC,IAAI,IAAI,EAAC;gBACV,OAAO,CAAC,CAAA;aACX;iBAAM;gBACH,OAAO,CAAC,CAAC,MAAM,CAAA;aAClB;QACL,CAAC;QAED;;;;;;;;;;;WAWG;QACK,UAAU,CAAC,EAAkB;YACjC,IAAI,EAAE,GAAqC,EAAE,CAAC,IAAI,CAAA;YAClD,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAA;YAClB,EAAE,CAAC,KAAK,GAAG,EAAE,CAAA;YACb,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;YACvG,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAoB,EAAE,CAAC,KAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACnG,OAAO,EAAE,CAAA;QACb,CAAC;QAED;;;;;;;;;;;WAWG;QACK,WAAW,CAAC,EAAkB;YAClC,IAAI,EAAE,GAAqC,EAAE,CAAC,KAAK,CAAA;YACnD,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,CAAA;YAClB,EAAE,CAAC,IAAI,GAAG,EAAE,CAAA;YACZ,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAmB,EAAE,CAAC,IAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;YACnG,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;YACvG,OAAO,EAAE,CAAA;QACb,CAAC;QAED;;;;;;;;;;;WAWG;QACK,gBAAgB,CAAC,EAAkB;YACvC,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAkB,EAAE,CAAC,IAAI,CAAC,CAAA;YACpD,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;QAC9B,CAAC;QAED;;;;;;;;;;;WAWG;QACK,iBAAiB,CAAC,EAAkB;YACxC,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAA;YACrD,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;QAC/B,CAAC;QAED;;;;;;;;;;;;;;;;;;;;;;;;WAwBG;QACI,MAAM,CAAC,IAAqB;YAC/B,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAA;YACvB,IAAI,CAAC,GAA2B,IAAI,CAAA;YACpC,IAAI,CAAC,GAA4C,IAAI,CAAC,IAAI,CAAA;YAC1D,IAAI,CAAyB,CAAA;YAC7B,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAA;YACtB,IAAI,CAAC,GAA2B,IAAI,aAAK,EAAkB,CAAA;YAC3D,OAAO,CAAC,IAAI,IAAI,EAAC;gBACb,CAAC,GAAG,CAAC,CAAA;gBACL,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACT,IAAI,GAAG,IAAI,CAAA;gBACX,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC;oBACvC,CAAC,GAAoB,CAAC,CAAC,IAAI,CAAA;oBAC3B,IAAI,GAAG,IAAI,CAAA;iBACd;qBAAM;oBACH,CAAC,GAAoB,CAAC,CAAC,KAAK,CAAA;oBAC5B,IAAI,GAAG,KAAK,CAAA;iBACf;aACJ;YACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YACzB,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAC;gBAChB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;gBACX,IAAI,CAAC,IAAI,IAAI,EAAC;oBACV,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;oBACrG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAC;wBAC5F,IAAI,IAAI,IAAI,IAAI,EAAC;4BACb,IAAI,IAAI,IAAI,IAAI,EAAC;gCACb,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;6BACzB;iCAAM;gCACH,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAA;6BAC/B;yBACJ;6BAAM;4BACH,IAAI,IAAI,IAAI,IAAI,EAAC;gCACb,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;6BAChC;iCAAM;gCACH,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;6BAC3B;yBACJ;wBACD,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;wBACZ,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBACvB,MAAM;qBACT;iBACJ;aACJ;QACL,CAAC;QAEM,UAAU,CAAE,IAAQ;YACvB,IAAI,CAAC,MAAM,CAAC,IAAI,yBAAW,CAAI,IAAI,CAAC,CAAC,CAAA;QACzC,CAAC;KAEJ;IArKD,0BAqKC"}
+{"version":3,"file":"AvlTree.js","sourceRoot":"","sources":["../../source/tree/AvlTree.ts"],"names":[],"mappings":";;;AAAA,iCAA4B;AAC5B,+CAA0C;AAC1C,oCAA+B;AAE/B;;;;;;;GAOG;AACH,MAAa,OAAW,SAAQ,WAAO;IAEnC,YAAY,UAA6C;QACrD,KAAK,CAAC,UAAU,CAAC,CAAA;IACrB,CAAC;IAEM,MAAM,CAAC,CAAiB;QAC3B,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;YACX,OAAO,CAAC,CAAA;QACZ,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,CAAC,MAAM,CAAA;QACnB,CAAC;IACL,CAAC;IAED;;;;;;;;;;;OAWG;IACK,UAAU,CAAC,EAAkB;QACjC,IAAI,EAAE,GAAqC,EAAE,CAAC,IAAI,CAAA;QAClD,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAA;QAClB,EAAE,CAAC,KAAK,GAAG,EAAE,CAAA;QACb,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;QACvG,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAoB,EAAE,CAAC,KAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACnG,OAAO,EAAE,CAAA;IACb,CAAC;IAED;;;;;;;;;;;OAWG;IACK,WAAW,CAAC,EAAkB;QAClC,IAAI,EAAE,GAAqC,EAAE,CAAC,KAAK,CAAA;QACnD,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,CAAA;QAClB,EAAE,CAAC,IAAI,GAAG,EAAE,CAAA;QACZ,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAmB,EAAE,CAAC,IAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;QACnG,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;QACvG,OAAO,EAAE,CAAA;IACb,CAAC;IAED;;;;;;;;;;;OAWG;IACK,gBAAgB,CAAC,EAAkB;QACvC,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAkB,EAAE,CAAC,IAAI,CAAC,CAAA;QACpD,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;IAC9B,CAAC;IAED;;;;;;;;;;;OAWG;IACK,iBAAiB,CAAC,EAAkB;QACxC,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAkB,EAAE,CAAC,KAAK,CAAC,CAAA;QACrD,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAA;IAC/B,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACI,MAAM,CAAC,IAAqB;QAC/B,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAA;QACvB,IAAI,CAAC,GAA2B,IAAI,CAAA;QACpC,IAAI,CAAC,GAA4C,IAAI,CAAC,IAAI,CAAA;QAC1D,IAAI,CAAyB,CAAA;QAC7B,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,CAAC,GAA2B,IAAI,aAAK,EAAkB,CAAA;QAC3D,OAAO,CAAC,IAAI,IAAI,EAAC,CAAC;YACd,CAAC,GAAG,CAAC,CAAA;YACL,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACT,IAAI,GAAG,IAAI,CAAA;YACX,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAC,CAAC;gBACxC,CAAC,GAAoB,CAAC,CAAC,IAAI,CAAA;gBAC3B,IAAI,GAAG,IAAI,CAAA;YACf,CAAC;iBAAM,CAAC;gBACJ,CAAC,GAAoB,CAAC,CAAC,KAAK,CAAA;gBAC5B,IAAI,GAAG,KAAK,CAAA;YAChB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACzB,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACX,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;gBACX,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAC,CAAC;oBAC7F,IAAI,IAAI,IAAI,IAAI,EAAC,CAAC;wBACd,IAAI,IAAI,IAAI,IAAI,EAAC,CAAC;4BACd,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;wBAC1B,CAAC;6BAAM,CAAC;4BACJ,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAA;wBAChC,CAAC;oBACL,CAAC;yBAAM,CAAC;wBACJ,IAAI,IAAI,IAAI,IAAI,EAAC,CAAC;4BACd,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;wBACjC,CAAC;6BAAM,CAAC;4BACJ,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;wBAC5B,CAAC;oBACL,CAAC;oBACD,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;oBACZ,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,MAAM;gBACV,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAEM,UAAU,CAAE,IAAQ;QACvB,IAAI,CAAC,MAAM,CAAC,IAAI,yBAAW,CAAI,IAAI,CAAC,CAAC,CAAA;IACzC,CAAC;CAEJ;AArKD,0BAqKC"}

package/dist/tree/AvlTreeNode.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.AvlTreeNode = void 0;
+const TreeNode_1 = require("./TreeNode");
+class AvlTreeNode extends TreeNode_1.TreeNode {
+    height;
+    constructor(data) {
+        super(data);
+        this.height = 1;
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "./TreeNode"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.AvlTreeNode = void 0;
-    const TreeNode_1 = require("./TreeNode");
-    class AvlTreeNode extends TreeNode_1.TreeNode {
-        constructor(data) {
-            super(data);
-            this.height = 1;
-        }
-    }
-    exports.AvlTreeNode = AvlTreeNode;
-});
+}
+exports.AvlTreeNode = AvlTreeNode;
 //# sourceMappingURL=AvlTreeNode.js.map

package/dist/tree/AvlTreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"AvlTreeNode.js","sourceRoot":"","sources":["../../source/tree/AvlTreeNode.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,yCAAoC;IAEpC,MAAa,WAAe,SAAQ,mBAAW;QAI3C,YAAa,IAAO;YAChB,KAAK,CAAC,IAAI,CAAC,CAAA;YACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;QACnB,CAAC;KAEJ;IATD,kCASC"}
+{"version":3,"file":"AvlTreeNode.js","sourceRoot":"","sources":["../../source/tree/AvlTreeNode.ts"],"names":[],"mappings":";;;AAAA,yCAAoC;AAEpC,MAAa,WAAe,SAAQ,mBAAW;IAE3C,MAAM,CAAS;IAEf,YAAa,IAAO;QAChB,KAAK,CAAC,IAAI,CAAC,CAAA;QACX,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACnB,CAAC;CAEJ;AATD,kCASC"}

package/dist/tree/BTree.js

@@ -1,93 +1,85 @@
-(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", "./BTreeNode"], factory);
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BTree = void 0;
+const BTreeNode_1 = require("./BTreeNode");
+/**
+ * <p>In the computer science literature, the structures such as AVL tree, splay tree, red-black tree are proposed, which
+ * show the search tree property and also remain balanced after insertion and deletion operations.</p>
+ *
+ * <p>Another possibility of constructing a balanced tree structure is to store not only a single value but more than one
+ * value in a node. These type of tree structures are generalizations of the binary trees and called d-ary tree
+ * structures in the computer science literature. 2-3-4 trees, B-tree, B+ trees can be given as example d-ary tree
+ * structures. B+ trees, is one of the d-ary tree structures and used often in database systems.</p>
+ *
+ * <p>B+ tree is a dynamic search tree structure and consists of two parts, an index part and a data part. The index part
+ * is of d-ary tree structure, each node stores d {@literal <} m {@literal <} 2d values. d is a parameter of B+ tree, shows the capacity of B+
+ * tree and called as the degree of the tree. The root node is the single exception to this rule and can store
+ * 1 {@literal <} m {@literal <} 2d values. Each node also contains m + 1 links to point to its m + 1 child nodes. With the help of these
+ * links, the tree can be traversed in top-down manner. Let Pi represent the link pointing to the node i and Ki
+ * represent the i'th value in the same node, the i'th child and the ascendants of this child can take values between
+ * the interval Ki {@literal <} K {@literal <} Ki+1. The data are stored in the leaf nodes and due to the definition of a tree, the leaf nodes
+ * can not have children.</p>
+ * @param T Type of the data stored in the B tree node.
+ */
+class BTree {
+    root = null;
+    comparator;
+    d;
+    /**
+     * Constructor of the tree. According to the comparator, the tree could contain any object.
+     * @param d Parameter d in d-ary tree.
+     * @param comparator Comparator function to compare two elements.
+     */
+    constructor(d, comparator) {
+        this.comparator = comparator;
+        this.d = d;
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.BTree = void 0;
-    const BTreeNode_1 = require("./BTreeNode");
     /**
-     * <p>In the computer science literature, the structures such as AVL tree, splay tree, red-black tree are proposed, which
-     * show the search tree property and also remain balanced after insertion and deletion operations.</p>
-     *
-     * <p>Another possibility of constructing a balanced tree structure is to store not only a single value but more than one
-     * value in a node. These type of tree structures are generalizations of the binary trees and called d-ary tree
-     * structures in the computer science literature. 2-3-4 trees, B-tree, B+ trees can be given as example d-ary tree
-     * structures. B+ trees, is one of the d-ary tree structures and used often in database systems.</p>
-     *
-     * <p>B+ tree is a dynamic search tree structure and consists of two parts, an index part and a data part. The index part
-     * is of d-ary tree structure, each node stores d {@literal <} m {@literal <} 2d values. d is a parameter of B+ tree, shows the capacity of B+
-     * tree and called as the degree of the tree. The root node is the single exception to this rule and can store
-     * 1 {@literal <} m {@literal <} 2d values. Each node also contains m + 1 links to point to its m + 1 child nodes. With the help of these
-     * links, the tree can be traversed in top-down manner. Let Pi represent the link pointing to the node i and Ki
-     * represent the i'th value in the same node, the i'th child and the ascendants of this child can take values between
-     * the interval Ki {@literal <} K {@literal <} Ki+1. The data are stored in the leaf nodes and due to the definition of a tree, the leaf nodes
-     * can not have children.</p>
-     * @param T Type of the data stored in the B tree node.
+     * We start searching from the root node, the node with which we compare the searched value at each stage is
+     * represented by b, and we continue the search until we arrive the leaf nodes. In order to understand the subtree
+     * of node b where our searched value resides, we need to compare the searched value with the values Ki. For this,
+     * the function named position is given. If the searched value is larger than the last value of node b, we need to
+     * continue the search with the rightmost child. If the searched value is smaller than the i. value of node b, we
+     * need to continue the search with the i. child. As a last step, the function returns the leaf node of node b.
+     * @param value Value searched in B+ tree.
+     * @return If the value exists in the tree, the function returns the node that contains the node. Otherwise, it
+     * returns null.
      */
-    class BTree {
-        /**
-         * Constructor of the tree. According to the comparator, the tree could contain any object.
-         * @param d Parameter d in d-ary tree.
-         * @param comparator Comparator function to compare two elements.
-         */
-        constructor(d, comparator) {
-            this.root = null;
-            this.comparator = comparator;
-            this.d = d;
-        }
-        /**
-         * We start searching from the root node, the node with which we compare the searched value at each stage is
-         * represented by b, and we continue the search until we arrive the leaf nodes. In order to understand the subtree
-         * of node b where our searched value resides, we need to compare the searched value with the values Ki. For this,
-         * the function named position is given. If the searched value is larger than the last value of node b, we need to
-         * continue the search with the rightmost child. If the searched value is smaller than the i. value of node b, we
-         * need to continue the search with the i. child. As a last step, the function returns the leaf node of node b.
-         * @param value Value searched in B+ tree.
-         * @return If the value exists in the tree, the function returns the node that contains the node. Otherwise, it
-         * returns null.
-         */
-        search(value) {
-            let b = this.root;
-            while (b != null && !b.leaf) {
-                let child = b.position(value, this.comparator);
-                if (child < b.m && b.K[child] == value) {
-                    return b;
-                }
-                b = b.children[child];
-            }
-            if (b != null) {
-                let child = b.position(value, this.comparator);
-                if (child < b.m && b.K[child] == value) {
-                    return b;
-                }
+    search(value) {
+        let b = this.root;
+        while (b != null && !b.leaf) {
+            let child = b.position(value, this.comparator);
+            if (child < b.m && b.K[child] == value) {
+                return b;
             }
-            return null;
+            b = b.children[child];
         }
-        insertData(data) {
-            if (this.root == null) {
-                this.root = new BTreeNode_1.BTreeNode(this.d, undefined, undefined, undefined);
+        if (b != null) {
+            let child = b.position(value, this.comparator);
+            if (child < b.m && b.K[child] == value) {
+                return b;
             }
-            if (this.root.leaf) {
-                let s = this.root.insertLeaf(data, this.comparator);
-                if (s != null) {
-                    let tmp = this.root;
-                    this.root = new BTreeNode_1.BTreeNode(this.d, tmp, s, tmp.K[this.d]);
-                }
+        }
+        return null;
+    }
+    insertData(data) {
+        if (this.root == null) {
+            this.root = new BTreeNode_1.BTreeNode(this.d, undefined, undefined, undefined);
+        }
+        if (this.root.leaf) {
+            let s = this.root.insertLeaf(data, this.comparator);
+            if (s != null) {
+                let tmp = this.root;
+                this.root = new BTreeNode_1.BTreeNode(this.d, tmp, s, tmp.K[this.d]);
             }
-            else {
-                let s = this.root.insertNode(data, this.comparator, true);
-                if (s != null) {
-                    this.root = s;
-                }
+        }
+        else {
+            let s = this.root.insertNode(data, this.comparator, true);
+            if (s != null) {
+                this.root = s;
             }
         }
     }
-    exports.BTree = BTree;
-});
+}
+exports.BTree = BTree;
 //# sourceMappingURL=BTree.js.map

package/dist/tree/BTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"BTree.js","sourceRoot":"","sources":["../../source/tree/BTree.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,2CAAsC;IAEtC;;;;;;;;;;;;;;;;;;OAkBG;IACH,MAAa,KAAK;QAMd;;;;WAIG;QACH,YAAY,CAAS,EAAE,UAA6C;YATpE,SAAI,GAAyB,IAAI,CAAC;YAU9B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;YAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACd,CAAC;QAED;;;;;;;;;;WAUG;QACI,MAAM,CAAC,KAAQ;YAClB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;YAClB,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAC;gBACxB,IAAI,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;gBAC9C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,EAAC;oBACnC,OAAO,CAAC,CAAA;iBACX;gBACD,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;aACxB;YACD,IAAI,CAAC,IAAI,IAAI,EAAC;gBACV,IAAI,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;gBAC9C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,EAAC;oBACnC,OAAO,CAAC,CAAA;iBACX;aACJ;YACD,OAAO,IAAI,CAAA;QACf,CAAC;QAEM,UAAU,CAAC,IAAO;YACrB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAC;gBAClB,IAAI,CAAC,IAAI,GAAG,IAAI,qBAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;aACxE;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;gBACf,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;gBACnD,IAAI,CAAC,IAAI,IAAI,EAAC;oBACV,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;oBACnB,IAAI,CAAC,IAAI,GAAG,IAAI,qBAAS,CAAI,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/D;aACJ;iBAAM;gBACH,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;gBAC1D,IAAI,CAAC,IAAI,IAAI,EAAC;oBACV,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;iBACjB;aACJ;QACL,CAAC;KAEJ;IA/DD,sBA+DC"}
+{"version":3,"file":"BTree.js","sourceRoot":"","sources":["../../source/tree/BTree.ts"],"names":[],"mappings":";;;AAAA,2CAAsC;AAEtC;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAa,KAAK;IAEd,IAAI,GAAyB,IAAI,CAAC;IAClC,UAAU,CAAoC;IAC9C,CAAC,CAAS;IAEV;;;;OAIG;IACH,YAAY,CAAS,EAAE,UAA6C;QAChE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;QAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,KAAQ;QAClB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QAClB,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAC,CAAC;YACzB,IAAI,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;YAC9C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,EAAC,CAAC;gBACpC,OAAO,CAAC,CAAA;YACZ,CAAC;YACD,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QACzB,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;YACX,IAAI,KAAK,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;YAC9C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,EAAC,CAAC;gBACpC,OAAO,CAAC,CAAA;YACZ,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAEM,UAAU,CAAC,IAAO;QACrB,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAC,CAAC;YACnB,IAAI,CAAC,IAAI,GAAG,IAAI,qBAAS,CAAI,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC,CAAC;YAChB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;YACnD,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;gBACX,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAA;gBACnB,IAAI,CAAC,IAAI,GAAG,IAAI,qBAAS,CAAI,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,IAAI,EAAC,CAAC;gBACX,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YAClB,CAAC;QACL,CAAC;IACL,CAAC;CAEJ;AA/DD,sBA+DC"}