data-structure-typed 1.46.1 → 1.46.3

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

@@ -103,7 +103,6 @@ var dataStructureTyped = (() => {
     CoordinateMap: () => CoordinateMap,
     CoordinateSet: () => CoordinateSet,
     Deque: () => Deque,
-    DequeIterator: () => DequeIterator,
     DirectedEdge: () => DirectedEdge,
     DirectedGraph: () => DirectedGraph,
     DirectedVertex: () => DirectedVertex,
@@ -113,7 +112,6 @@ var dataStructureTyped = (() => {
     FibonacciHeap: () => FibonacciHeap,
     FibonacciHeapNode: () => FibonacciHeapNode,
     HashMap: () => HashMap,
-    HashMapIterator: () => HashMapIterator,
     HashTable: () => HashTable,
     HashTableNode: () => HashTableNode,
     Heap: () => Heap,
@@ -568,146 +566,7 @@ var dataStructureTyped = (() => {
   };
   var calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
 
-  // src/types/data-structures/binary-tree/binary-tree.ts
-  var IterationType = /* @__PURE__ */ ((IterationType3) => {
-    IterationType3["ITERATIVE"] = "ITERATIVE";
-    IterationType3["RECURSIVE"] = "RECURSIVE";
-    return IterationType3;
-  })(IterationType || {});
-  var FamilyPosition = /* @__PURE__ */ ((FamilyPosition2) => {
-    FamilyPosition2["ROOT"] = "ROOT";
-    FamilyPosition2["LEFT"] = "LEFT";
-    FamilyPosition2["RIGHT"] = "RIGHT";
-    FamilyPosition2["ROOT_LEFT"] = "ROOT_LEFT";
-    FamilyPosition2["ROOT_RIGHT"] = "ROOT_RIGHT";
-    FamilyPosition2["ISOLATED"] = "ISOLATED";
-    FamilyPosition2["MAL_NODE"] = "MAL_NODE";
-    return FamilyPosition2;
-  })(FamilyPosition || {});
-
-  // src/types/data-structures/binary-tree/rb-tree.ts
-  var RBTNColor = /* @__PURE__ */ ((RBTNColor2) => {
-    RBTNColor2[RBTNColor2["RED"] = 1] = "RED";
-    RBTNColor2[RBTNColor2["BLACK"] = 0] = "BLACK";
-    return RBTNColor2;
-  })(RBTNColor || {});
-
-  // src/types/helpers.ts
-  var CP = /* @__PURE__ */ ((CP2) => {
-    CP2["lt"] = "lt";
-    CP2["eq"] = "eq";
-    CP2["gt"] = "gt";
-    return CP2;
-  })(CP || {});
-  var IterateDirection = /* @__PURE__ */ ((IterateDirection2) => {
-    IterateDirection2[IterateDirection2["DEFAULT"] = 0] = "DEFAULT";
-    IterateDirection2[IterateDirection2["REVERSE"] = 1] = "REVERSE";
-    return IterateDirection2;
-  })(IterateDirection || {});
-
   // src/data-structures/hash/hash-map.ts
-  var HashMapIterator = class _HashMapIterator {
-    /**
-     * This is a constructor function for a linked list iterator in a HashMap data structure.
-     * @param node - The `node` parameter is a reference to a `HashMapLinkedNode` object. This object
-     * represents a node in a linked list used in a hash map data structure. It contains a key-value pair
-     * and references to the previous and next nodes in the linked list.
-     * @param sentinel - The `sentinel` parameter is a reference to a special node in a linked list. It
-     * is used to mark the beginning or end of the list and is typically used in data structures like
-     * hash maps or linked lists to simplify operations and boundary checks.
-     * @param hashMap - A HashMap object that stores key-value pairs.
-     * @param {IterateDirection} iterateDirection - The `iterateDirection` parameter is an optional
-     * parameter that specifies the direction in which the iterator should iterate over the elements of
-     * the HashMap. It can take one of the following values:
-     * @returns The constructor does not return anything. It is used to initialize the properties and
-     * methods of the object being created.
-     */
-    constructor(node, sentinel, hashMap, iterateDirection = 0 /* DEFAULT */) {
-      __publicField(this, "hashMap");
-      __publicField(this, "iterateDirection");
-      __publicField(this, "_node");
-      __publicField(this, "_sentinel");
-      this._node = node;
-      this._sentinel = sentinel;
-      this.iterateDirection = iterateDirection;
-      if (this.iterateDirection === 0 /* DEFAULT */) {
-        this.prev = function() {
-          if (this._node.prev === this._sentinel) {
-            throwRangeError();
-          }
-          this._node = this._node.prev;
-          return this;
-        };
-        this.next = function() {
-          if (this._node === this._sentinel) {
-            throwRangeError();
-          }
-          this._node = this._node.next;
-          return this;
-        };
-      } else {
-        this.prev = function() {
-          if (this._node.next === this._sentinel) {
-            throwRangeError();
-          }
-          this._node = this._node.next;
-          return this;
-        };
-        this.next = function() {
-          if (this._node === this._sentinel) {
-            throwRangeError();
-          }
-          this._node = this._node.prev;
-          return this;
-        };
-      }
-      this.hashMap = hashMap;
-    }
-    /**
-     * The above function returns a Proxy object that allows access to the key and value of a node in a
-     * data structure.
-     * @returns The code is returning a Proxy object.
-     */
-    get current() {
-      if (this._node === this._sentinel) {
-        throwRangeError();
-      }
-      return new Proxy([], {
-        get: (target, prop) => {
-          if (prop === "0")
-            return this._node.key;
-          else if (prop === "1")
-            return this._node.value;
-          target[0] = this._node.key;
-          target[1] = this._node.value;
-          return target[prop];
-        },
-        set: (_, prop, newValue) => {
-          if (prop !== "1") {
-            throw new TypeError(`prop should be string '1'`);
-          }
-          this._node.value = newValue;
-          return true;
-        }
-      });
-    }
-    /**
-     * The function checks if a node is accessible.
-     * @returns a boolean value indicating whether the `_node` is not equal to the `_sentinel`.
-     */
-    isAccessible() {
-      return this._node !== this._sentinel;
-    }
-    prev() {
-      return this;
-    }
-    next() {
-      return this;
-    }
-    clone() {
-      return new _HashMapIterator(this._node, this._sentinel, this.hashMap, this.iterateDirection);
-    }
-  };
   var HashMap = class {
     /**
      * The constructor initializes a HashMap object with an optional initial set of key-value pairs.
@@ -733,49 +592,6 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function returns a new iterator object for a HashMap.
-     * @returns A new instance of the HashMapIterator class is being returned.
-     */
-    get begin() {
-      return new HashMapIterator(this._head, this._sentinel, this);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function returns a new HashMapIterator object with the _sentinel value as both the start and
-     * end values.
-     * @returns A new instance of the HashMapIterator class is being returned.
-     */
-    get end() {
-      return new HashMapIterator(this._sentinel, this._sentinel, this);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The reverseBegin function returns a new HashMapIterator object that iterates over the elements of
-     * a HashMap in reverse order.
-     * @returns A new instance of the HashMapIterator class is being returned.
-     */
-    get reverseBegin() {
-      return new HashMapIterator(this._tail, this._sentinel, this, 1 /* REVERSE */);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The reverseEnd function returns a new HashMapIterator object that iterates over the elements of a
-     * HashMap in reverse order.
-     * @returns A new instance of the HashMapIterator class is being returned.
-     */
-    get reverseEnd() {
-      return new HashMapIterator(this._sentinel, this._sentinel, this, 1 /* REVERSE */);
-    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -802,6 +618,27 @@ var dataStructureTyped = (() => {
         return;
       return [this._tail.key, this._tail.value];
     }
+    /**
+     * The `begin()` function in TypeScript iterates over a linked list and yields key-value pairs.
+     */
+    *begin() {
+      let node = this._head;
+      while (node !== this._sentinel) {
+        yield [node.key, node.value];
+        node = node.next;
+      }
+    }
+    /**
+     * The function `reverseBegin()` iterates over a linked list in reverse order, yielding each node's
+     * key and value.
+     */
+    *reverseBegin() {
+      let node = this._tail;
+      while (node !== this._sentinel) {
+        yield [node.key, node.value];
+        node = node.prev;
+      }
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -900,33 +737,6 @@ var dataStructureTyped = (() => {
       }
       return [node.key, node.value];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `getIterator` returns a new instance of `HashMapIterator` based on the provided key
-     * and whether it is an object key or not.
-     * @param {K} key - The `key` parameter is the key used to retrieve the iterator from the HashMap. It
-     * can be of any type, depending on how the HashMap is implemented.
-     * @param {boolean} [isObjectKey] - The `isObjectKey` parameter is an optional boolean parameter that
-     * indicates whether the `key` parameter is an object key. If `isObjectKey` is `true`, it means that
-     * the `key` parameter is an object and needs to be handled differently. If `isObjectKey` is `false`
-     * @returns a new instance of the `HashMapIterator` class.
-     */
-    getIterator(key, isObjectKey) {
-      let node;
-      if (isObjectKey) {
-        const index = key[this.OBJ_KEY_INDEX];
-        if (index === void 0) {
-          node = this._sentinel;
-        } else {
-          node = this._nodes[index];
-        }
-      } else {
-        node = this._orgMap[key] || this._sentinel;
-      }
-      return new HashMapIterator(node, this._sentinel, this);
-    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -3161,66 +2971,16 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/queue/deque.ts
-  var DequeIterator = class _DequeIterator {
-    constructor(index, deque, iterateDirection = 0 /* DEFAULT */) {
-      __publicField(this, "iterateDirection");
-      __publicField(this, "index");
-      __publicField(this, "deque");
-      this.index = index;
-      this.iterateDirection = iterateDirection;
-      if (this.iterateDirection === 0 /* DEFAULT */) {
-        this.prev = function() {
-          if (this.index === 0) {
-            throwRangeError();
-          }
-          this.index -= 1;
-          return this;
-        };
-        this.next = function() {
-          if (this.index === this.deque.size) {
-            throwRangeError();
-          }
-          this.index += 1;
-          return this;
-        };
-      } else {
-        this.prev = function() {
-          if (this.index === this.deque.size - 1) {
-            throwRangeError();
-          }
-          this.index += 1;
-          return this;
-        };
-        this.next = function() {
-          if (this.index === -1) {
-            throwRangeError();
-          }
-          this.index -= 1;
-          return this;
-        };
-      }
-      this.deque = deque;
-    }
-    get current() {
-      return this.deque.getAt(this.index);
-    }
-    set current(newElement) {
-      this.deque.setAt(this.index, newElement);
-    }
-    isAccessible() {
-      return this.index !== this.deque.size;
-    }
-    prev() {
-      return this;
-    }
-    next() {
-      return this;
-    }
-    clone() {
-      return new _DequeIterator(this.index, this.deque, this.iterateDirection);
-    }
-  };
   var Deque = class _Deque {
+    /**
+     * The constructor initializes a data structure with a specified bucket size and populates it with
+     * elements from an iterable.
+     * @param elements - The `elements` parameter is an iterable object (such as an array or a Set) that
+     * contains the initial elements to be stored in the data structure. It can also be an object with a
+     * `length` property or a `size` property, which represents the number of elements in the iterable.
+     * @param bucketSize - The `bucketSize` parameter is the maximum number of elements that can be
+     * stored in each bucket. It determines the size of each bucket in the data structure.
+     */
     constructor(elements = [], bucketSize = 1 << 12) {
       __publicField(this, "_bucketFirst", 0);
       __publicField(this, "_firstInBucket", 0);
@@ -3232,9 +2992,15 @@ var dataStructureTyped = (() => {
       __publicField(this, "_size", 0);
       let _size;
       if ("length" in elements) {
-        _size = elements.length;
+        if (elements.length instanceof Function)
+          _size = elements.length();
+        else
+          _size = elements.length;
       } else {
-        _size = elements.size;
+        if (elements.size instanceof Function)
+          _size = elements.size();
+        else
+          _size = elements.size;
       }
       this._bucketSize = bucketSize;
       this._bucketCount = calcMinUnitsRequired(_size, this._bucketSize) || 1;
@@ -3254,6 +3020,11 @@ var dataStructureTyped = (() => {
     get size() {
       return this._size;
     }
+    /**
+     * The function returns the first element in a collection if it exists, otherwise it returns
+     * undefined.
+     * @returns The first element of the collection, of type E, is being returned.
+     */
     get first() {
       if (this.size === 0)
         return;
@@ -3264,13 +3035,6 @@ var dataStructureTyped = (() => {
         return;
       return this._buckets[this._bucketLast][this._lastInBucket];
     }
-    /**
-     * Time Complexity: Amortized O(1) - Generally constant time, but resizing when the deque is full leads to O(n).
-     * Space Complexity: O(n) - In worst case, resizing doubles the array size.
-     */
-    empty() {
-      return this._size === 0;
-    }
     /**
      * Time Complexity: O(1) - Removes the last element.
      * Space Complexity: O(1) - Operates in-place.
@@ -3329,24 +3093,50 @@ var dataStructureTyped = (() => {
     popFirst() {
       return this.shift();
     }
+    /**
+     * The clear() function resets the state of the object by initializing all variables to their default
+     * values.
+     */
     clear() {
       this._buckets = [new Array(this._bucketSize)];
       this._bucketCount = 1;
       this._bucketFirst = this._bucketLast = this._size = 0;
       this._firstInBucket = this._lastInBucket = this._bucketSize >> 1;
     }
-    begin() {
-      return new DequeIterator(0, this);
-    }
-    end() {
-      return new DequeIterator(this.size, this);
-    }
-    reverseBegin() {
-      return new DequeIterator(this.size - 1, this, 1 /* REVERSE */);
+    /**
+     * The below function is a generator that yields elements from a collection one by one.
+     */
+    *begin() {
+      let index = 0;
+      while (index < this.size) {
+        yield this.getAt(index);
+        index++;
+      }
     }
-    reverseEnd() {
-      return new DequeIterator(-1, this, 1 /* REVERSE */);
+    /**
+     * The function `reverseBegin()` is a generator that yields elements in reverse order starting from
+     * the last element.
+     */
+    *reverseBegin() {
+      let index = this.size - 1;
+      while (index >= 0) {
+        yield this.getAt(index);
+        index--;
+      }
     }
+    /**
+     * Time Complexity - Amortized O(1) (possible reallocation)
+     * Space Complexity - O(n) (due to potential resizing).
+     */
+    /**
+     * Time Complexity - Amortized O(1) (possible reallocation),
+     * Space Complexity - O(n) (due to potential resizing).
+     *
+     * The push function adds an element to a data structure and reallocates memory if necessary.
+     * @param {E} element - The `element` parameter represents the value that you want to add to the data
+     * structure.
+     * @returns The size of the data structure after the element has been pushed.
+     */
     push(element) {
       if (this.size) {
         if (this._lastInBucket < this._bucketSize - 1) {
@@ -3365,6 +3155,18 @@ var dataStructureTyped = (() => {
       this._buckets[this._bucketLast][this._lastInBucket] = element;
       return this.size;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `pop()` function removes and returns the last element from a data structure, updating the
+     * internal state variables accordingly.
+     * @returns The element that was removed from the data structure is being returned.
+     */
     pop() {
       if (this.size === 0)
         return;
@@ -3383,6 +3185,20 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
+    /**
+     * Time Complexity: Amortized O(1)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: Amortized O(1)
+     * Space Complexity: O(n)
+     *
+     * The `unshift` function adds an element to the beginning of an array-like data structure and
+     * returns the new size of the structure.
+     * @param {E} element - The `element` parameter represents the element that you want to add to the
+     * beginning of the data structure.
+     * @returns The size of the data structure after the element has been added.
+     */
     unshift(element) {
       if (this.size) {
         if (this._firstInBucket > 0) {
@@ -3401,6 +3217,19 @@ var dataStructureTyped = (() => {
       this._buckets[this._bucketFirst][this._firstInBucket] = element;
       return this.size;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * 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;
@@ -3419,6 +3248,20 @@ var dataStructureTyped = (() => {
       this._size -= 1;
       return element;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `getAt` function retrieves an element at a specified position in an array-like data structure.
+     * @param {number} pos - The `pos` parameter represents the position of the element that you want to
+     * retrieve from the data structure. It is of type `number` and should be a valid index within the
+     * range of the data structure.
+     * @returns The element at the specified position in the data structure is being returned.
+     */
     getAt(pos) {
       rangeCheck(pos, 0, this.size - 1);
       const {
@@ -3427,6 +3270,20 @@ var dataStructureTyped = (() => {
       } = this._getBucketAndPosition(pos);
       return this._buckets[bucketIndex][indexInBucket];
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `setAt` function sets an element at a specific position in an array-like data structure.
+     * @param {number} pos - The `pos` parameter represents the position at which the element needs to be
+     * set. It is of type `number`.
+     * @param {E} element - The `element` parameter is the value that you want to set at the specified
+     * position in the data structure.
+     */
     setAt(pos, element) {
       rangeCheck(pos, 0, this.size - 1);
       const {
@@ -3435,6 +3292,25 @@ var dataStructureTyped = (() => {
       } = this._getBucketAndPosition(pos);
       this._buckets[bucketIndex][indexInBucket] = element;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `insertAt` function inserts one or more elements at a specified position in an array-like data
+     * structure.
+     * @param {number} pos - The `pos` parameter represents the position at which the element(s) should
+     * be inserted. It is of type `number`.
+     * @param {E} element - The `element` parameter represents the element that you want to insert into
+     * the array at the specified position.
+     * @param [num=1] - The `num` parameter represents the number of times the `element` should be
+     * inserted at the specified position (`pos`). By default, it is set to 1, meaning that the `element`
+     * will be inserted once. However, you can provide a different value for `num` if you want
+     * @returns The size of the array after the insertion is being returned.
+     */
     insertAt(pos, element, num = 1) {
       const length = this.size;
       rangeCheck(pos, 0, length);
@@ -3457,6 +3333,20 @@ var dataStructureTyped = (() => {
       }
       return this.size;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The `cut` function updates the state of the object based on the given position and returns the
+     * updated size.
+     * @param {number} pos - The `pos` parameter represents the position at which the string should be
+     * cut. It is a number that indicates the index of the character where the cut should be made.
+     * @returns The method is returning the updated size of the data structure.
+     */
     cut(pos) {
       if (pos < 0) {
         this.clear();
@@ -3471,6 +3361,21 @@ var dataStructureTyped = (() => {
       this._size = pos + 1;
       return this.size;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `deleteAt` function removes an element at a specified position in an array-like data
+     * structure.
+     * @param {number} pos - The `pos` parameter in the `deleteAt` function represents the position at
+     * which an element needs to be deleted from the data structure. It is of type `number` and indicates
+     * the index of the element to be deleted.
+     * @returns The size of the data structure after the deletion operation is performed.
+     */
     deleteAt(pos) {
       rangeCheck(pos, 0, this.size - 1);
       if (pos === 0)
@@ -3496,6 +3401,20 @@ var dataStructureTyped = (() => {
       }
       return this.size;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `delete` function removes all occurrences of a specified element from an array-like data
+     * structure.
+     * @param {E} element - The `element` parameter represents the element that you want to delete from
+     * the data structure.
+     * @returns The size of the data structure after the element has been deleted.
+     */
     delete(element) {
       const size = this.size;
       if (size === 0)
@@ -3513,20 +3432,19 @@ var dataStructureTyped = (() => {
       this.cut(index - 1);
       return this.size;
     }
-    deleteByIterator(iter) {
-      const index = iter.index;
-      this.deleteAt(index);
-      iter = iter.next();
-      return iter;
-    }
-    findIterator(element) {
-      for (let i = 0; i < this.size; ++i) {
-        if (this.getAt(i) === element) {
-          return new DequeIterator(i, this);
-        }
-      }
-      return this.end();
-    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The reverse() function reverses the order of the buckets and the elements within each bucket in a
+     * data structure.
+     * @returns The reverse() method is returning the object itself (this) after performing the reverse
+     * operation on the buckets and updating the relevant properties.
+     */
     reverse() {
       this._buckets.reverse().forEach(function(bucket) {
         bucket.reverse();
@@ -3538,6 +3456,18 @@ var dataStructureTyped = (() => {
       this._lastInBucket = this._bucketSize - _firstInBucket - 1;
       return this;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `unique()` function removes duplicate elements from an array-like data structure and returns
+     * the number of unique elements.
+     * @returns The size of the modified array is being returned.
+     */
     unique() {
       if (this.size <= 1) {
         return this.size;
@@ -3554,6 +3484,20 @@ var dataStructureTyped = (() => {
       this.cut(index - 1);
       return this.size;
     }
+    /**
+     * Time Complexity: O(n log n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n log n)
+     * Space Complexity: O(n)
+     *
+     * The `sort` function sorts the elements in a data structure using a provided comparator function.
+     * @param [comparator] - The `comparator` parameter is a function that takes in two elements `x` and
+     * `y` of type `E` and returns a number. The comparator function is used to determine the order of
+     * the elements in the sorted array.
+     * @returns The method is returning the sorted instance of the object on which the method is called.
+     */
     sort(comparator) {
       const arr = [];
       for (let i = 0; i < this.size; ++i) {
@@ -3565,6 +3509,19 @@ var dataStructureTyped = (() => {
       }
       return this;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `shrinkToFit` function reorganizes the elements in an array-like data structure to minimize
+     * memory usage.
+     * @returns Nothing is being returned. The function is using the `return` statement to exit early if
+     * `this.size` is 0, but it does not return any value.
+     */
     shrinkToFit() {
       if (this.size === 0)
         return;
@@ -3587,11 +3544,39 @@ var dataStructureTyped = (() => {
       this._bucketLast = newBuckets.length - 1;
       this._buckets = newBuckets;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `forEach` function iterates over each element in a deque and applies a callback function to
+     * each element.
+     * @param callback - The callback parameter is a function that will be called for each element in the
+     * deque. It takes three parameters:
+     */
     forEach(callback) {
       for (let i = 0; i < this.size; ++i) {
         callback(this.getAt(i), i, this);
       }
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `find` function iterates over the elements in a deque and returns the first element for which
+     * the callback function returns true, or undefined if no such element is found.
+     * @param callback - A function that takes three parameters: element, index, and deque. It should
+     * return a boolean value indicating whether the element satisfies a certain condition.
+     * @returns The method `find` returns the first element in the deque that satisfies the condition
+     * specified by the callback function. If no element satisfies the condition, it returns `undefined`.
+     */
     find(callback) {
       for (let i = 0; i < this.size; ++i) {
         const element = this.getAt(i);
@@ -3601,6 +3586,17 @@ var dataStructureTyped = (() => {
       }
       return void 0;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `toArray` function converts the elements of a data structure into an array.
+     * @returns The `toArray()` method is returning an array of elements of type `E`.
+     */
     toArray() {
       const arr = [];
       for (let i = 0; i < this.size; ++i) {
@@ -3608,6 +3604,19 @@ var dataStructureTyped = (() => {
       }
       return arr;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `map` function takes a callback function and applies it to each element in the deque,
+     * returning a new deque with the results.
+     * @param callback - The `callback` parameter is a function that takes three arguments:
+     * @returns The `map` method is returning a new `Deque` object with the transformed elements.
+     */
     map(callback) {
       const newDeque = new _Deque([], this._bucketSize);
       for (let i = 0; i < this.size; ++i) {
@@ -3615,6 +3624,21 @@ var dataStructureTyped = (() => {
       }
       return newDeque;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `filter` function creates a new deque containing only the elements that satisfy the given
+     * predicate function.
+     * @param predicate - The `predicate` parameter is a function that takes three arguments: `element`,
+     * `index`, and `deque`.
+     * @returns The `filter` method is returning a new `Deque` object that contains only the elements
+     * that satisfy the given `predicate` function.
+     */
     filter(predicate) {
       const newDeque = new _Deque([], this._bucketSize);
       for (let i = 0; i < this.size; ++i) {
@@ -3625,6 +3649,23 @@ var dataStructureTyped = (() => {
       }
       return newDeque;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The `reduce` function iterates over the elements of a deque and applies a callback function to
+     * each element, accumulating a single value.
+     * @param callback - The `callback` parameter is a function that takes four arguments:
+     * @param {T} initialValue - The `initialValue` parameter is the initial value of the accumulator. It
+     * is the value that will be passed as the first argument to the `callback` function when reducing
+     * the elements of the deque.
+     * @returns the final value of the accumulator after iterating over all elements in the deque and
+     * applying the callback function to each element.
+     */
     reduce(callback, initialValue) {
       let accumulator = initialValue;
       for (let i = 0; i < this.size; ++i) {
@@ -3632,6 +3673,21 @@ var dataStructureTyped = (() => {
       }
       return accumulator;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The function "indexOf" returns the index of the first occurrence of a given element in an array,
+     * or -1 if the element is not found.
+     * @param {E} element - The "element" parameter represents the element that you want to find the
+     * index of in the data structure.
+     * @returns The indexOf function returns the index of the first occurrence of the specified element
+     * in the data structure. If the element is not found, it returns -1.
+     */
     indexOf(element) {
       for (let i = 0; i < this.size; ++i) {
         if (this.getAt(i) === element) {
@@ -3640,11 +3696,35 @@ var dataStructureTyped = (() => {
       }
       return -1;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(1)
+     *
+     * The above function is an implementation of the iterator protocol in TypeScript, allowing the
+     * object to be iterated over using a for...of loop.
+     */
     *[Symbol.iterator]() {
       for (let i = 0; i < this.size; ++i) {
         yield this.getAt(i);
       }
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `_reallocate` function reallocates the buckets in an array, adding new buckets if needed.
+     * @param {number} [needBucketNum] - The `needBucketNum` parameter is an optional number that
+     * specifies the number of new buckets needed. If not provided, it will default to half of the
+     * current bucket count (`this._bucketCount >> 1`) or 1 if the current bucket count is less than 2.
+     */
     _reallocate(needBucketNum) {
       const newBuckets = [];
       const addBucketNum = needBucketNum || this._bucketCount >> 1 || 1;
@@ -3666,6 +3746,19 @@ var dataStructureTyped = (() => {
       this._buckets = newBuckets;
       this._bucketCount = newBuckets.length;
     }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     */
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The function calculates the bucket index and index within the bucket based on the given position.
+     * @param {number} pos - The `pos` parameter represents the position within the data structure. It is
+     * a number that indicates the index or position of an element within the structure.
+     * @returns an object with two properties: "bucketIndex" and "indexInBucket".
+     */
     _getBucketAndPosition(pos) {
       let bucketIndex;
       let indexInBucket;
@@ -6503,6 +6596,43 @@ var dataStructureTyped = (() => {
     }
   };
 
+  // src/types/data-structures/binary-tree/binary-tree.ts
+  var IterationType = /* @__PURE__ */ ((IterationType3) => {
+    IterationType3["ITERATIVE"] = "ITERATIVE";
+    IterationType3["RECURSIVE"] = "RECURSIVE";
+    return IterationType3;
+  })(IterationType || {});
+  var FamilyPosition = /* @__PURE__ */ ((FamilyPosition2) => {
+    FamilyPosition2["ROOT"] = "ROOT";
+    FamilyPosition2["LEFT"] = "LEFT";
+    FamilyPosition2["RIGHT"] = "RIGHT";
+    FamilyPosition2["ROOT_LEFT"] = "ROOT_LEFT";
+    FamilyPosition2["ROOT_RIGHT"] = "ROOT_RIGHT";
+    FamilyPosition2["ISOLATED"] = "ISOLATED";
+    FamilyPosition2["MAL_NODE"] = "MAL_NODE";
+    return FamilyPosition2;
+  })(FamilyPosition || {});
+
+  // src/types/data-structures/binary-tree/rb-tree.ts
+  var RBTNColor = /* @__PURE__ */ ((RBTNColor2) => {
+    RBTNColor2[RBTNColor2["RED"] = 1] = "RED";
+    RBTNColor2[RBTNColor2["BLACK"] = 0] = "BLACK";
+    return RBTNColor2;
+  })(RBTNColor || {});
+
+  // src/types/helpers.ts
+  var CP = /* @__PURE__ */ ((CP2) => {
+    CP2["lt"] = "lt";
+    CP2["eq"] = "eq";
+    CP2["gt"] = "gt";
+    return CP2;
+  })(CP || {});
+  var IterateDirection = /* @__PURE__ */ ((IterateDirection2) => {
+    IterateDirection2[IterateDirection2["DEFAULT"] = 0] = "DEFAULT";
+    IterateDirection2[IterateDirection2["REVERSE"] = 1] = "REVERSE";
+    return IterateDirection2;
+  })(IterateDirection || {});
+
   // src/data-structures/binary-tree/binary-tree.ts
   var BinaryTreeNode = class {
     /**