data-structure-typed 1.45.0 → 1.45.2

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

@@ -624,8 +624,8 @@ var dataStructureTyped = (() => {
      */
     constructor(node, sentinel, hashMap, iterateDirection = 0 /* DEFAULT */) {
       __publicField(this, "hashMap");
-      __publicField(this, "_node");
       __publicField(this, "iterateDirection");
+      __publicField(this, "_node");
       __publicField(this, "_sentinel");
       this._node = node;
       this._sentinel = sentinel;
@@ -713,12 +713,12 @@ var dataStructureTyped = (() => {
      * `K` represents the type of the key and `V` represents the
      */
     constructor(hashMap = []) {
+      __publicField(this, "OBJ_KEY_INDEX", Symbol("OBJ_KEY_INDEX"));
       __publicField(this, "_nodes", []);
       __publicField(this, "_orgMap", {});
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_sentinel");
-      __publicField(this, "OBJ_KEY_INDEX", Symbol("OBJ_KEY_INDEX"));
       __publicField(this, "_size", 0);
       Object.setPrototypeOf(this._orgMap, null);
       this._sentinel = {};
@@ -730,6 +730,75 @@ 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)
+     *
+     * The function returns the key-value pair at the front of a data structure.
+     * @returns The front element of the data structure, represented as a tuple with a key (K) and a
+     * value (V).
+     */
+    get front() {
+      if (this._size === 0)
+        return;
+      return [this._head.key, this._head.value];
+    }
+    /**
+     * Time Complexity: O(1)
+     * Space Complexity: O(1)
+     *
+     * The function returns the key-value pair at the end of a data structure.
+     * @returns The method is returning an array containing the key-value pair of the tail element in the
+     * data structure.
+     */
+    get back() {
+      if (this._size === 0)
+        return;
+      return [this._tail.key, this._tail.value];
+    }
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -928,75 +997,6 @@ var dataStructureTyped = (() => {
       this._size = 0;
       this._head = this._tail = this._sentinel.prev = this._sentinel.next = this._sentinel;
     }
-    /**
-     * 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)
-     *
-     * The function returns the key-value pair at the front of a data structure.
-     * @returns The front element of the data structure, represented as a tuple with a key (K) and a
-     * value (V).
-     */
-    get front() {
-      if (this._size === 0)
-        return;
-      return [this._head.key, this._head.value];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function returns the key-value pair at the end of a data structure.
-     * @returns The method is returning an array containing the key-value pair of the tail element in the
-     * data structure.
-     */
-    get back() {
-      if (this._size === 0)
-        return;
-      return [this._tail.key, this._tail.value];
-    }
     /**
      * Time Complexity: O(n), where n is the number of elements in the HashMap.
      * Space Complexity: O(1)
@@ -3773,18 +3773,16 @@ var dataStructureTyped = (() => {
      * @param index - The index of the newly added element.
      */
     bubbleUp(index) {
-      const element = this.nodes[index];
+      const item = this.nodes[index];
       while (index > 0) {
-        const parentIndex = Math.floor((index - 1) / 2);
-        const parent = this.nodes[parentIndex];
-        if (this.comparator(element, parent) < 0) {
-          this.nodes[index] = parent;
-          this.nodes[parentIndex] = element;
-          index = parentIndex;
-        } else {
+        const parent = index - 1 >> 1;
+        const parentItem = this.nodes[parent];
+        if (this.comparator(parentItem, item) <= 0)
           break;
-        }
+        this.nodes[index] = parentItem;
+        index = parent;
       }
+      this.nodes[index] = item;
     }
     /**
      * Time Complexity: O(log n)
@@ -3798,8 +3796,8 @@ var dataStructureTyped = (() => {
      * @param index - The index from which to start sinking.
      */
     sinkDown(index) {
-      const leftChildIndex = 2 * index + 1;
-      const rightChildIndex = 2 * index + 2;
+      const leftChildIndex = index << 1 | 1;
+      const rightChildIndex = leftChildIndex + 1;
       const length = this.nodes.length;
       let targetIndex = index;
       if (leftChildIndex < length && this.comparator(this.nodes[leftChildIndex], this.nodes[targetIndex]) < 0) {
@@ -7860,7 +7858,9 @@ var dataStructureTyped = (() => {
         return super.addMany(keysOrNodes, data).map((n) => n != null ? n : void 0);
       }
       const inserted = [];
-      const combinedArr = keysOrNodes.map((value, index) => [value, data == null ? void 0 : data[index]]);
+      const combinedArr = keysOrNodes.map(
+        (value, index) => [value, data == null ? void 0 : data[index]]
+      );
       let sorted = [];
       function _isNodeOrUndefinedTuple(arr) {
         for (const [keyOrNode] of arr)