undirected-graph-typed 2.5.2 → 2.5.3

package/dist/umd/undirected-graph-typed.js

@@ -763,6 +763,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -817,7 +821,7 @@ var undirectedGraphTyped = (() => {
     }
     /**
       * Insert an element.
-      * @remarks Time O(1) amortized, Space O(1)
+      * @remarks Time O(log N) amortized, Space O(1)
       * @param element - Element to insert.
       * @returns True.
       
@@ -850,6 +854,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -907,6 +915,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -967,10 +979,41 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
       
+       * @example
+    * // Heap with custom comparator (MaxHeap behavior)
+    *  interface Task {
+    *       id: number;
+    *       priority: number;
+    *       name: string;
+    *     }
+    *
+    *     // Custom comparator for max heap behavior (higher priority first)
+    *     const tasks: Task[] = [
+    *       { id: 1, priority: 5, name: 'Email' },
+    *       { id: 2, priority: 3, name: 'Chat' },
+    *       { id: 3, priority: 8, name: 'Alert' }
+    *     ];
+    *
+    *     const maxHeap = new Heap(tasks, {
+    *       comparator: (a: Task, b: Task) => b.priority - a.priority
+    *     });
+    *
+    *     console.log(maxHeap.size); // 3;
+    *
+    *     // Peek returns highest priority task
+    *     const topTask = maxHeap.peek();
+    *     console.log(topTask?.priority); // 8;
+    *     console.log(topTask?.name); // 'Alert';
+      */
+    /**
+      * @deprecated Use `pop` instead. Will be removed in a future major version.
        * @example
     * // Heap with custom comparator (MaxHeap behavior)
     *  interface Task {
@@ -998,6 +1041,14 @@ var undirectedGraphTyped = (() => {
     *     console.log(topTask?.name); // 'Alert';
       */
     poll() {
+      return this.pop();
+    }
+    /**
+     * Remove and return the top element (min or max depending on comparator).
+     * @remarks Time O(log N) amortized, Space O(1)
+     * @returns The removed top element, or undefined if empty.
+     */
+    pop() {
       if (this.elements.length === 0) return;
       const value = this.elements[0];
       const last = this.elements.pop();
@@ -1041,6 +1092,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1141,6 +1196,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1188,6 +1247,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1202,16 +1265,6 @@ var undirectedGraphTyped = (() => {
     clear() {
       this._elements = [];
     }
-    /**
-     * Replace the backing array and rebuild the heap.
-     * @remarks Time O(N), Space O(N)
-     * @param elements - Iterable used to refill the heap.
-     * @returns Array of per-node results from fixing steps.
-     */
-    refill(elements) {
-      this._elements = Array.from(elements);
-      return this.fix();
-    }
     /**
       * Check if an equal element exists in the heap.
       * @remarks Time O(N), Space O(1)
@@ -1238,6 +1291,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1285,6 +1342,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1306,7 +1367,7 @@ var undirectedGraphTyped = (() => {
       }
       if (index < 0) return false;
       if (index === 0) {
-        this.poll();
+        this.pop();
       } else if (index === this.elements.length - 1) {
         this.elements.pop();
       } else {
@@ -1316,13 +1377,19 @@ var undirectedGraphTyped = (() => {
       }
       return true;
     }
+    /**
+     * @deprecated Use `deleteWhere` instead. Will be removed in a future major version.
+     */
+    deleteBy(predicate) {
+      return this.deleteWhere(predicate);
+    }
     /**
      * Delete the first element that matches a predicate.
      * @remarks Time O(N), Space O(1)
      * @param predicate - Function (element, index, heap) → boolean.
      * @returns True if an element was removed.
      */
-    deleteBy(predicate) {
+    deleteWhere(predicate) {
       let idx = -1;
       for (let i = 0; i < this.elements.length; i++) {
         if (predicate(this.elements[i], i, this)) {
@@ -1332,7 +1399,7 @@ var undirectedGraphTyped = (() => {
       }
       if (idx < 0) return false;
       if (idx === 0) {
-        this.poll();
+        this.pop();
       } else if (idx === this.elements.length - 1) {
         this.elements.pop();
       } else {
@@ -1378,6 +1445,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1458,6 +1529,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1511,6 +1586,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1563,6 +1642,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1622,6 +1705,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1823,6 +1910,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1873,6 +1964,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1887,6 +1982,14 @@ var undirectedGraphTyped = (() => {
     get first() {
       return this.length > 0 ? this.elements[this._offset] : void 0;
     }
+    /**
+     * Peek at the front element without removing it (alias for `first`).
+     * @remarks Time O(1), Space O(1)
+     * @returns Front element or undefined.
+     */
+    peek() {
+      return this.first;
+    }
     /**
      * Get the last element (back) without removing it.
      * @remarks Time O(1), Space O(1)
@@ -1939,6 +2042,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2001,6 +2108,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2070,6 +2181,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2129,6 +2244,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2181,6 +2300,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2232,6 +2355,21 @@ var undirectedGraphTyped = (() => {
       this._elements[this._offset + index] = newElement;
       return true;
     }
+    /**
+     * Delete the first element that satisfies a predicate.
+     * @remarks Time O(N), Space O(N)
+     * @param predicate - Function (value, index, queue) → boolean to decide deletion.
+     * @returns True if a match was removed.
+     */
+    deleteWhere(predicate) {
+      for (let i = 0; i < this.length; i++) {
+        if (predicate(this._elements[this._offset + i], i, this)) {
+          this.deleteAt(i);
+          return true;
+        }
+      }
+      return false;
+    }
     /**
      * Reverse the queue in-place by compacting then reversing.
      * @remarks Time O(N), Space O(N)
@@ -2274,6 +2412,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2320,6 +2462,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2389,6 +2535,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2442,6 +2592,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2499,6 +2653,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3618,6 +3776,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3703,6 +3865,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3787,6 +3953,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3886,6 +4056,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3940,6 +4114,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4064,6 +4242,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4210,6 +4392,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4278,6 +4464,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4328,6 +4518,10 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
+