data-structure-typed 1.53.7 → 1.53.8

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

@@ -771,6 +771,9 @@ var dataStructureTyped = (() => {
       return this._hashFn;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given element is an array with exactly two elements.
      * @param {any} rawElement - The `rawElement` parameter is of type `any`, which means it can be any
      * data type.
@@ -780,6 +783,9 @@ var dataStructureTyped = (() => {
       return Array.isArray(rawElement) && rawElement.length === 2;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if the size of an object is equal to zero and returns a boolean value.
      * @returns A boolean value indicating whether the size of the object is 0 or not.
      */
@@ -787,6 +793,9 @@ var dataStructureTyped = (() => {
       return this._size === 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The clear() function resets the state of an object by clearing its internal store, object map, and
      * size.
      */
@@ -796,6 +805,9 @@ var dataStructureTyped = (() => {
       this._size = 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `set` function adds a key-value pair to a map-like data structure, incrementing the size if
      * the key is not already present.
      * @param {K} key - The key parameter is the key used to identify the value in the data structure. It
@@ -820,6 +832,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
      * The function `setMany` takes an iterable collection of objects, maps each object to a key-value
      * pair using a mapping function, and sets each key-value pair in the current object.
      * @param entryOrRawElements - The `entryOrRawElements` parameter is an iterable collection of elements of a type
@@ -843,6 +858,9 @@ var dataStructureTyped = (() => {
       return results;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `get` function retrieves a value from a map based on a given key, either from an object map or
      * a string map.
      * @param {K} key - The `key` parameter is the key used to retrieve a value from the map. It can be
@@ -860,6 +878,9 @@ var dataStructureTyped = (() => {
       }
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `has` function checks if a given key exists in the `_objMap` or `_store` based on whether it
      * is an object key or not.
      * @param {K} key - The parameter "key" is of type K, which means it can be any type.
@@ -874,6 +895,9 @@ var dataStructureTyped = (() => {
       }
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `delete` function removes an element from a map-like data structure based on the provided key.
      * @param {K} key - The `key` parameter is the key of the element that you want to delete from the
      * data structure.
@@ -1195,6 +1219,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
      * The function `setMany` takes an iterable collection, converts each element into a key-value pair
      * using a provided function, and sets each key-value pair in the current object, returning an array
      * of booleans indicating the success of each set operation.
@@ -1219,6 +1246,9 @@ var dataStructureTyped = (() => {
       return results;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if a given key exists in a map, using different logic depending on whether the
      * key is a weak key or not.
      * @param {K} key - The `key` parameter is the key that is being checked for existence in the map.
@@ -1514,15 +1544,7 @@ var dataStructureTyped = (() => {
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_size", 0);
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else {
-            this.push(el);
-          }
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The `head` function returns the first node of a singly linked list.
@@ -1648,6 +1670,53 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `pushMany` iterates over elements and pushes them into a data structure, applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `pushMany` function can accept an iterable containing elements of type `E`, `R`,
+     * or `SinglyLinkedListNode<E>`.
+     * @returns The `pushMany` function returns an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.push(el));
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `unshiftMany` iterates over elements and adds them to a data structure, optionally
+     * converting them using a provided function.
+     * @param {Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `unshiftMany` function can accept an iterable containing elements of type `E`,
+     * `R`, or `SinglyLinkedListNode<E>`. The function iterates over each element in the iterable and
+     * performs an `unshift` operation on the linked list for each
+     * @returns The `unshiftMany` function is returning an array of boolean values, where each value
+     * represents the result of calling the `unshift` method on the current instance of the class.
+     */
+    unshiftMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.unshift(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -1819,6 +1888,9 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if the length of a data structure is equal to zero and returns a boolean value indicating
      * whether it is empty or not.
      * @returns A boolean value indicating whether the length of the object is equal to 0.
@@ -1827,6 +1899,9 @@ var dataStructureTyped = (() => {
       return this._size === 0;
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear() {
@@ -2235,13 +2310,7 @@ var dataStructureTyped = (() => {
       this._head = void 0;
       this._tail = void 0;
       this._size = 0;
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The `head` function returns the first node of a doubly linked list.
@@ -2389,6 +2458,55 @@ var dataStructureTyped = (() => {
       this._size++;
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `pushMany` iterates over elements and pushes them into a data structure, applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R> | Iterable<DoublyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `pushMany` function can accept an iterable containing elements of type `E`, `R`,
+     * or `DoublyLinkedListNode<E>`. The function iterates over each element in the iterable and pushes
+     * it onto the linked list. If a transformation function `to
+     * @returns The `pushMany` function is returning an array of boolean values (`ans`) which indicate
+     * the success or failure of pushing each element into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.push(el));
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The function `unshiftMany` iterates through a collection of elements and adds them to the
+     * beginning of a Doubly Linked List, returning an array of boolean values indicating the success of
+     * each insertion.
+     * @param {Iterable<E> | Iterable<R> | Iterable<DoublyLinkedListNode<E>>} elements - The `elements`
+     * parameter in the `unshiftMany` function can accept an iterable containing elements of type `E`,
+     * `R`, or `DoublyLinkedListNode<E>`. The function iterates over each element in the iterable and
+     * performs an `unshift` operation on the doubly linked list
+     * @returns The `unshiftMany` function returns an array of boolean values indicating the success of
+     * each unshift operation performed on the elements passed as input.
+     */
+    unshiftMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+          continue;
+        }
+        ans.push(this.unshift(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -2825,6 +2943,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
+     * The function `countOccurrences` iterates through a doubly linked list and counts the occurrences
+     * of a specified element or nodes that satisfy a given predicate.
+     * @param {E | DoublyLinkedListNode<E> | ((node: DoublyLinkedListNode<E>) => boolean)} elementOrNode
+     * - The `elementOrNode` parameter in the `countOccurrences` method can accept three types of values:
+     * @returns The `countOccurrences` method returns the number of occurrences of the specified element,
+     * node, or predicate function in the doubly linked list.
      */
     countOccurrences(elementOrNode) {
       const predicate = this._ensurePredicate(elementOrNode);
@@ -3144,15 +3268,7 @@ var dataStructureTyped = (() => {
     constructor(elements = [], options) {
       super(options);
       __publicField(this, "_elements", []);
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) {
-            this.push(this.toElementFn(el));
-          } else {
-            this.push(el);
-          }
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The elements function returns the elements of this set.
@@ -3168,10 +3284,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this.elements.length;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -3185,6 +3297,9 @@ var dataStructureTyped = (() => {
       return new _Stack(elements);
     }
     /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
      * The function checks if an array is empty and returns a boolean value.
      * @returns A boolean value indicating whether the `_elements` array is empty or not.
      */
@@ -3227,18 +3342,46 @@ var dataStructureTyped = (() => {
       return this.elements.pop();
     }
     /**
-     * The delete function removes an element from the stack.
-     * @param element: E Specify the element to be deleted
-     * @return A boolean value indicating whether the element was successfully deleted or not
+     * Time Complexity: O(k)
+     * Space Complexity: O(1)
+     *
+     * The function `pushMany` iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `pushMany` function
+     * is an iterable containing elements of type `E` or `R`. The function iterates over each element in
+     * the iterable and pushes it into the data structure. If a transformation function `toElementFn` is
+     * provided, it is used to
+     * @returns The `pushMany` function is returning an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
+        } else {
+          ans.push(this.push(el));
+        }
+      }
+      return ans;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The toArray function returns a copy of the elements in an array.
+     * @returns An array of type E.
      */
     delete(element) {
       const index = this.elements.indexOf(element);
       return this.deleteAt(index);
     }
     /**
-     * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
-     * @return A boolean value
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The toArray function returns a copy of the elements in an array.
+     * @returns An array of type E.
      */
     deleteAt(index) {
       const spliced = this.elements.splice(index, 1);
@@ -3351,12 +3494,7 @@ var dataStructureTyped = (() => {
         const { autoCompactRatio = 0.5 } = options;
         this._autoCompactRatio = autoCompactRatio;
       }
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) this.push(this.toElementFn(el));
-          else this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The elements function returns the elements of this set.
@@ -3441,6 +3579,25 @@ var dataStructureTyped = (() => {
       this.elements.push(element);
       return true;
     }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The `pushMany` function iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `pushMany` function
+     * is an iterable containing elements of type `E` or `R`.
+     * @returns The `pushMany` function is returning an array of boolean values indicating whether each
+     * element was successfully pushed into the data structure.
+     */
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) ans.push(this.push(this.toElementFn(el)));
+        else ans.push(this.push(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3457,6 +3614,9 @@ var dataStructureTyped = (() => {
       return first;
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The delete function removes an element from the list.
      * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
@@ -3466,6 +3626,9 @@ var dataStructureTyped = (() => {
       return this.deleteAt(index);
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The deleteAt function deletes the element at a given index.
      * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
@@ -3478,7 +3641,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * @param index
+     * The `at` function returns the element at a specified index adjusted by an offset, or `undefined`
+     * if the index is out of bounds.
+     * @param {number} index - The `index` parameter represents the position of the element you want to
+     * retrieve from the data structure.
+     * @returns The `at` method is returning the element at the specified index adjusted by the offset
+     * `_offset`.
      */
     at(index) {
       return this.elements[index + this._offset];
@@ -3514,6 +3682,9 @@ var dataStructureTyped = (() => {
       this._offset = 0;
     }
     /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
      * The `compact` function in TypeScript slices the elements array based on the offset and resets the
      * offset to zero.
      * @returns The `compact()` method is returning a boolean value of `true`.
@@ -3563,6 +3734,20 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
+     *
+     * The `map` function in TypeScript creates a new Queue by applying a callback function to each
+     * element in the original Queue.
+     * @param callback - The `callback` parameter is a function that will be applied to each element in
+     * the queue. It takes the current element, its index, and the queue itself as arguments, and returns
+     * a new element.
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that can be provided to
+     * convert a raw element of type `RM` to a new element of type `EM`. This function is used within the
+     * `map` method to transform each raw element before passing it to the `callback` function. If
+     * @param {any} [thisArg] - The `thisArg` parameter in the `map` function is used to specify the
+     * value of `this` when executing the `callback` function. It allows you to set the context (the
+     * value of `this`) within the callback function. If `thisArg` is provided, it will be
+     * @returns A new Queue object containing elements of type EM, which are the result of applying the
+     * callback function to each element in the original Queue object.
      */
     map(callback, toElementFn, thisArg) {
       const newDeque = new _Queue([], { toElementFn });
@@ -3643,13 +3828,7 @@ var dataStructureTyped = (() => {
       const needBucketNum = calcMinUnitsRequired(_size, this._bucketSize);
       this._bucketFirst = this._bucketLast = (this._bucketCount >> 1) - (needBucketNum >> 1);
       this._firstInBucket = this._lastInBucket = this._bucketSize - _size % this._bucketSize >> 1;
-      for (const el of elements) {
-        if (this.toElementFn) {
-          this.push(this.toElementFn(el));
-        } else {
-          this.push(el);
-        }
-      }
+      this.pushMany(elements);
     }
     /**
      * The bucketSize function returns the size of the bucket.
@@ -3787,6 +3966,32 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `shift()` function removes and returns the first element from a data structure, updating the
+     * internal state variables accordingly.
+     * @returns The element that is being removed from the beginning of the data structure is being
+     * returned.
+     */
+    shift() {
+      if (this._size === 0) return;
+      const element = this._buckets[this._bucketFirst][this._firstInBucket];
+      if (this._size !== 1) {
+        if (this._firstInBucket < this._bucketSize - 1) {
+          this._firstInBucket += 1;
+        } else if (this._bucketFirst < this._bucketCount - 1) {
+          this._bucketFirst += 1;
+          this._firstInBucket = 0;
+        } else {
+          this._bucketFirst = 0;
+          this._firstInBucket = 0;
+        }
+      }
+      this._size -= 1;
+      return element;
+    }
     /**
      * Time Complexity: Amortized O(1)
      * Space Complexity: O(n)
@@ -3816,30 +4021,53 @@ var dataStructureTyped = (() => {
       return true;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
      *
-     * The `shift()` function removes and returns the first element from a data structure, updating the
-     * internal state variables accordingly.
-     * @returns The element that is being removed from the beginning of the data structure is being
-     * returned.
+     * The function `pushMany` iterates over elements and pushes them into an array after applying a
+     * transformation function if provided.
+     * @param {IterableWithSizeOrLength<E> | IterableWithSizeOrLength<R>} elements - The `elements`
+     * parameter in the `pushMany` function is expected to be an iterable containing elements of type `E`
+     * or `R`. It can be either an `IterableWithSizeOrLength<E>` or an `IterableWithSizeOrLength<R>`. The
+     * function iterates over each element
+     * @returns The `pushMany` function is returning an array of boolean values, where each value
+     * represents the result of calling the `push` method on the current object instance with the
+     * corresponding element from the input `elements` iterable.
      */
-    shift() {
-      if (this._size === 0) return;
-      const element = this._buckets[this._bucketFirst][this._firstInBucket];
-      if (this._size !== 1) {
-        if (this._firstInBucket < this._bucketSize - 1) {
-          this._firstInBucket += 1;
-        } else if (this._bucketFirst < this._bucketCount - 1) {
-          this._bucketFirst += 1;
-          this._firstInBucket = 0;
+    pushMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.push(this.toElementFn(el)));
         } else {
-          this._bucketFirst = 0;
-          this._firstInBucket = 0;
+          ans.push(this.push(el));
         }
       }
-      this._size -= 1;
-      return element;
+      return ans;
+    }
+    /**
+     * Time Complexity: O(k)
+     * Space Complexity: O(k)
+     *
+     * The `unshiftMany` function in TypeScript iterates over elements and adds them to the beginning of
+     * an array, optionally converting them using a provided function.
+     * @param {IterableWithSizeOrLength<E> | IterableWithSizeOrLength<R>} elements - The `elements`
+     * parameter in the `unshiftMany` function is an iterable containing elements of type `E` or `R`. It
+     * can be an array or any other iterable data structure that has a known size or length. The function
+     * iterates over each element in the `elements` iterable and
+     * @returns The `unshiftMany` function returns an array of boolean values indicating whether each
+     * element was successfully added to the beginning of the array.
+     */
+    unshiftMany(elements = []) {
+      const ans = [];
+      for (const el of elements) {
+        if (this.toElementFn) {
+          ans.push(this.unshift(this.toElementFn(el)));
+        } else {
+          ans.push(this.unshift(el));
+        }
+      }
+      return ans;
     }
     /**
      * Time Complexity: O(1)
@@ -4356,12 +4584,7 @@ var dataStructureTyped = (() => {
         const { comparator } = options;
         if (comparator) this._comparator = comparator;
       }
-      if (elements) {
-        for (const el of elements) {
-          if (this.toElementFn) this.add(this.toElementFn(el));
-          else this.add(el);
-        }
-      }
+      this.addMany(elements);
     }
     /**
      * The function returns an array of elements.
@@ -4397,13 +4620,40 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * Insert an element into the heap and maintain the heap properties.
-     * @param element - The element to be inserted.
+     * The add function pushes an element into an array and then triggers a bubble-up operation.
+     * @param {E} element - The `element` parameter represents the element that you want to add to the
+     * data structure.
+     * @returns The `add` method is returning a boolean value, which is the result of calling the
+     * `_bubbleUp` method with the index `this.elements.length - 1` as an argument.
      */
     add(element) {
       this._elements.push(element);
       return this._bubbleUp(this.elements.length - 1);
     }
+    /**
+     * Time Complexity: O(k log n)
+     * Space Complexity: O(1)
+     *
+     * The `addMany` function iterates over elements and adds them to a collection, returning an array of
+     * boolean values indicating success or failure.
+     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `addMany` method is
+     * an iterable containing elements of type `E` or `R`. The method iterates over each element in the
+     * iterable and adds them to the data structure. If a transformation function `_toElementFn` is
+     * provided, it transforms the element
+     * @returns The `addMany` method returns an array of boolean values indicating whether each element
+     * in the input iterable was successfully added to the data structure.
+     */
+    addMany(elements) {
+      const ans = [];
+      for (const el of elements) {
+        if (this._toElementFn) {
+          ans.push(this.add(this._toElementFn(el)));
+          continue;
+        }
+        ans.push(this.add(el));
+      }
+      return ans;
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -4597,7 +4847,7 @@ var dataStructureTyped = (() => {
       return filteredList;
     }
     /**
-     * Time Complexity: O(n log n)
+     * Time Complexity: O(n)
      * Space Complexity: O(n)
      *
      * The `map` function creates a new heap by applying a callback function to each element of the
@@ -7120,6 +7370,8 @@ var dataStructureTyped = (() => {
       this.high = high;
       this.includeLow = includeLow;
       this.includeHigh = includeHigh;
+      if (!(isComparable(low) && isComparable(high))) throw new RangeError("low or high is not comparable");
+      if (low > high) throw new RangeError("low must be less than or equal to high");
     }
     // Determine whether a key is within the range
     isInRange(key, comparator) {
@@ -7260,7 +7512,7 @@ var dataStructureTyped = (() => {
      * input parameter (`keyNodeEntryOrRaw`) and processes it accordingly to return a node or null
      * value.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
       if (keyNodeEntryOrRaw === void 0) return [void 0, void 0];
       if (keyNodeEntryOrRaw === null) return [null, void 0];
       if (this.isNode(keyNodeEntryOrRaw)) return [keyNodeEntryOrRaw, value];
@@ -7437,7 +7689,7 @@ var dataStructureTyped = (() => {
      * key was found and the node was replaced instead of inserted.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (newNode === void 0) return false;
       if (!this._root) {
         this._setRoot(newNode);
@@ -9120,8 +9372,8 @@ var dataStructureTyped = (() => {
      * value associated with a key in a key-value pair.
      * @returns either a NODE object or undefined.
      */
-    keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
-      const [node, entryValue] = super.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+    _keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
+      const [node, entryValue] = super._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (node === null) return [void 0, void 0];
       return [node, value != null ? value : entryValue];
     }
@@ -9177,7 +9429,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (newNode === void 0) return false;
       if (this._root === void 0) {
         this._setRoot(newNode);
@@ -9423,6 +9675,31 @@ var dataStructureTyped = (() => {
       }
       return ans;
     }
+    /**
+     * Time Complexity: O(log n)
+     * Space Complexity: O(n)
+     *
+     * The `rangeSearch` function searches for nodes within a specified range in a binary search tree.
+     * @param {Range<K> | [K, K]} range - The `range` parameter in the `rangeSearch` function can be
+     * either a `Range` object or an array of two elements representing the range boundaries.
+     * @param {C} callback - The `callback` parameter in the `rangeSearch` function is a callback
+     * function that is used to process each node that is found within the specified range during the
+     * search operation. It is of type `NodeCallback<NODE>`, where `NODE` is the type of nodes in the
+     * data structure.
+     * @param {BTNRep<K, V, NODE> | R} startNode - The `startNode` parameter in the `rangeSearch`
+     * function represents the node from which the search for nodes within the specified range will
+     * begin. It is the starting point for the range search operation.
+     * @param {IterationType} iterationType - The `iterationType` parameter in the `rangeSearch` function
+     * is used to specify the type of iteration to be performed during the search operation. It has a
+     * default value of `this.iterationType`, which suggests that it is likely a property of the class or
+     * object that the `rangeSearch`
+     * @returns The `rangeSearch` function is returning the result of calling the `search` method with
+     * the specified parameters.
+     */
+    rangeSearch(range, callback = this._DEFAULT_NODE_CALLBACK, startNode = this._root, iterationType = this.iterationType) {
+      const searchRange = range instanceof Range ? range : new Range(range[0], range[1]);
+      return this.search(searchRange, false, callback, startNode, iterationType);
+    }
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -10655,7 +10932,7 @@ var dataStructureTyped = (() => {
     }
   };
 
-  // src/data-structures/binary-tree/rb-tree.ts
+  // src/data-structures/binary-tree/red-black-tree.ts
   var RedBlackTreeNode = class extends BSTNode {
     /**
      * The constructor function initializes a Red-Black Tree Node with a key, an optional value, and a
@@ -10820,7 +11097,7 @@ var dataStructureTyped = (() => {
      * returns true. If the node cannot be added or updated, the method returns false.
      */
     add(keyNodeEntryOrRaw, value) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (!this.isRealNode(newNode)) return false;
       const insertStatus = this._insert(newNode);
       if (insertStatus === "CREATED") {
@@ -11292,7 +11569,7 @@ var dataStructureTyped = (() => {
      * 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) {
+    _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)) {
@@ -11327,7 +11604,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     add(keyNodeEntryOrRaw, value, count = 1) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
       if (newNode === void 0) return false;
       const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
       const inserted = super.add(newNode, newValue);
@@ -11641,7 +11918,7 @@ var dataStructureTyped = (() => {
      * 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) {
+    _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)) {
@@ -11685,7 +11962,7 @@ var dataStructureTyped = (() => {
      * was successful, and false otherwise.
      */
     add(keyNodeEntryOrRaw, value, count = 1) {
-      const [newNode, newValue] = this.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
+      const [newNode, newValue] = this._keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value, count);
       const orgCount = (newNode == null ? void 0 : newNode.count) || 0;
       const isSuccessAdded = super.add(newNode, newValue);
       if (isSuccessAdded) {
@@ -12853,7 +13130,7 @@ var dataStructureTyped = (() => {
      * @returns The `addMany` method returns an array of boolean values indicating whether each word in
      * the input iterable was successfully added to the data structure.
      */
-    addMany(words = []) {
+    addMany(words) {
       const ans = [];
       for (const word of words) {
         if (this.toElementFn) {
@@ -12945,9 +13222,14 @@ var dataStructureTyped = (() => {
       return isDeleted;
     }
     /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(1) - Constant space.
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
      *
+     * The function `getHeight` calculates the height of a trie data structure starting from the root
+     * node.
+     * @returns The `getHeight` method returns the maximum depth or height of the trie tree starting from
+     * the root node. It calculates the depth using a breadth-first search (BFS) traversal of the trie
+     * tree and returns the maximum depth found.
      */
     getHeight() {
       const startNode = this.root;