undirected-graph-typed 2.5.2 → 2.5.3

package/dist/esm/index.mjs

@@ -739,6 +739,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -792,7 +796,7 @@ var Heap = class _Heap extends IterableElementBase {
   }
   /**
     * 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.
     
@@ -825,6 +829,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -882,6 +890,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -942,10 +954,41 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
     
+     * @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 {
@@ -973,6 +1016,14 @@ var Heap = class _Heap extends IterableElementBase {
   *     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();
@@ -1016,6 +1067,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1116,6 +1171,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1163,6 +1222,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1177,16 +1240,6 @@ var Heap = class _Heap extends IterableElementBase {
   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)
@@ -1213,6 +1266,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1260,6 +1317,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1281,7 +1342,7 @@ var Heap = class _Heap extends IterableElementBase {
     }
     if (index < 0) return false;
     if (index === 0) {
-      this.poll();
+      this.pop();
     } else if (index === this.elements.length - 1) {
       this.elements.pop();
     } else {
@@ -1291,13 +1352,19 @@ var Heap = class _Heap extends IterableElementBase {
     }
     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)) {
@@ -1307,7 +1374,7 @@ var Heap = class _Heap extends IterableElementBase {
     }
     if (idx < 0) return false;
     if (idx === 0) {
-      this.poll();
+      this.pop();
     } else if (idx === this.elements.length - 1) {
       this.elements.pop();
     } else {
@@ -1353,6 +1420,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1433,6 +1504,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1486,6 +1561,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1538,6 +1617,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1597,6 +1680,10 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1810,6 +1897,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1860,6 +1951,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1874,6 +1969,14 @@ var Queue = class _Queue extends LinearBase {
   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)
@@ -1926,6 +2029,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1988,6 +2095,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2057,6 +2168,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2116,6 +2231,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2168,6 +2287,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2219,6 +2342,21 @@ var Queue = class _Queue extends LinearBase {
     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)
@@ -2261,6 +2399,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2307,6 +2449,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2376,6 +2522,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2429,6 +2579,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2486,6 +2640,10 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3614,6 +3772,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3698,6 +3860,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3782,6 +3948,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3880,6 +4050,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3934,6 +4108,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -4058,6 +4236,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -4204,6 +4386,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -4272,6 +4458,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -4322,6 +4512,10 @@ var UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
+