data-structure-typed 1.46.2 → 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,79 +2971,6 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/queue/deque.ts
-  var DequeIterator = class _DequeIterator {
-    /**
-     * The constructor initializes the index, iterate direction, and prev/next functions for a
-     * DequeIterator object.
-     * @param {number} index - The index parameter represents the current index position of the iterator
-     * within the deque. It is a number that indicates the position of the element that the iterator is
-     * currently pointing to.
-     * @param deque - The `deque` parameter is an instance of the `Deque` class. It represents a
-     * double-ended queue data structure, which allows elements to be added or removed from both ends.
-     * @param iterateDirection - The `iterateDirection` parameter is an optional parameter that specifies
-     * the direction in which the iterator should iterate over the elements of the `deque`. It has a
-     * default value of `IterateDirection.DEFAULT`.
-     * @returns The constructor is not returning anything. It is used to initialize the properties of the
-     * object being created.
-     */
-    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
@@ -3367,35 +3104,25 @@ var dataStructureTyped = (() => {
       this._firstInBucket = this._lastInBucket = this._bucketSize >> 1;
     }
     /**
-     * The `begin()` function returns a new iterator for a deque starting from the first element.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    begin() {
-      return new DequeIterator(0, this);
-    }
-    /**
-     * The `end()` function returns a new `DequeIterator` object with the size and reference to the
-     * current deque.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    end() {
-      return new DequeIterator(this.size, this);
-    }
-    /**
-     * The reverseBegin function returns a new DequeIterator object that starts at the last element of
-     * the deque and iterates in reverse direction.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The below function is a generator that yields elements from a collection one by one.
      */
-    reverseBegin() {
-      return new DequeIterator(this.size - 1, this, 1 /* REVERSE */);
+    *begin() {
+      let index = 0;
+      while (index < this.size) {
+        yield this.getAt(index);
+        index++;
+      }
     }
     /**
-     * The reverseEnd() function returns a new DequeIterator object that iterates over the elements of a
-     * Deque in reverse order.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The function `reverseBegin()` is a generator that yields elements in reverse order starting from
+     * the last element.
      */
-    reverseEnd() {
-      return new DequeIterator(-1, this, 1 /* REVERSE */);
+    *reverseBegin() {
+      let index = this.size - 1;
+      while (index >= 0) {
+        yield this.getAt(index);
+        index--;
+      }
     }
     /**
      * Time Complexity - Amortized O(1) (possible reallocation)
@@ -3705,46 +3432,6 @@ var dataStructureTyped = (() => {
       this.cut(index - 1);
       return this.size;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function deletes an element from a deque using an iterator and returns the next iterator.
-     * @param iter - The parameter `iter` is of type `DequeIterator<E>`. It represents an iterator object
-     * that is used to iterate over elements in a deque (double-ended queue).
-     * @returns the updated iterator after deleting an element from the deque.
-     */
-    deleteByIterator(iter) {
-      const index = iter.index;
-      this.deleteAt(index);
-      iter = iter.next();
-      return iter;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `findIterator` searches for an element in a deque and returns an iterator pointing to
-     * the element if found, otherwise it returns an iterator pointing to the end of the deque.
-     * @param {E} element - The `element` parameter is the element that you want to find in the deque.
-     * @returns The method `findIterator(element: E)` returns a `DequeIterator<E>` object.
-     */
-    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)
@@ -6909,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 {
     /**