min-heap-typed 1.45.1 → 1.45.3

package/dist/data-structures/heap/heap.js

@@ -271,19 +271,28 @@ class Heap {
      * @param index - The index of the newly added element.
      */
     bubbleUp(index) {
-        const element = this.nodes[index];
+        // const element = this.nodes[index];
+        // while (index > 0) {
+        //   const parentIndex = (index - 1) >> 1;
+        //   const parent = this.nodes[parentIndex];
+        //   if (this.comparator(element, parent) < 0) {
+        //     this.nodes[index] = parent;
+        //     this.nodes[parentIndex] = element;
+        //     index = parentIndex;
+        //   } else {
+        //     break;
+        //   }
+        // }
+        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)
@@ -297,8 +306,8 @@ class Heap {
      * @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) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.45.1",
+  "version": "1.45.3",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.45.0"
+    "data-structure-typed": "^1.45.3"
   }
 }

package/src/data-structures/heap/heap.ts

@@ -305,18 +305,28 @@ export class Heap<E = any> {
    * @param index - The index of the newly added element.
    */
   protected bubbleUp(index: number): void {
-    const element = this.nodes[index];
+    // const element = this.nodes[index];
+    // while (index > 0) {
+    //   const parentIndex = (index - 1) >> 1;
+    //   const parent = this.nodes[parentIndex];
+    //   if (this.comparator(element, parent) < 0) {
+    //     this.nodes[index] = parent;
+    //     this.nodes[parentIndex] = element;
+    //     index = parentIndex;
+    //   } else {
+    //     break;
+    //   }
+    // }
+
+    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 {
-        break;
-      }
+      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;
   }
 
   /**
@@ -332,8 +342,8 @@ export class Heap<E = any> {
    * @param index - The index from which to start sinking.
    */
   protected sinkDown(index: number): void {
-    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;