data-structure-typed 1.52.8 → 1.53.0

package/dist/mjs/data-structures/binary-tree/avl-tree-multi-map.js

@@ -37,16 +37,16 @@ export class AVLTreeMultiMapNode extends AVLTreeNode {
 export class AVLTreeMultiMap extends AVLTree {
     /**
      * The constructor initializes a new AVLTreeMultiMap object with optional initial elements.
-     * @param keysOrNodesOrEntriesOrRaws - The `keysOrNodesOrEntriesOrRaws` parameter is an
+     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter is an
      * iterable object that can contain either keys, nodes, entries, or raw elements.
      * @param [options] - The `options` parameter is an optional object that can be used to customize the
      * behavior of the AVLTreeMultiMap. It can include properties such as `compareKeys` and
      * `compareValues` functions to define custom comparison logic for keys and values, respectively.
      */
-    constructor(keysOrNodesOrEntriesOrRaws = [], options) {
+    constructor(keysNodesEntriesOrRaws = [], options) {
         super([], options);
-        if (keysOrNodesOrEntriesOrRaws)
-            this.addMany(keysOrNodesOrEntriesOrRaws);
+        if (keysNodesEntriesOrRaws)
+            this.addMany(keysNodesEntriesOrRaws);
     }
     _count = 0;
     /**
@@ -94,6 +94,7 @@ export class AVLTreeMultiMap extends AVLTree {
     createTree(options) {
         return new AVLTreeMultiMap([], {
             iterationType: this.iterationType,
+            isMapMode: this._isMapMode,
             comparator: this._comparator,
             toEntryFn: this._toEntryFn,
             ...options
@@ -101,19 +102,19 @@ export class AVLTreeMultiMap extends AVLTree {
     }
     /**
      * The function checks if the input is an instance of AVLTreeMultiMapNode.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The parameter
-     * `keyOrNodeOrEntryOrRaw` can be of type `R` or `BTNKeyOrNodeOrEntry<K, V, NODE>`.
-     * @returns a boolean value indicating whether the input parameter `keyOrNodeOrEntryOrRaw` is
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
+     * `keyNodeEntryOrRaw` can be of type `R` or `BTNRep<K, V, NODE>`.
+     * @returns a boolean value indicating whether the input parameter `keyNodeEntryOrRaw` is
      * an instance of the `AVLTreeMultiMapNode` class.
      */
-    isNode(keyOrNodeOrEntryOrRaw) {
-        return keyOrNodeOrEntryOrRaw instanceof AVLTreeMultiMapNode;
+    isNode(keyNodeEntryOrRaw) {
+        return keyNodeEntryOrRaw instanceof AVLTreeMultiMapNode;
     }
     /**
-     * The function `keyValueOrEntryOrRawElementToNode` converts a key, value, entry, or raw element into
+     * The function `keyValueNodeEntryRawToNodeAndValue` converts a key, value, entry, or raw element into
      * a node object.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The
-     * `keyOrNodeOrEntryOrRaw` parameter can be of type `R` or `BTNKeyOrNodeOrEntry<K, V, NODE>`.
+     * @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`.
@@ -121,26 +122,30 @@ export class AVLTreeMultiMap extends AVLTree {
      * 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.
      */
-    keyValueOrEntryOrRawElementToNode(keyOrNodeOrEntryOrRaw, value, count = 1) {
-        if (keyOrNodeOrEntryOrRaw === undefined || keyOrNodeOrEntryOrRaw === null)
-            return;
-        if (this.isNode(keyOrNodeOrEntryOrRaw))
-            return keyOrNodeOrEntryOrRaw;
-        if (this.isEntry(keyOrNodeOrEntryOrRaw)) {
-            const [key, entryValue] = keyOrNodeOrEntryOrRaw;
+    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count = 1) {
+        if (keyNodeEntryOrRaw === undefined || keyNodeEntryOrRaw === null)
+            return [undefined, undefined];
+        if (this.isNode(keyNodeEntryOrRaw))
+            return [keyNodeEntryOrRaw, value];
+        if (this.isEntry(keyNodeEntryOrRaw)) {
+            const [key, entryValue] = keyNodeEntryOrRaw;
             if (key === undefined || key === null)
-                return;
-            if (this.isKey(key))
-                return this.createNode(key, value ?? entryValue, count);
+                return [undefined, undefined];
+            const finalValue = value ?? entryValue;
+            return [this.createNode(key, finalValue, count), finalValue];
         }
-        if (this._toEntryFn) {
-            const [key, entryValue] = this._toEntryFn(keyOrNodeOrEntryOrRaw);
-            if (this.isKey(key))
-                return this.createNode(key, value ?? entryValue, count);
+        if (this.isKey(keyNodeEntryOrRaw))
+            return [this.createNode(keyNodeEntryOrRaw, value, count), value];
+        if (this.isRaw(keyNodeEntryOrRaw)) {
+            if (this._toEntryFn) {
+                const [key, entryValue] = this._toEntryFn(keyNodeEntryOrRaw);
+                const finalValue = value ?? entryValue;
+                if (this.isKey(key))
+                    return [this.createNode(key, finalValue, count), finalValue];
+            }
+            return [undefined, undefined];
         }
-        if (this.isKey(keyOrNodeOrEntryOrRaw))
-            return this.createNode(keyOrNodeOrEntryOrRaw, value, count);
-        return;
+        return [undefined, undefined];
     }
     /**
      * Time Complexity: O(log n)
@@ -148,9 +153,9 @@ export class AVLTreeMultiMap extends AVLTree {
      *
      * The function overrides the add method of a TypeScript class to add a new node to a data structure
      * and update the count.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The
-     * `keyOrNodeOrEntryOrRaw` parameter can accept a value of type `R`, which can be any type. It
-     * can also accept a value of type `BTNKeyOrNodeOrEntry<K, V, NODE>`, which represents a key, node,
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The
+     * `keyNodeEntryOrRaw` parameter can accept a value of type `R`, which can be any type. It
+     * can also accept a value of type `BTNRep<K, V, NODE>`, which represents a key, node,
      * entry, or raw element
      * @param {V} [value] - The `value` parameter represents the value associated with the key in the
      * data structure. It is an optional parameter, so it can be omitted if not needed.
@@ -159,12 +164,12 @@ export class AVLTreeMultiMap extends AVLTree {
      * be added once. However, you can specify a different value for `count` if you want to add
      * @returns a boolean value.
      */
-    add(keyOrNodeOrEntryOrRaw, value, count = 1) {
-        const newNode = this.keyValueOrEntryOrRawElementToNode(keyOrNodeOrEntryOrRaw, value, count);
+    add(keyNodeEntryOrRaw, value, count = 1) {
+        const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
         if (newNode === undefined)
             return false;
         const orgNodeCount = newNode?.count || 0;
-        const inserted = super.add(newNode);
+        const inserted = super.add(newNode, newValue);
         if (inserted) {
             this._count += orgNodeCount;
         }
@@ -176,9 +181,9 @@ export class AVLTreeMultiMap extends AVLTree {
      *
      * The function overrides the delete method in a binary tree data structure, handling deletion of
      * nodes and maintaining balance in the tree.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>} predicate - The `predicate`
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `predicate`
      * parameter in the `delete` method is used to specify the condition for deleting a node from the
-     * binary tree. It can be a key, node, entry, or a custom predicate function that determines which
+     * binary tree. It can be a key, node, or entry that determines which
      * node(s) should be deleted.
      * @param [ignoreCount=false] - The `ignoreCount` parameter in the `override delete` method is a
      * boolean flag that determines whether to ignore the count of the node being deleted. If
@@ -189,11 +194,11 @@ export class AVLTreeMultiMap extends AVLTree {
      * method returns an array of `BinaryTreeDeleteResult` objects, each containing information about the
      * deleted node and whether balancing is needed in the tree.
      */
-    delete(predicate, ignoreCount = false) {
+    delete(keyNodeEntryOrRaw, ignoreCount = false) {
         const deletedResult = [];
         if (!this.root)
             return deletedResult;
-        const curr = this.getNode(predicate) ?? undefined;
+        const curr = this.getNode(keyNodeEntryOrRaw) ?? undefined;
         if (!curr)
             return deletedResult;
         const parent = curr?.parent ? curr.parent : undefined;
@@ -280,7 +285,10 @@ export class AVLTreeMultiMap extends AVLTree {
                     return;
                 const m = l + Math.floor((r - l) / 2);
                 const midNode = sorted[m];
-                this.add(midNode.key, midNode.value, midNode.count);
+                if (this._isMapMode)
+                    this.add(midNode.key, undefined, midNode.count);
+                else
+                    this.add(midNode.key, midNode.value, midNode.count);
                 buildBalanceBST(l, m - 1);
                 buildBalanceBST(m + 1, r);
             };
@@ -296,7 +304,10 @@ export class AVLTreeMultiMap extends AVLTree {
                     if (l <= r) {
                         const m = l + Math.floor((r - l) / 2);
                         const midNode = sorted[m];
-                        this.add(midNode.key, midNode.value, midNode.count);
+                        if (this._isMapMode)
+                            this.add(midNode.key, undefined, midNode.count);
+                        else
+                            this.add(midNode.key, midNode.value, midNode.count);
                         stack.push([m + 1, r]);
                         stack.push([l, m - 1]);
                     }
@@ -314,7 +325,12 @@ export class AVLTreeMultiMap extends AVLTree {
      */
     clone() {
         const cloned = this.createTree();
-        this.bfs(node => cloned.add(node.key, node.value, node.count));
+        if (this._isMapMode)
+            this.bfs(node => cloned.add(node.key, undefined, node.count));
+        else
+            this.bfs(node => cloned.add(node.key, node.value, node.count));
+        if (this._isMapMode)
+            cloned._store = this._store;
         return cloned;
     }
     /**
@@ -323,9 +339,9 @@ export class AVLTreeMultiMap extends AVLTree {
      *
      * The `_swapProperties` function swaps the properties (key, value, count, height) between two nodes
      * in a binary search tree.
-     * @param {R | BSTNKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents the source node
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents the source node
      * that will be swapped with the `destNode`.
-     * @param {R | BSTNKeyOrNode<K, NODE>} destNode - The `destNode` parameter represents the destination
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} destNode - The `destNode` parameter represents the destination
      * node where the properties will be swapped with the source node.
      * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
      * If either `srcNode` or `destNode` is undefined, it returns `undefined`.
@@ -339,11 +355,13 @@ export class AVLTreeMultiMap extends AVLTree {
             if (tempNode) {
                 tempNode.height = height;
                 destNode.key = srcNode.key;
-                destNode.value = srcNode.value;
+                if (!this._isMapMode)
+                    destNode.value = srcNode.value;
                 destNode.count = srcNode.count;
                 destNode.height = srcNode.height;
                 srcNode.key = tempNode.key;
-                srcNode.value = tempNode.value;
+                if (!this._isMapMode)
+                    srcNode.value = tempNode.value;
                 srcNode.count = tempNode.count;
                 srcNode.height = tempNode.height;
             }

package/dist/mjs/data-structures/binary-tree/avl-tree.d.ts

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNKeyOrNode, BTNKeyOrNodeOrEntry, BTNPredicate, BTNEntry } from '../../types';
+import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNOptKeyOrNode, BTNRep } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, NODE> {
     /**
@@ -40,11 +40,11 @@ export declare class AVLTreeNode<K = any, V = any, NODE extends AVLTreeNode<K, V
  * 6. Complex Insertions and Deletions: Due to rebalancing, these operations are more complex than in a regular BST.
  * 7. Path Length: The path length from the root to any leaf is longer compared to an unbalanced BST, but shorter than a linear chain of nodes.
  */
-export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, R, NODE, TREE> = AVLTree<K, V, R, NODE, AVLTreeNested<K, V, R, NODE>>> extends BST<K, V, R, NODE, TREE> implements IBinaryTree<K, V, R, NODE, TREE> {
+export declare class AVLTree<K = any, V = any, R = object, NODE extends AVLTreeNode<K, V, NODE> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, R, NODE, TREE> = AVLTree<K, V, R, NODE, AVLTreeNested<K, V, R, NODE>>> extends BST<K, V, R, NODE, TREE> implements IBinaryTree<K, V, R, NODE, TREE> {
     /**
      * This is a constructor function for an AVLTree class that initializes the tree with keys, nodes,
      * entries, or raw elements.
-     * @param keysOrNodesOrEntriesOrRaws - The `keysOrNodesOrEntriesOrRaws` parameter is an
+     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter is an
      * iterable object that can contain either keys, nodes, entries, or raw elements. These elements will
      * be used to initialize the AVLTree.
      * @param [options] - The `options` parameter is an optional object that can be used to customize the
@@ -52,7 +52,7 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      * keys), `allowDuplicates` (a boolean indicating whether duplicate keys are allowed), and
      * `nodeBuilder` (
      */
-    constructor(keysOrNodesOrEntriesOrRaws?: Iterable<R | BTNKeyOrNodeOrEntry<K, V, NODE>>, options?: AVLTreeOptions<K, V, R>);
+    constructor(keysNodesEntriesOrRaws?: Iterable<R | BTNRep<K, V, NODE>>, options?: AVLTreeOptions<K, V, R>);
     /**
      * The function creates a new AVL tree node with the given key and value.
      * @param {K} key - The key parameter is of type K, which represents the key of the node being
@@ -73,54 +73,54 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
     createTree(options?: AVLTreeOptions<K, V, R>): TREE;
     /**
      * The function checks if the input is an instance of AVLTreeNode.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The parameter
-     * `keyOrNodeOrEntryOrRaw` can be of type `R` or `BTNKeyOrNodeOrEntry<K, V, NODE>`.
-     * @returns a boolean value indicating whether the input parameter `keyOrNodeOrEntryOrRaw` is
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
+     * `keyNodeEntryOrRaw` can be of type `R` or `BTNRep<K, V, NODE>`.
+     * @returns a boolean value indicating whether the input parameter `keyNodeEntryOrRaw` is
      * an instance of the `AVLTreeNode` class.
      */
-    isNode(keyOrNodeOrEntryOrRaw: BTNKeyOrNodeOrEntry<K, V, NODE> | R): keyOrNodeOrEntryOrRaw is NODE;
+    isNode(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): keyNodeEntryOrRaw is NODE;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
      * The function overrides the add method of a class and inserts a key-value pair into a data
      * structure, then balances the path.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The parameter
-     * `keyOrNodeOrEntryOrRaw` can accept values of type `R`, `BTNKeyOrNodeOrEntry<K, V, NODE>`, or
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
+     * `keyNodeEntryOrRaw` can accept values of type `R`, `BTNRep<K, V, NODE>`, or
      * `RawElement`.
      * @param {V} [value] - The `value` parameter is an optional value that you want to associate with
      * the key or node being added to the data structure.
      * @returns The method is returning a boolean value.
      */
-    add(keyOrNodeOrEntryOrRaw: BTNKeyOrNodeOrEntry<K, V, NODE> | R, value?: V): boolean;
+    add(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R, value?: V): boolean;
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
      * The function overrides the delete method in a TypeScript class, performs deletion, and then
      * balances the tree if necessary.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>} predicate - The `predicate`
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `keyNodeEntryOrRaw`
      * parameter in the `override delete` method can be one of the following types:
      * @returns The `delete` method is being overridden in this code snippet. It first calls the `delete`
      * method from the superclass (presumably a parent class) with the provided `predicate`, which could
      * be a key, node, entry, or a custom predicate. The result of this deletion operation is stored in
      * `deletedResults`, which is an array of `BinaryTreeDeleteResult` objects.
      */
-    delete(predicate: BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>): BinaryTreeDeleteResult<NODE>[];
+    delete(keyNodeEntryOrRaw: BTNRep<K, V, NODE> | R): BinaryTreeDeleteResult<NODE>[];
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
      * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a
      * binary search tree.
-     * @param {R | BSTNKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents either a node
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents either a node
      * object (`NODE`) or a key-value pair (`R`) that is being swapped with another node.
-     * @param {R | BSTNKeyOrNode<K, NODE>} destNode - The `destNode` parameter is either an instance of
-     * `R` or an instance of `BSTNKeyOrNode<K, NODE>`.
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} destNode - The `destNode` parameter is either an instance of
+     * `R` or an instance of `BSTNOptKeyOrNode<K, NODE>`.
      * @returns The method is returning the `destNodeEnsured` object if both `srcNodeEnsured` and
      * `destNodeEnsured` are truthy. Otherwise, it returns `undefined`.
      */
-    protected _swapProperties(srcNode: R | BSTNKeyOrNode<K, NODE>, destNode: R | BSTNKeyOrNode<K, NODE>): NODE | undefined;
+    protected _swapProperties(srcNode: R | BSTNOptKeyOrNode<K, NODE>, destNode: R | BSTNOptKeyOrNode<K, NODE>): NODE | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -179,10 +179,10 @@ export declare class AVLTree<K = any, V = any, R = BTNEntry<K, V>, NODE extends
      *
      * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
      * to restore balance in an AVL tree after inserting a node.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} node - The `node` parameter can be of type `R` or
-     * `BTNKeyOrNodeOrEntry<K, V, NODE>`.
+     * @param {BTNRep<K, V, NODE> | R} node - The `node` parameter can be of type `R` or
+     * `BTNRep<K, V, NODE>`.
      */
-    protected _balancePath(node: BTNKeyOrNodeOrEntry<K, V, NODE> | R): void;
+    protected _balancePath(node: BTNRep<K, V, NODE> | R): void;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/mjs/data-structures/binary-tree/avl-tree.js

@@ -49,7 +49,7 @@ export class AVLTree extends BST {
     /**
      * This is a constructor function for an AVLTree class that initializes the tree with keys, nodes,
      * entries, or raw elements.
-     * @param keysOrNodesOrEntriesOrRaws - The `keysOrNodesOrEntriesOrRaws` parameter is an
+     * @param keysNodesEntriesOrRaws - The `keysNodesEntriesOrRaws` parameter is an
      * iterable object that can contain either keys, nodes, entries, or raw elements. These elements will
      * be used to initialize the AVLTree.
      * @param [options] - The `options` parameter is an optional object that can be used to customize the
@@ -57,10 +57,10 @@ export class AVLTree extends BST {
      * keys), `allowDuplicates` (a boolean indicating whether duplicate keys are allowed), and
      * `nodeBuilder` (
      */
-    constructor(keysOrNodesOrEntriesOrRaws = [], options) {
+    constructor(keysNodesEntriesOrRaws = [], options) {
         super([], options);
-        if (keysOrNodesOrEntriesOrRaws)
-            super.addMany(keysOrNodesOrEntriesOrRaws);
+        if (keysNodesEntriesOrRaws)
+            super.addMany(keysNodesEntriesOrRaws);
     }
     /**
      * The function creates a new AVL tree node with the given key and value.
@@ -84,6 +84,7 @@ export class AVLTree extends BST {
     createTree(options) {
         return new AVLTree([], {
             iterationType: this.iterationType,
+            isMapMode: this._isMapMode,
             comparator: this._comparator,
             toEntryFn: this._toEntryFn,
             ...options
@@ -91,13 +92,13 @@ export class AVLTree extends BST {
     }
     /**
      * The function checks if the input is an instance of AVLTreeNode.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The parameter
-     * `keyOrNodeOrEntryOrRaw` can be of type `R` or `BTNKeyOrNodeOrEntry<K, V, NODE>`.
-     * @returns a boolean value indicating whether the input parameter `keyOrNodeOrEntryOrRaw` is
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
+     * `keyNodeEntryOrRaw` can be of type `R` or `BTNRep<K, V, NODE>`.
+     * @returns a boolean value indicating whether the input parameter `keyNodeEntryOrRaw` is
      * an instance of the `AVLTreeNode` class.
      */
-    isNode(keyOrNodeOrEntryOrRaw) {
-        return keyOrNodeOrEntryOrRaw instanceof AVLTreeNode;
+    isNode(keyNodeEntryOrRaw) {
+        return keyNodeEntryOrRaw instanceof AVLTreeNode;
     }
     /**
      * Time Complexity: O(log n)
@@ -105,19 +106,19 @@ export class AVLTree extends BST {
      *
      * The function overrides the add method of a class and inserts a key-value pair into a data
      * structure, then balances the path.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} keyOrNodeOrEntryOrRaw - The parameter
-     * `keyOrNodeOrEntryOrRaw` can accept values of type `R`, `BTNKeyOrNodeOrEntry<K, V, NODE>`, or
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The parameter
+     * `keyNodeEntryOrRaw` can accept values of type `R`, `BTNRep<K, V, NODE>`, or
      * `RawElement`.
      * @param {V} [value] - The `value` parameter is an optional value that you want to associate with
      * the key or node being added to the data structure.
      * @returns The method is returning a boolean value.
      */
-    add(keyOrNodeOrEntryOrRaw, value) {
-        if (keyOrNodeOrEntryOrRaw === null)
+    add(keyNodeEntryOrRaw, value) {
+        if (keyNodeEntryOrRaw === null)
             return false;
-        const inserted = super.add(keyOrNodeOrEntryOrRaw, value);
+        const inserted = super.add(keyNodeEntryOrRaw, value);
         if (inserted)
-            this._balancePath(keyOrNodeOrEntryOrRaw);
+            this._balancePath(keyNodeEntryOrRaw);
         return inserted;
     }
     /**
@@ -126,15 +127,15 @@ export class AVLTree extends BST {
      *
      * The function overrides the delete method in a TypeScript class, performs deletion, and then
      * balances the tree if necessary.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R | BTNPredicate<NODE>} predicate - The `predicate`
+     * @param {BTNRep<K, V, NODE> | R} keyNodeEntryOrRaw - The `keyNodeEntryOrRaw`
      * parameter in the `override delete` method can be one of the following types:
      * @returns The `delete` method is being overridden in this code snippet. It first calls the `delete`
      * method from the superclass (presumably a parent class) with the provided `predicate`, which could
      * be a key, node, entry, or a custom predicate. The result of this deletion operation is stored in
      * `deletedResults`, which is an array of `BinaryTreeDeleteResult` objects.
      */
-    delete(predicate) {
-        const deletedResults = super.delete(predicate);
+    delete(keyNodeEntryOrRaw) {
+        const deletedResults = super.delete(keyNodeEntryOrRaw);
         for (const { needBalanced } of deletedResults) {
             if (needBalanced) {
                 this._balancePath(needBalanced);
@@ -148,10 +149,10 @@ export class AVLTree extends BST {
      *
      * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a
      * binary search tree.
-     * @param {R | BSTNKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents either a node
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} srcNode - The `srcNode` parameter represents either a node
      * object (`NODE`) or a key-value pair (`R`) that is being swapped with another node.
-     * @param {R | BSTNKeyOrNode<K, NODE>} destNode - The `destNode` parameter is either an instance of
-     * `R` or an instance of `BSTNKeyOrNode<K, NODE>`.
+     * @param {R | BSTNOptKeyOrNode<K, NODE>} destNode - The `destNode` parameter is either an instance of
+     * `R` or an instance of `BSTNOptKeyOrNode<K, NODE>`.
      * @returns The method is returning the `destNodeEnsured` object if both `srcNodeEnsured` and
      * `destNodeEnsured` are truthy. Otherwise, it returns `undefined`.
      */
@@ -164,10 +165,12 @@ export class AVLTree extends BST {
             if (tempNode) {
                 tempNode.height = height;
                 destNodeEnsured.key = srcNodeEnsured.key;
-                destNodeEnsured.value = srcNodeEnsured.value;
+                if (!this._isMapMode)
+                    destNodeEnsured.value = srcNodeEnsured.value;
                 destNodeEnsured.height = srcNodeEnsured.height;
                 srcNodeEnsured.key = tempNode.key;
-                srcNodeEnsured.value = tempNode.value;
+                if (!this._isMapMode)
+                    srcNodeEnsured.value = tempNode.value;
                 srcNodeEnsured.height = tempNode.height;
             }
             return destNodeEnsured;
@@ -404,8 +407,8 @@ export class AVLTree extends BST {
      *
      * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
      * to restore balance in an AVL tree after inserting a node.
-     * @param {BTNKeyOrNodeOrEntry<K, V, NODE> | R} node - The `node` parameter can be of type `R` or
-     * `BTNKeyOrNodeOrEntry<K, V, NODE>`.
+     * @param {BTNRep<K, V, NODE> | R} node - The `node` parameter can be of type `R` or
+     * `BTNRep<K, V, NODE>`.
      */
     _balancePath(node) {
         node = this.ensureNode(node);