data-structure-typed 1.53.8 → 1.54.0

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

@@ -231,7 +231,7 @@ var dataStructureTyped = (() => {
     every(predicate, thisArg) {
       let index = 0;
       for (const item of this) {
-        if (!predicate.call(thisArg, item[1], item[0], index++, this)) {
+        if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
           return false;
         }
       }
@@ -255,7 +255,7 @@ var dataStructureTyped = (() => {
     some(predicate, thisArg) {
       let index = 0;
       for (const item of this) {
-        if (predicate.call(thisArg, item[1], item[0], index++, this)) {
+        if (predicate.call(thisArg, item[0], item[1], index++, this)) {
           return true;
         }
       }
@@ -278,7 +278,7 @@ var dataStructureTyped = (() => {
       let index = 0;
       for (const item of this) {
         const [key, value] = item;
-        callbackfn.call(thisArg, value, key, index++, this);
+        callbackfn.call(thisArg, key, value, index++, this);
       }
     }
     /**
@@ -302,7 +302,7 @@ var dataStructureTyped = (() => {
       let index = 0;
       for (const item of this) {
         const [key, value] = item;
-        if (callbackfn.call(thisArg, value, key, index++, this)) return item;
+        if (callbackfn.call(thisArg, key, value, index++, this)) return item;
       }
       return;
     }
@@ -951,7 +951,7 @@ var dataStructureTyped = (() => {
       const resultMap = new _HashMap();
       let index = 0;
       for (const [key, value] of this) {
-        resultMap.set(key, callbackfn.call(thisArg, value, key, index++, this));
+        resultMap.set(key, callbackfn.call(thisArg, key, value, index++, this));
       }
       return resultMap;
     }
@@ -975,7 +975,7 @@ var dataStructureTyped = (() => {
       const filteredMap = new _HashMap();
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, value, key, index++, this)) {
+        if (predicate.call(thisArg, key, value, index++, this)) {
           filteredMap.set(key, value);
         }
       }
@@ -1420,7 +1420,7 @@ var dataStructureTyped = (() => {
       const filteredMap = new _LinkedHashMap();
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, value, key, index, this)) {
+        if (predicate.call(thisArg, key, value, index, this)) {
           filteredMap.set(key, value);
         }
         index++;
@@ -1448,8 +1448,8 @@ var dataStructureTyped = (() => {
       const mappedMap = new _LinkedHashMap();
       let index = 0;
       for (const [key, value] of this) {
-        const newValue = callback.call(thisArg, value, key, index, this);
-        mappedMap.set(key, newValue);
+        const [newKey, newValue] = callback.call(thisArg, key, value, index, this);
+        mappedMap.set(newKey, newValue);
         index++;
       }
       return mappedMap;
@@ -1585,6 +1585,22 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
+     * array.
+     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
+     * @returns The `fromArray` function returns a `SinglyLinkedList` object.
+     */
+    static fromArray(data) {
+      const singlyLinkedList = new _SinglyLinkedList();
+      for (const item of data) {
+        singlyLinkedList.push(item);
+      }
+      return singlyLinkedList;
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2170,22 +2186,6 @@ var dataStructureTyped = (() => {
         current = current.next;
       }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
-     * array.
-     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
-     * @returns The `fromArray` function returns a `SinglyLinkedList` object.
-     */
-    static fromArray(data) {
-      const singlyLinkedList = new _SinglyLinkedList();
-      for (const item of data) {
-        singlyLinkedList.push(item);
-      }
-      return singlyLinkedList;
-    }
     /**
      * The _isPredicate function in TypeScript checks if the input is a function that takes a
      * SinglyLinkedListNode as an argument and returns a boolean.
@@ -2356,6 +2356,18 @@ var dataStructureTyped = (() => {
       var _a;
       return (_a = this.tail) == null ? void 0 : _a.value;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
+     * given array.
+     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
+     * @returns The `fromArray` function returns a DoublyLinkedList object.
+     */
+    static fromArray(data) {
+      return new _DoublyLinkedList(data);
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -2962,18 +2974,6 @@ var dataStructureTyped = (() => {
       }
       return count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
-     * given array.
-     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
-     * @returns The `fromArray` function returns a DoublyLinkedList object.
-     */
-    static fromArray(data) {
-      return new _DoublyLinkedList(data);
-    }
     /**
      * The function returns an iterator that iterates over the values of a linked list.
      */
@@ -6192,7 +6192,7 @@ var dataStructureTyped = (() => {
       const filtered = [];
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, value, key, index, this)) {
+        if (predicate.call(thisArg, key, value, index, this)) {
           filtered.push([key, value]);
         }
         index++;
@@ -6216,7 +6216,7 @@ var dataStructureTyped = (() => {
       const mapped = [];
       let index = 0;
       for (const [key, value] of this) {
-        mapped.push(callback.call(thisArg, value, key, index, this));
+        mapped.push(callback.call(thisArg, key, value, index, this));
         index++;
       }
       return mapped;
@@ -7389,6 +7389,9 @@ var dataStructureTyped = (() => {
       __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;
     }
@@ -7410,6 +7413,24 @@ var dataStructureTyped = (() => {
       }
       this._right = v;
     }
+    get height() {
+      return this._height;
+    }
+    set height(value) {
+      this._height = value;
+    }
+    get color() {
+      return this._color;
+    }
+    set color(value) {
+      this._color = value;
+    }
+    get count() {
+      return this._count;
+    }
+    set count(value) {
+      this._count = value;
+    }
     get familyPosition() {
       const that = this;
       if (!this.parent) {
@@ -7471,6 +7492,9 @@ var dataStructureTyped = (() => {
       return this._toEntryFn;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function creates a new binary tree node with a specified key and optional value.
      * @param {K} key - The `key` parameter is the key of the node being created in the binary tree.
      * @param {V} [value] - The `value` parameter in the `createNode` function is optional, meaning it is
@@ -8733,7 +8757,7 @@ var dataStructureTyped = (() => {
       const newTree = this.createTree();
       let index = 0;
       for (const [key, value] of this) {
-        if (predicate.call(thisArg, value, key, index++, this)) {
+        if (predicate.call(thisArg, key, value, index++, this)) {
           newTree.add([key, value]);
         }
       }
@@ -8743,34 +8767,29 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(n)
      *
-     * The `map` function iterates over key-value pairs in a tree data structure, applies a callback
-     * function to each value, and returns a new tree with the updated values.
-     * @param callback - The `callback` parameter in the `map` method is a function that will be called
-     * on each entry in the tree. It takes four arguments:
-     * @param {any} [thisArg] - The `thisArg` parameter in the `map` function is an optional parameter
-     * that specifies the value to be passed as `this` when executing the callback function. If provided,
-     * the `thisArg` value will be used as the `this` value within the callback function. If `thisArg
-     * @returns The `map` method is returning a new tree with the entries modified by the provided
-     * callback function. Each entry in the original tree is passed to the callback function, and the
-     * result of the callback function is added to the new tree.
-     */
-    map(callback, thisArg) {
-      const newTree = this.createTree();
+     * The `map` function in TypeScript creates a new BinaryTree by applying a callback function to each
+     * entry in the original BinaryTree.
+     * @param callback - A function that will be called for each entry in the current binary tree. It
+     * takes the key, value (which can be undefined), and an array containing the mapped key and value as
+     * arguments.
+     * @param [options] - The `options` parameter in the `map` method is of type `BinaryTreeOptions<MK,
+     * MV, MR>`. It is an optional parameter that allows you to specify additional options for the binary
+     * tree being created during the mapping process. These options could include things like custom
+     * comparators, initial
+     * @param {any} [thisArg] - The `thisArg` parameter in the `map` method is used to specify the value
+     * of `this` when executing the `callback` function. It allows you to set the context (value of
+     * `this`) within the callback function. If `thisArg` is provided, it will be passed
+     * @returns The `map` function is returning a new `BinaryTree` instance filled with entries that are
+     * the result of applying the provided `callback` function to each entry in the original tree.
+     */
+    map(callback, options, thisArg) {
+      const newTree = new _BinaryTree([], options);
       let index = 0;
       for (const [key, value] of this) {
-        newTree.add([key, callback.call(thisArg, value, key, index++, this)]);
+        newTree.add(callback.call(thisArg, key, value, index++, this));
       }
       return newTree;
     }
-    // // TODO Type error, need to return a TREE<NV> that is a value type only for callback function.
-    // // map<NV>(callback: (entry: [K, V | undefined], tree: this) => NV) {
-    // //   const newTree = this.createTree();
-    // //   for (const [key, value] of this) {
-    // //     newTree.add(key, callback([key, value], this));
-    // //   }
-    // //   return newTree;
-    // // }
-    //
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -8801,7 +8820,7 @@ var dataStructureTyped = (() => {
       if (opts.isShowRedBlackNIL) output += `S for Sentinel Node(NIL)
 `;
       const display = (root) => {
-        const [lines, , ,] = this._displayAux(root, opts);
+        const [lines, ,] = this._displayAux(root, opts);
         let paragraph = "";
         for (const line of lines) {
           paragraph += line + "\n";
@@ -9301,22 +9320,22 @@ var dataStructureTyped = (() => {
           if (a < b) return -1;
           return 0;
         }
-        if (this._extractComparable) {
-          if (this._extractComparable(a) > this._extractComparable(b)) return 1;
-          if (this._extractComparable(a) < this._extractComparable(b)) return -1;
+        if (this._specifyComparable) {
+          if (this._specifyComparable(a) > this._specifyComparable(b)) return 1;
+          if (this._specifyComparable(a) < this._specifyComparable(b)) return -1;
           return 0;
         }
         if (typeof a === "object" || typeof b === "object") {
           throw TypeError(
-            `When comparing object types, a custom extractComparable must be defined in the constructor's options parameter.`
+            `When comparing object types, a custom specifyComparable must be defined in the constructor's options parameter.`
           );
         }
         return 0;
       });
-      __publicField(this, "_extractComparable");
+      __publicField(this, "_specifyComparable");
       if (options) {
-        const { extractComparable, isReverse } = options;
-        if (typeof extractComparable === "function") this._extractComparable = extractComparable;
+        const { specifyComparable, isReverse } = options;
+        if (typeof specifyComparable === "function") this._specifyComparable = specifyComparable;
         if (isReverse !== void 0) this._isReverse = isReverse;
       }
       if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
@@ -9358,7 +9377,7 @@ var dataStructureTyped = (() => {
       return new _BST([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        extractComparable: this._extractComparable,
+        specifyComparable: this._specifyComparable,
         toEntryFn: this._toEntryFn,
         isReverse: this._isReverse
       }, options));
@@ -9415,7 +9434,7 @@ var dataStructureTyped = (() => {
      * this._DEFAULT_COMPARATOR`.
      */
     isKey(key) {
-      return isComparable(key, this._extractComparable !== void 0);
+      return isComparable(key, this._specifyComparable !== void 0);
     }
     /**
      * Time Complexity: O(log n)
@@ -9450,7 +9469,7 @@ var dataStructureTyped = (() => {
             this._size++;
             return true;
           }
-          current = current.left;
+          if (current.left !== null) current = current.left;
         } else {
           if (current.right === void 0) {
             current.right = newNode;
@@ -9458,7 +9477,7 @@ var dataStructureTyped = (() => {
             this._size++;
             return true;
           }
-          current = current.right;
+          if (current.right !== null) current = current.right;
         }
       }
       return false;
@@ -9557,18 +9576,6 @@ var dataStructureTyped = (() => {
       }
       return inserted;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `merge` function overrides the base class method by adding elements from another
-     * binary search tree.
-     * @param anotherTree - `anotherTree` is an instance of a Binary Search Tree (BST) with key type `K`,
-     * value type `V`, return type `R`, node type `NODE`, and tree type `TREE`.
-     */
-    merge(anotherTree) {
-      this.addMany(anotherTree, [], false);
-    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(k + log n)
@@ -9915,7 +9922,7 @@ var dataStructureTyped = (() => {
         while (stack.length > 0 || node) {
           if (node) {
             stack.push(node);
-            node = node.left;
+            if (node.left !== null) node = node.left;
           } else {
             node = stack[stack.length - 1];
             if (!node.right || last === node.right) {
@@ -9942,12 +9949,12 @@ var dataStructureTyped = (() => {
       return this._comparator;
     }
     /**
-     * This function returns the value of the `_extractComparable` property.
-     * @returns The method `extractComparable()` is being returned, which is a getter method for the
-     * `_extractComparable` property.
+     * This function returns the value of the `_specifyComparable` property.
+     * @returns The method `specifyComparable()` is being returned, which is a getter method for the
+     * `_specifyComparable` property.
      */
-    get extractComparable() {
-      return this._extractComparable;
+    get specifyComparable() {
+      return this._specifyComparable;
     }
     /**
      * The function sets the root of a tree-like structure and updates the parent property of the new
@@ -9963,6 +9970,14 @@ var dataStructureTyped = (() => {
     _compare(a, b) {
       return this._isReverse ? -this._comparator(a, b) : this._comparator(a, b);
     }
+    map(callback, options, thisArg) {
+      const newTree = new _BST([], options);
+      let index = 0;
+      for (const [key, value] of this) {
+        newTree.add(callback.call(thisArg, key, value, index++, this));
+      }
+      return newTree;
+    }
   };
 
   // src/data-structures/binary-tree/binary-indexed-tree.ts
@@ -10540,23 +10555,6 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value) {
       super(key, value);
-      __publicField(this, "_height");
-      this._height = 0;
-    }
-    /**
-     * The function returns the value of the height property.
-     * @returns The height of the object.
-     */
-    get height() {
-      return this._height;
-    }
-    /**
-     * The above function sets the value of the height property.
-     * @param {number} value - The value parameter is a number that represents the new height value to be
-     * set.
-     */
-    set height(value) {
-      this._height = value;
     }
   };
   var AVLTree = class _AVLTree extends BST {
@@ -10598,7 +10596,7 @@ var dataStructureTyped = (() => {
       return new _AVLTree([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        extractComparable: this._extractComparable,
+        specifyComparable: this._specifyComparable,
         toEntryFn: this._toEntryFn,
         isReverse: this._isReverse
       }, options));
@@ -10654,6 +10652,14 @@ var dataStructureTyped = (() => {
       }
       return deletedResults;
     }
+    map(callback, options, thisArg) {
+      const newTree = new _AVLTree([], options);
+      let index = 0;
+      for (const [key, value] of this) {
+        newTree.add(callback.call(thisArg, key, value, index++, this));
+      }
+      return newTree;
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -10729,7 +10735,7 @@ var dataStructureTyped = (() => {
     _balanceLL(A) {
       const parentOfA = A.parent;
       const B = A.left;
-      A.parent = B;
+      if (B !== null) A.parent = B;
       if (B && B.right) {
         B.right.parent = A;
       }
@@ -10764,11 +10770,11 @@ var dataStructureTyped = (() => {
       if (B) {
         C = B.right;
       }
-      if (A) A.parent = C;
-      if (B) B.parent = C;
+      if (A && C !== null) A.parent = C;
+      if (B && C !== null) B.parent = C;
       if (C) {
         if (C.left) {
-          C.left.parent = B;
+          if (B !== null) C.left.parent = B;
         }
         if (C.right) {
           C.right.parent = A;
@@ -10806,7 +10812,7 @@ var dataStructureTyped = (() => {
     _balanceRR(A) {
       const parentOfA = A.parent;
       const B = A.right;
-      A.parent = B;
+      if (B !== null) A.parent = B;
       if (B) {
         if (B.left) {
           B.left.parent = A;
@@ -10845,14 +10851,14 @@ var dataStructureTyped = (() => {
       if (B) {
         C = B.left;
       }
-      A.parent = C;
-      if (B) B.parent = C;
+      if (C !== null) A.parent = C;
+      if (B && C !== null) B.parent = C;
       if (C) {
         if (C.left) {
           C.left.parent = A;
         }
         if (C.right) {
-          C.right.parent = B;
+          if (B !== null) C.right.parent = B;
         }
         C.parent = parentOfA;
       }
@@ -10947,23 +10953,8 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value, color = "BLACK") {
       super(key, value);
-      __publicField(this, "_color");
       this._color = color;
     }
-    /**
-     * The function returns the color value of a variable.
-     * @returns The color value stored in the private variable `_color`.
-     */
-    get color() {
-      return this._color;
-    }
-    /**
-     * The function sets the color property to the specified value.
-     * @param {RBTNColor} value - The value parameter is of type RBTNColor.
-     */
-    set color(value) {
-      this._color = value;
-    }
   };
   var RedBlackTree = class _RedBlackTree extends BST {
     /**
@@ -10972,7 +10963,7 @@ var dataStructureTyped = (() => {
      * iterable object that can contain either keys, nodes, entries, or raw elements. It is used to
      * initialize the RBTree with the provided elements.
      * @param [options] - The `options` parameter is an optional object that can be passed to the
-     * constructor. It is of type `RBTreeOptions<K, V, R>`. This object can contain various options for
+     * constructor. It is of type `RedBlackTreeOptions<K, V, R>`. This object can contain various options for
      * configuring the behavior of the Red-Black Tree. The specific properties and their meanings would
      * depend on the implementation
      */
@@ -11018,7 +11009,7 @@ var dataStructureTyped = (() => {
       return new _RedBlackTree([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        extractComparable: this._extractComparable,
+        specifyComparable: this._specifyComparable,
         toEntryFn: this._toEntryFn
       }, options));
     }
@@ -11035,41 +11026,6 @@ var dataStructureTyped = (() => {
     isNode(keyNodeEntryOrRaw) {
       return keyNodeEntryOrRaw instanceof RedBlackTreeNode;
     }
-    // /**
-    //  * Time Complexity: O(1)
-    //  * Space Complexity: O(1)
-    //  */
-    //
-    // /**
-    //  * Time Complexity: O(1)
-    //  * Space Complexity: O(1)
-    //  *
-    //  * The function `keyValueNodeEntryRawToNodeAndValue` takes a key, value, or entry and returns a node if it is
-    //  * valid, otherwise it returns undefined.
-    //  * @param {BTNRep<K, V, NODE>} keyNodeEntryOrRaw - The key, value, or entry to convert.
-    //  * @param {V} [value] - The value associated with the key (if `keyNodeEntryOrRaw` is a key).
-    //  * @returns {NODE | undefined} - The corresponding Red-Black Tree node, or `undefined` if conversion fails.
-    //  */
-    // override keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): NODE | undefined {
-    //
-    //   if (keyNodeEntryOrRaw === null || keyNodeEntryOrRaw === undefined) return;
-    //   if (this.isNode(keyNodeEntryOrRaw)) return keyNodeEntryOrRaw;
-    //
-    //   if (this._toEntryFn) {
-    //     const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw as R);
-    //     if (this.isKey(key)) return this.createNode(key, value ?? entryValue, 'RED');
-    //   }
-    //
-    //   if (this.isEntry(keyNodeEntryOrRaw)) {
-    //     const [key, value] = keyNodeEntryOrRaw;
-    //     if (key === undefined || key === null) return;
-    //     else return  this.createNode(key, value, 'RED');
-    //   }
-    //
-    //   if (this.isKey(keyNodeEntryOrRaw)) return this.createNode(keyNodeEntryOrRaw, value, 'RED');
-    //
-    //   return ;
-    // }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11142,8 +11098,10 @@ var dataStructureTyped = (() => {
       let originalColor = nodeToDelete.color;
       let replacementNode;
       if (!this.isRealNode(nodeToDelete.left)) {
-        replacementNode = nodeToDelete.right;
-        this._transplant(nodeToDelete, nodeToDelete.right);
+        if (nodeToDelete.right !== null) {
+          replacementNode = nodeToDelete.right;
+          this._transplant(nodeToDelete, nodeToDelete.right);
+        }
       } else if (!this.isRealNode(nodeToDelete.right)) {
         replacementNode = nodeToDelete.left;
         this._transplant(nodeToDelete, nodeToDelete.left);
@@ -11151,14 +11109,16 @@ var dataStructureTyped = (() => {
         const successor = this.getLeftMost((node) => node, nodeToDelete.right);
         if (successor) {
           originalColor = successor.color;
-          replacementNode = successor.right;
+          if (successor.right !== null) replacementNode = successor.right;
           if (successor.parent === nodeToDelete) {
             if (this.isRealNode(replacementNode)) {
               replacementNode.parent = successor;
             }
           } else {
-            this._transplant(successor, successor.right);
-            successor.right = nodeToDelete.right;
+            if (successor.right !== null) {
+              this._transplant(successor, successor.right);
+              successor.right = nodeToDelete.right;
+            }
             if (this.isRealNode(successor.right)) {
               successor.right.parent = successor;
             }
@@ -11240,7 +11200,7 @@ var dataStructureTyped = (() => {
       node.parent = parent;
       if (!parent) {
         this._setRoot(node);
-      } else if (node.key < parent.key) {
+      } else if (this._compare(node.key, parent.key) < 0) {
         parent.left = node;
       } else {
         parent.right = node;
@@ -11281,7 +11241,7 @@ var dataStructureTyped = (() => {
      * structure. It can either be a valid node or `undefined`.
      */
     _insertFixup(z) {
-      var _a, _b, _c, _d;
+      var _a, _b, _c, _d, _e;
       while (((_a = z == null ? void 0 : z.parent) == null ? void 0 : _a.color) === "RED") {
         if (z.parent === ((_b = z.parent.parent) == null ? void 0 : _b.left)) {
           const y = z.parent.parent.right;
@@ -11302,7 +11262,7 @@ var dataStructureTyped = (() => {
             }
           }
         } else {
-          const y = (_d = (_c = z == null ? void 0 : z.parent) == null ? void 0 : _c.parent) == null ? void 0 : _d.left;
+          const y = (_e = (_d = (_c = z == null ? void 0 : z.parent) == null ? void 0 : _c.parent) == null ? void 0 : _d.left) != null ? _e : void 0;
           if ((y == null ? void 0 : y.color) === "RED") {
             z.parent.color = "BLACK";
             y.color = "BLACK";
@@ -11447,6 +11407,34 @@ var dataStructureTyped = (() => {
       x.right = y;
       y.parent = x;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `map` function in TypeScript overrides the default behavior to create a new Red-Black Tree by
+     * applying a callback to each entry in the original tree.
+     * @param callback - A function that will be called for each entry in the tree, with parameters
+     * representing the key, value, index, and the tree itself. It should return an entry for the new
+     * tree.
+     * @param [options] - The `options` parameter in the `map` method is of type `RedBlackTreeOptions<MK, MV,
+     * MR>`. This parameter allows you to specify additional options or configurations for the Red-Black
+     * Tree that will be created during the mapping process. These options could include things like
+     * custom comparators
+     * @param {any} [thisArg] - The `thisArg` parameter in the `override map` function is used to specify
+     * the value of `this` when executing the `callback` function. It allows you to set the context
+     * (value of `this`) for the callback function. This can be useful when you want to access properties
+     * or
+     * @returns A new Red-Black Tree is being returned, where each entry has been transformed using the
+     * provided callback function.
+     */
+    map(callback, options, thisArg) {
+      const newTree = new _RedBlackTree([], options);
+      let index = 0;
+      for (const [key, value] of this) {
+        newTree.add(callback.call(thisArg, key, value, index++, this));
+      }
+      return newTree;
+    }
   };
 
   // src/data-structures/binary-tree/avl-tree-multi-map.ts
@@ -11463,24 +11451,8 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value, count = 1) {
       super(key, value);
-      __publicField(this, "_count", 1);
       this.count = count;
     }
-    /**
-     * The function returns the value of the protected variable _count.
-     * @returns The count property of the object, which is of type number.
-     */
-    get count() {
-      return this._count;
-    }
-    /**
-     * The above function sets the value of the count property.
-     * @param {number} value - The value parameter is of type number, which means it can accept any
-     * numeric value.
-     */
-    set count(value) {
-      this._count = value;
-    }
   };
   var AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
     /**
@@ -11542,7 +11514,7 @@ var dataStructureTyped = (() => {
       return new _AVLTreeMultiMap([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        extractComparable: this._extractComparable,
+        specifyComparable: this._specifyComparable,
         toEntryFn: this._toEntryFn,
         isReverse: this._isReverse
       }, options));
@@ -11557,35 +11529,6 @@ var dataStructureTyped = (() => {
     isNode(keyNodeEntryOrRaw) {
       return keyNodeEntryOrRaw instanceof AVLTreeMultiMapNode;
     }
-    /**
-     * The function `keyValueNodeEntryRawToNodeAndValue` converts a key, value, entry, or raw element into
-     * a node object.
-     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
-     * `keyNodeEntryOrRaw` parameter can be of type `R` or `BTNRep<K, V, NODE>`.
-     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
-     * `override` function. It represents the value associated with the key in the data structure. If no
-     * value is provided, it will default to `undefined`.
-     * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
-     * times the key-value pair should be added to the data structure. If not provided, it defaults to 1.
-     * @returns either a NODE object or undefined.
-     */
-    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
-      if (keyNodeEntryOrRaw === void 0 || keyNodeEntryOrRaw === null) return [void 0, void 0];
-      if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
-      if (this.isEntry(keyNodeEntryOrRaw)) {
-        const [key, entryValue] = keyNodeEntryOrRaw;
-        if (key === void 0 || key === null) return [void 0, void 0];
-        const finalValue = value != null ? value : entryValue;
-        return [this.createNode(key, finalValue, count), finalValue];
-      }
-      if (this.isRaw(keyNodeEntryOrRaw)) {
-        const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
-        const finalValue = value != null ? value : entryValue;
-        if (this.isKey(key)) return [this.createNode(key, finalValue, count), finalValue];
-      }
-      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value, count), value];
-      return [void 0, void 0];
-    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -11646,7 +11589,7 @@ var dataStructureTyped = (() => {
       } else {
         if (!curr.left) {
           if (!parent) {
-            if (curr.right !== void 0) this._setRoot(curr.right);
+            if (curr.right !== void 0 && curr.right !== null) this._setRoot(curr.right);
           } else {
             const { familyPosition: fp } = curr;
             if (fp === "LEFT" || fp === "ROOT_LEFT") {
@@ -11752,6 +11695,61 @@ var dataStructureTyped = (() => {
       if (this._isMapMode) cloned._store = this._store;
       return cloned;
     }
+    /**
+     * The `map` function in TypeScript overrides the default behavior to create a new AVLTreeMultiMap
+     * with modified entries based on a provided callback.
+     * @param callback - The `callback` parameter is a function that will be called for each entry in the
+     * AVLTreeMultiMap. It takes four arguments:
+     * @param [options] - The `options` parameter in the `override map` function is of type
+     * `AVLTreeMultiMapOptions<MK, MV, MR>`. This parameter allows you to provide additional
+     * configuration options when creating a new `AVLTreeMultiMap` instance within the `map` function.
+     * These options
+     * @param {any} [thisArg] - The `thisArg` parameter in the `override map` function is used to specify
+     * the value of `this` when executing the `callback` function. It allows you to set the context
+     * (value of `this`) for the callback function. This can be useful when you want to access properties
+     * or
+     * @returns The `map` method is returning a new `AVLTreeMultiMap` instance with the entries
+     * transformed by the provided `callback` function. Each entry in the original tree is passed to the
+     * `callback` function along with the index and the original tree itself. The transformed entries are
+     * then added to the new `AVLTreeMultiMap` instance, which is returned at the end.
+     */
+    map(callback, options, thisArg) {
+      const newTree = new _AVLTreeMultiMap([], options);
+      let index = 0;
+      for (const [key, value] of this) {
+        newTree.add(callback.call(thisArg, key, value, index++, this));
+      }
+      return newTree;
+    }
+    /**
+     * The function `keyValueNodeEntryRawToNodeAndValue` converts a key, value, entry, or raw element into
+     * a node object.
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
+     * `keyNodeEntryOrRaw` parameter can be of type `R` or `BTNRep<K, V, NODE>`.
+     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+     * `override` function. It represents the value associated with the key in the data structure. If no
+     * value is provided, it will default to `undefined`.
+     * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
+     * times the key-value pair should be added to the data structure. If not provided, it defaults to 1.
+     * @returns either a NODE object or undefined.
+     */
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
+      if (keyNodeEntryOrRaw === void 0 || keyNodeEntryOrRaw === null) return [void 0, void 0];
+      if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
+      if (this.isEntry(keyNodeEntryOrRaw)) {
+        const [key, entryValue] = keyNodeEntryOrRaw;
+        if (key === void 0 || key === null) return [void 0, void 0];
+        const finalValue = value != null ? value : entryValue;
+        return [this.createNode(key, finalValue, count), finalValue];
+      }
+      if (this.isRaw(keyNodeEntryOrRaw)) {
+        const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
+        const finalValue = value != null ? value : entryValue;
+        if (this.isKey(key)) return [this.createNode(key, finalValue, count), finalValue];
+      }
+      if (this.isKey(keyNodeEntryOrRaw)) return [this.createNode(keyNodeEntryOrRaw, value, count), value];
+      return [void 0, void 0];
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -11819,24 +11817,8 @@ var dataStructureTyped = (() => {
      */
     constructor(key, value, count = 1, color = "BLACK") {
       super(key, value, color);
-      __publicField(this, "_count", 1);
       this.count = count;
     }
-    /**
-     * The function returns the value of the private variable _count.
-     * @returns The count property of the object, which is of type number.
-     */
-    get count() {
-      return this._count;
-    }
-    /**
-     * The above function sets the value of the count property.
-     * @param {number} value - The value parameter is of type number, which means it can accept any
-     * numeric value.
-     */
-    set count(value) {
-      this._count = value;
-    }
   };
   var TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
     /**
@@ -11902,7 +11884,7 @@ var dataStructureTyped = (() => {
       return new _TreeMultiMap([], __spreadValues({
         iterationType: this.iterationType,
         isMapMode: this._isMapMode,
-        extractComparable: this._extractComparable,
+        specifyComparable: this._specifyComparable,
         toEntryFn: this._toEntryFn
       }, options));
     }
@@ -11999,10 +11981,12 @@ var dataStructureTyped = (() => {
       let originalColor = nodeToDelete.color;
       let replacementNode;
       if (!this.isRealNode(nodeToDelete.left)) {
-        replacementNode = nodeToDelete.right;
+        if (nodeToDelete.right !== null) replacementNode = nodeToDelete.right;
         if (ignoreCount || nodeToDelete.count <= 1) {
-          this._transplant(nodeToDelete, nodeToDelete.right);
-          this._count -= nodeToDelete.count;
+          if (nodeToDelete.right !== null) {
+            this._transplant(nodeToDelete, nodeToDelete.right);
+            this._count -= nodeToDelete.count;
+          }
         } else {
           nodeToDelete.count--;
           this._count--;
@@ -12024,15 +12008,17 @@ var dataStructureTyped = (() => {
         const successor = this.getLeftMost((node) => node, nodeToDelete.right);
         if (successor) {
           originalColor = successor.color;
-          replacementNode = successor.right;
+          if (successor.right !== null) replacementNode = successor.right;
           if (successor.parent === nodeToDelete) {
             if (this.isRealNode(replacementNode)) {
               replacementNode.parent = successor;
             }
           } else {
             if (ignoreCount || nodeToDelete.count <= 1) {
-              this._transplant(successor, successor.right);
-              this._count -= nodeToDelete.count;
+              if (successor.right !== null) {
+                this._transplant(successor, successor.right);
+                this._count -= nodeToDelete.count;
+              }
             } else {
               nodeToDelete.count--;
               this._count--;
@@ -12189,6 +12175,29 @@ var dataStructureTyped = (() => {
       newNode.count = oldNode.count + newNode.count;
       return super._replaceNode(oldNode, newNode);
     }
+    /**
+     * The `map` function in TypeScript overrides the default behavior to create a new TreeMultiMap with
+     * modified entries based on a provided callback.
+     * @param callback - The `callback` parameter is a function that will be called for each entry in the
+     * map. It takes four arguments:
+     * @param [options] - The `options` parameter in the `override map` function is of type
+     * `TreeMultiMapOptions<MK, MV, MR>`. This parameter allows you to provide additional configuration
+     * options when creating a new `TreeMultiMap` instance within the `map` function. These options could
+     * include things like
+     * @param {any} [thisArg] - The `thisArg` parameter in the `override map` function is used to specify
+     * the value of `this` when executing the `callback` function. It allows you to set the context
+     * (value of `this`) for the callback function when it is called within the `map` function. This
+     * @returns A new TreeMultiMap instance is being returned, which is populated with entries generated
+     * by the provided callback function.
+     */
+    map(callback, options, thisArg) {
+      const newTree = new _TreeMultiMap([], options);
+      let index = 0;
+      for (const [key, value] of this) {
+        newTree.add(callback.call(thisArg, key, value, index++, this));
+      }
+      return newTree;
+    }
   };
 
   // src/data-structures/priority-queue/priority-queue.ts