data-structure-typed 2.1.2 → 2.2.1

package/dist/umd/data-structure-typed.js

@@ -152,7 +152,7 @@ var dataStructureTyped = (() => {
     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;
         }
       }
@@ -168,7 +168,7 @@ var dataStructureTyped = (() => {
     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;
         }
       }
@@ -184,7 +184,7 @@ var dataStructureTyped = (() => {
       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);
       }
     }
     /**
@@ -198,7 +198,7 @@ var dataStructureTyped = (() => {
       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;
     }
@@ -800,7 +800,7 @@ var dataStructureTyped = (() => {
     map(callbackfn, thisArg) {
       const out = this._createLike();
       let index = 0;
-      for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, key, value, index++, this));
+      for (const [key, value] of this) out.set(key, callbackfn.call(thisArg, value, key, index++, this));
       return out;
     }
     /**
@@ -813,7 +813,7 @@ var dataStructureTyped = (() => {
     filter(predicate, thisArg) {
       const out = this._createLike();
       let index = 0;
-      for (const [key, value] of this) if (predicate.call(thisArg, key, value, index++, this)) out.set(key, value);
+      for (const [key, value] of this) if (predicate.call(thisArg, value, key, index++, this)) out.set(key, value);
       return out;
     }
     /**
@@ -1135,7 +1135,7 @@ var dataStructureTyped = (() => {
       const out = this._createLike();
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, key, value, index, this)) out.set(key, value);
+        if (predicate.call(thisArg, value, key, index, this)) out.set(key, value);
         index++;
       }
       return out;
@@ -1153,7 +1153,7 @@ var dataStructureTyped = (() => {
       const out = this._createLike();
       let index = 0;
       for (const [key, value] of this) {
-        const [newKey, newValue] = callback.call(thisArg, key, value, index, this);
+        const [newKey, newValue] = callback.call(thisArg, value, key, index, this);
         out.set(newKey, newValue);
         index++;
       }
@@ -5719,7 +5719,7 @@ var dataStructureTyped = (() => {
       const filtered = [];
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, key, value, index, this)) {
+        if (predicate.call(thisArg, value, key, index, this)) {
           filtered.push([key, value]);
         }
         index++;
@@ -5734,7 +5734,7 @@ var dataStructureTyped = (() => {
       const filtered = [];
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, key, value, index, this)) {
+        if (predicate.call(thisArg, value, key, index, this)) {
           filtered.push([key, value]);
         }
         index++;
@@ -5745,7 +5745,7 @@ var dataStructureTyped = (() => {
       const mapped = [];
       let index = 0;
       for (const [key, value] of this) {
-        mapped.push(callback.call(thisArg, key, value, index, this));
+        mapped.push(callback.call(thisArg, value, key, index, this));
         index++;
       }
       return mapped;
@@ -7998,7 +7998,7 @@ var dataStructureTyped = (() => {
     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;
     }
     /**
@@ -8016,7 +8016,7 @@ var dataStructureTyped = (() => {
     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;
     }
     /**
@@ -8465,7 +8465,7 @@ var dataStructureTyped = (() => {
   };
 
   // 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)
@@ -8474,10 +8474,16 @@ var dataStructureTyped = (() => {
      * @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.
@@ -8517,6 +8523,77 @@ var dataStructureTyped = (() => {
       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 {
     /**
@@ -9035,7 +9112,7 @@ var dataStructureTyped = (() => {
       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;
     }
@@ -9755,7 +9832,7 @@ var dataStructureTyped = (() => {
   };
 
   // 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)
@@ -9764,10 +9841,16 @@ var dataStructureTyped = (() => {
      * @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.
@@ -9811,6 +9894,77 @@ var dataStructureTyped = (() => {
       }
       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 {
     /**
@@ -9921,7 +10075,7 @@ var dataStructureTyped = (() => {
       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;
     }
@@ -10202,7 +10356,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/red-black-tree.ts
-  var RedBlackTreeNode = class extends BSTNode {
+  var RedBlackTreeNode = class {
     /**
      * Create a Red-Black Tree and optionally bulk-insert items.
      * @remarks Time O(n log n), Space O(n)
@@ -10212,11 +10366,17 @@ var dataStructureTyped = (() => {
      * @returns New RedBlackTree instance.
      */
     constructor(key, value, color = "BLACK") {
-      super(key, value);
+      __publicField(this, "key");
+      __publicField(this, "value");
       __publicField(this, "parent");
       __publicField(this, "_left");
       __publicField(this, "_right");
-      this._color = color;
+      __publicField(this, "_height", 0);
+      __publicField(this, "_color", "BLACK");
+      __publicField(this, "_count", 1);
+      this.key = key;
+      this.value = value;
+      this.color = color;
     }
     /**
      * Get the left child pointer.
@@ -10258,6 +10418,77 @@ var dataStructureTyped = (() => {
       }
       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 RedBlackTree = class extends BST {
     constructor(keysNodesEntriesOrRaws = [], options) {
@@ -10406,7 +10637,7 @@ var dataStructureTyped = (() => {
       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;
     }
@@ -10435,16 +10666,16 @@ var dataStructureTyped = (() => {
      * @returns Status string: 'CREATED' or 'UPDATED'.
      */
     _insert(node) {
-      var _a, _b;
-      let current = this.root;
+      var _a, _b, _c;
+      let current = (_a = this.root) != null ? _a : this.NIL;
       let parent = void 0;
-      while (this.isRealNode(current)) {
+      while (current !== this.NIL) {
         parent = current;
         const compared = this._compare(node.key, current.key);
         if (compared < 0) {
-          current = (_a = current.left) != null ? _a : this.NIL;
+          current = (_b = current.left) != null ? _b : this.NIL;
         } else if (compared > 0) {
-          current = (_b = current.right) != null ? _b : this.NIL;
+          current = (_c = current.right) != null ? _c : this.NIL;
         } else {
           this._replaceNode(current, node);
           return "UPDATED";
@@ -10504,7 +10735,7 @@ var dataStructureTyped = (() => {
               z = z.parent;
               this._leftRotate(z);
             }
-            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+            if (z && z.parent && z.parent.parent) {
               z.parent.color = "BLACK";
               z.parent.parent.color = "RED";
               this._rightRotate(z.parent.parent);
@@ -10522,7 +10753,7 @@ var dataStructureTyped = (() => {
               z = z.parent;
               this._rightRotate(z);
             }
-            if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+            if (z && z.parent && z.parent.parent) {
               z.parent.color = "BLACK";
               z.parent.parent.color = "RED";
               this._leftRotate(z.parent.parent);
@@ -10605,7 +10836,7 @@ var dataStructureTyped = (() => {
       }
       const y = x.right;
       x.right = y.left;
-      if (this.isRealNode(y.left)) {
+      if (y.left && y.left !== this.NIL) {
         y.left.parent = x;
       }
       y.parent = x.parent;
@@ -10631,7 +10862,7 @@ var dataStructureTyped = (() => {
       }
       const x = y.left;
       y.left = x.right;
-      if (this.isRealNode(x.right)) {
+      if (x.right && x.right !== this.NIL) {
         x.right.parent = y;
       }
       x.parent = y.parent;
@@ -10648,7 +10879,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree-multi-map.ts
-  var AVLTreeMultiMapNode = class extends AVLTreeNode {
+  var AVLTreeMultiMapNode = class {
     /**
      * Create an AVLTreeMultiMap node with a value bucket.
      * @remarks Time O(1), Space O(1)
@@ -10656,11 +10887,17 @@ var dataStructureTyped = (() => {
      * @param value - Initial array of values.
      * @returns New AVLTreeMultiMapNode instance.
      */
-    constructor(key, value) {
-      super(key, value);
+    constructor(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;
     }
     /**
      * Get the left child pointer.
@@ -10702,14 +10939,85 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
-  };
-  var AVLTreeMultiMap = class extends AVLTree {
     /**
-     * Create an AVLTreeMultiMap and optionally bulk-insert items.
-     * @remarks Time O(N log N), Space O(N)
-     * @param [keysNodesEntriesOrRaws] - Iterable of keys/nodes/entries/raw items to insert.
-     * @param [options] - Options for AVLTreeMultiMap (comparator, reverse, map mode).
-     * @returns New AVLTreeMultiMap instance.
+     * 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 AVLTreeMultiMap = class extends AVLTree {
+    /**
+     * Create an AVLTreeMultiMap and optionally bulk-insert items.
+     * @remarks Time O(N log N), Space O(N)
+     * @param [keysNodesEntriesOrRaws] - Iterable of keys/nodes/entries/raw items to insert.
+     * @param [options] - Options for AVLTreeMultiMap (comparator, reverse, map mode).
+     * @returns New AVLTreeMultiMap instance.
      */
     constructor(keysNodesEntriesOrRaws = [], options) {
       super([], { ...options, isMapMode: true });
@@ -10720,6 +11028,16 @@ var dataStructureTyped = (() => {
     createNode(key, value = []) {
       return new AVLTreeMultiMapNode(key, this._isMapMode ? [] : value);
     }
+    /**
+     * Checks if the given item is a `AVLTreeMultiMapNode` instance.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param keyNodeOrEntry - The item to check.
+     * @returns True if it's a AVLTreeMultiMapNode, false otherwise.
+     */
+    isNode(keyNodeOrEntry) {
+      return keyNodeOrEntry instanceof AVLTreeMultiMapNode;
+    }
     /**
      * Insert a value or a list of values into the multimap. If the key exists, values are appended.
      * @remarks Time O(log N + M), Space O(1)
@@ -10828,7 +11146,7 @@ var dataStructureTyped = (() => {
     map(callback, options, thisArg) {
       const out = this._createLike([], options);
       let i = 0;
-      for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+      for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
       return out;
     }
     /**
@@ -10863,7 +11181,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/tree-multi-map.ts
-  var TreeMultiMapNode = class extends RedBlackTreeNode {
+  var TreeMultiMapNode = class {
     /**
      * Create a TreeMultiMap node with an optional value bucket.
      * @remarks Time O(1), Space O(1)
@@ -10871,11 +11189,18 @@ var dataStructureTyped = (() => {
      * @param [value] - Initial array of values.
      * @returns New TreeMultiMapNode instance.
      */
-    constructor(key, value) {
-      super(key, value);
+    constructor(key, value = [], color = "BLACK") {
+      __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;
+      this.color = color;
     }
     /**
      * Get the left child pointer.
@@ -10917,6 +11242,77 @@ var dataStructureTyped = (() => {
       }
       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 TreeMultiMap = class extends RedBlackTree {
     /**
@@ -10935,6 +11331,16 @@ var dataStructureTyped = (() => {
     createNode(key, value = []) {
       return new TreeMultiMapNode(key, this._isMapMode ? [] : value);
     }
+    /**
+     * Checks if the given item is a `TreeMultiMapNode` instance.
+     * @remarks Time O(1), Space O(1)
+     *
+     * @param keyNodeOrEntry - The item to check.
+     * @returns True if it's a TreeMultiMapNode, false otherwise.
+     */
+    isNode(keyNodeOrEntry) {
+      return keyNodeOrEntry instanceof TreeMultiMapNode;
+    }
     /**
      * Insert a value or a list of values into the multimap. If the key exists, values are appended.
      * @remarks Time O(log N + M), Space O(1)
@@ -11015,7 +11421,7 @@ var dataStructureTyped = (() => {
     map(callback, options, thisArg) {
       const out = this._createLike([], options);
       let i = 0;
-      for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+      for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
       return out;
     }
     /**
@@ -11050,7 +11456,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/tree-counter.ts
-  var TreeCounterNode = class extends RedBlackTreeNode {
+  var TreeCounterNode = class {
     /**
      * Create a tree counter node.
      * @remarks Time O(1), Space O(1)
@@ -11061,10 +11467,17 @@ var dataStructureTyped = (() => {
      * @returns New TreeCounterNode instance.
      */
     constructor(key, value, count = 1, color = "BLACK") {
-      super(key, value, color);
+      __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;
+      this.color = color;
       this.count = count;
     }
     /**
@@ -11107,6 +11520,77 @@ var dataStructureTyped = (() => {
       }
       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 TreeCounter = class extends RedBlackTree {
     /**
@@ -11314,7 +11798,7 @@ var dataStructureTyped = (() => {
       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;
     }
@@ -11420,7 +11904,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/binary-tree/avl-tree-counter.ts
-  var AVLTreeCounterNode = class extends AVLTreeNode {
+  var AVLTreeCounterNode = class {
     /**
      * Create an AVL counter node.
      * @remarks Time O(1), Space O(1)
@@ -11430,10 +11914,16 @@ var dataStructureTyped = (() => {
      * @returns New AVLTreeCounterNode instance.
      */
     constructor(key, value, count = 1) {
-      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;
       this.count = count;
     }
     /**
@@ -11476,6 +11966,77 @@ var dataStructureTyped = (() => {
       }
       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 AVLTreeCounter = class extends AVLTree {
     /**
@@ -11657,7 +12218,7 @@ var dataStructureTyped = (() => {
       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;
     }