directed-graph-typed 2.5.2 → 2.5.3

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

@@ -766,6 +766,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -820,7 +824,7 @@ var directedGraphTyped = (() => {
     }
     /**
       * 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.
       
@@ -853,6 +857,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -910,6 +918,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -974,6 +986,37 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+       * @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 {
@@ -1001,6 +1044,14 @@ var directedGraphTyped = (() => {
     *     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();
@@ -1044,6 +1095,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1144,6 +1199,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1191,6 +1250,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1205,16 +1268,6 @@ var directedGraphTyped = (() => {
     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)
@@ -1241,6 +1294,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1288,6 +1345,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1309,7 +1370,7 @@ var directedGraphTyped = (() => {
       }
       if (index < 0) return false;
       if (index === 0) {
-        this.poll();
+        this.pop();
       } else if (index === this.elements.length - 1) {
         this.elements.pop();
       } else {
@@ -1319,13 +1380,19 @@ var directedGraphTyped = (() => {
       }
       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)) {
@@ -1335,7 +1402,7 @@ var directedGraphTyped = (() => {
       }
       if (idx < 0) return false;
       if (idx === 0) {
-        this.poll();
+        this.pop();
       } else if (idx === this.elements.length - 1) {
         this.elements.pop();
       } else {
@@ -1381,6 +1448,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1461,6 +1532,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1514,6 +1589,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1566,6 +1645,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1625,6 +1708,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1826,6 +1913,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1876,6 +1967,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1890,6 +1985,14 @@ var directedGraphTyped = (() => {
     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)
@@ -1942,6 +2045,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2004,6 +2111,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2073,6 +2184,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2132,6 +2247,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2184,6 +2303,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2235,6 +2358,21 @@ var directedGraphTyped = (() => {
       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)
@@ -2277,6 +2415,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2323,6 +2465,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2392,6 +2538,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2445,6 +2595,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2502,6 +2656,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3632,6 +3790,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3720,6 +3882,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3806,6 +3972,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3883,6 +4053,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3937,6 +4111,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4044,6 +4222,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4132,6 +4314,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4182,6 +4368,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4285,6 +4475,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4391,6 +4585,10 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+