avl-tree-typed 2.1.2 → 2.2.1

package/dist/umd/avl-tree-typed.js

@@ -909,7 +909,7 @@ var avlTreeTyped = (() => {
     every(predicate, thisArg) {
       let index = 0;
       for (const item of this) {
-        if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
+        if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
           return false;
         }
       }
@@ -925,7 +925,7 @@ var avlTreeTyped = (() => {
     some(predicate, thisArg) {
       let index = 0;
       for (const item of this) {
-        if (predicate.call(thisArg, item[0], item[1], index++, this)) {
+        if (predicate.call(thisArg, item[1], item[0], index++, this)) {
           return true;
         }
       }
@@ -941,7 +941,7 @@ var avlTreeTyped = (() => {
       let index = 0;
       for (const item of this) {
         const [key, value] = item;
-        callbackfn.call(thisArg, key, value, index++, this);
+        callbackfn.call(thisArg, value, key, index++, this);
       }
     }
     /**
@@ -955,7 +955,7 @@ var avlTreeTyped = (() => {
       let index = 0;
       for (const item of this) {
         const [key, value] = item;
-        if (callbackfn.call(thisArg, key, value, index++, this)) return item;
+        if (callbackfn.call(thisArg, value, key, index++, this)) return item;
       }
       return;
     }
@@ -2201,7 +2201,7 @@ var avlTreeTyped = (() => {
     filter(predicate, thisArg) {
       const out = this._createInstance();
       let i = 0;
-      for (const [k, v] of this) if (predicate.call(thisArg, k, v, i++, this)) out.add([k, v]);
+      for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
       return out;
     }
     /**
@@ -2219,7 +2219,7 @@ var avlTreeTyped = (() => {
     map(cb, options, thisArg) {
       const out = this._createLike([], options);
       let i = 0;
-      for (const [k, v] of this) out.add(cb.call(thisArg, k, v, i++, this));
+      for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
       return out;
     }
     /**
@@ -2668,7 +2668,7 @@ var avlTreeTyped = (() => {
   };
 
   // src/data-structures/binary-tree/bst.ts
-  var BSTNode = class extends BinaryTreeNode {
+  var BSTNode = class {
     /**
      * Creates an instance of BSTNode.
      * @remarks Time O(1), Space O(1)
@@ -2677,10 +2677,16 @@ var avlTreeTyped = (() => {
      * @param [value] - The value associated with the key.
      */
     constructor(key, value) {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
     }
     /**
      * Gets the left child of the node.
@@ -2720,6 +2726,77 @@ var avlTreeTyped = (() => {
       if (v) v.parent = this;
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var BST = class extends BinaryTree {
     /**
@@ -3238,7 +3315,7 @@ var avlTreeTyped = (() => {
       const out = this._createLike([], options);
       let index = 0;
       for (const [key, value] of this) {
-        out.add(callback.call(thisArg, key, value, index++, this));
+        out.add(callback.call(thisArg, value, key, index++, this));
       }
       return out;
     }
@@ -3395,7 +3472,7 @@ var avlTreeTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree.ts
-  var AVLTreeNode = class extends BSTNode {
+  var AVLTreeNode = class {
     /**
      * Creates an instance of AVLTreeNode.
      * @remarks Time O(1), Space O(1)
@@ -3404,10 +3481,16 @@ var avlTreeTyped = (() => {
      * @param [value] - The value associated with the key.
      */
     constructor(key, value) {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
     }
     /**
      * Gets the left child of the node.
@@ -3451,6 +3534,77 @@ var avlTreeTyped = (() => {
       }
       this._right = v;
     }
+    /**
+     * Gets the height of the node (used in self-balancing trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The height.
+     */
+    get height() {
+      return this._height;
+    }
+    /**
+     * Sets the height of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new height.
+     */
+    set height(value) {
+      this._height = value;
+    }
+    /**
+     * Gets the color of the node (used in Red-Black trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The node's color.
+     */
+    get color() {
+      return this._color;
+    }
+    /**
+     * Sets the color of the node.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new color.
+     */
+    set color(value) {
+      this._color = value;
+    }
+    /**
+     * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The subtree node count.
+     */
+    get count() {
+      return this._count;
+    }
+    /**
+     * Sets the count of nodes in the subtree.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param value - The new count.
+     */
+    set count(value) {
+      this._count = value;
+    }
+    /**
+     * Gets the position of the node relative to its parent.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+     */
+    get familyPosition() {
+      if (!this.parent) {
+        return this.left || this.right ? "ROOT" : "ISOLATED";
+      }
+      if (this.parent.left === this) {
+        return this.left || this.right ? "ROOT_LEFT" : "LEFT";
+      } else if (this.parent.right === this) {
+        return this.left || this.right ? "ROOT_RIGHT" : "RIGHT";
+      }
+      return "MAL_NODE";
+    }
   };
   var AVLTree = class extends BST {
     /**
@@ -3561,7 +3715,7 @@ var avlTreeTyped = (() => {
       const out = this._createLike([], options);
       let index = 0;
       for (const [key, value] of this) {
-        out.add(callback.call(thisArg, key, value, index++, this));
+        out.add(callback.call(thisArg, value, key, index++, this));
       }
       return out;
     }