directed-graph-typed 2.5.2 → 2.6.0

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

@@ -435,6 +435,35 @@ var directedGraphTyped = (() => {
       for (const ele of this) if (ele === element) return true;
       return false;
     }
+    /**
+     * Check whether a value exists (Array-compatible alias for `has`).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+     * @param element - Element to search for (uses `===`).
+     * @returns `true` if found.
+     */
+    includes(element) {
+      return this.has(element);
+    }
+    /**
+     * Return an iterator of `[index, value]` pairs (Array-compatible).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+     */
+    *entries() {
+      let index = 0;
+      for (const value of this) {
+        yield [index++, value];
+      }
+    }
+    /**
+     * Return an iterator of numeric indices (Array-compatible).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+     */
+    *keys() {
+      let index = 0;
+      for (const _ of this) {
+        yield index++;
+      }
+    }
     /**
      * Reduces all elements to a single accumulated value.
      *
@@ -694,6 +723,16 @@ var directedGraphTyped = (() => {
       }
       return this;
     }
+    /**
+     * Return a new instance of the same type with elements in reverse order (non-mutating).
+     * @remarks Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+     * @returns A new reversed instance.
+     */
+    toReversed() {
+      const cloned = this.clone();
+      cloned.reverse();
+      return cloned;
+    }
   };
 
   // src/data-structures/heap/heap.ts
@@ -763,6 +802,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -820,7 +866,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.
       
@@ -850,6 +896,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -907,6 +960,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -971,6 +1031,40 @@ 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.
       
       
       
@@ -1001,6 +1095,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();
@@ -1041,6 +1143,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1141,6 +1250,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1188,6 +1304,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1205,16 +1328,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)
@@ -1238,6 +1351,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1285,6 +1405,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1309,7 +1436,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 +1446,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 +1468,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 {
@@ -1378,6 +1511,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1458,6 +1598,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1511,6 +1658,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1563,6 +1717,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1622,6 +1783,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1823,6 +1991,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1873,6 +2048,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1890,6 +2072,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)
@@ -1939,6 +2129,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2001,6 +2198,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2070,6 +2274,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2129,6 +2340,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2181,6 +2399,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2235,6 +2460,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)
@@ -2274,6 +2514,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2320,6 +2567,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2389,6 +2643,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2442,6 +2703,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2499,6 +2767,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3629,6 +3904,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3717,6 +3999,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3803,6 +4092,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3880,6 +4176,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3934,6 +4237,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4041,6 +4351,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4129,6 +4446,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4179,6 +4503,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4282,6 +4613,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4388,6 +4726,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+