directed-graph-typed 2.5.1 → 2.5.3

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

@@ -31,7 +31,8 @@ var directedGraphTyped = (() => {
     DirectedGraph: () => DirectedGraph,
     DirectedVertex: () => DirectedVertex,
     ERR: () => ERR,
-    Range: () => Range
+    Range: () => Range,
+    raise: () => raise
   });
 
   // src/utils/utils.ts
@@ -56,6 +57,9 @@ var directedGraphTyped = (() => {
   };
 
   // src/common/error.ts
+  function raise(ErrorClass, message) {
+    throw new ErrorClass(message);
+  }
   var ERR = {
     // Range / index
     indexOutOfRange: (index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`,
@@ -77,7 +81,9 @@ var directedGraphTyped = (() => {
     matrixSingular: () => "Matrix: Singular matrix, inverse does not exist.",
     matrixNotSquare: () => "Matrix: Must be square for inversion.",
     matrixNotRectangular: () => "Matrix: Must be rectangular for transposition.",
-    matrixRowMismatch: (expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`
+    matrixRowMismatch: (expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`,
+    // Order statistic
+    orderStatisticNotEnabled: (method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`
   };
 
   // src/common/index.ts
@@ -302,7 +308,7 @@ var directedGraphTyped = (() => {
       if (options) {
         const { toElementFn } = options;
         if (typeof toElementFn === "function") this._toElementFn = toElementFn;
-        else if (toElementFn) throw new TypeError("toElementFn must be a function type");
+        else if (toElementFn) raise(TypeError, "toElementFn must be a function type");
       }
     }
     /**
@@ -458,7 +464,7 @@ var directedGraphTyped = (() => {
         acc = initialValue;
       } else {
         const first = iter.next();
-        if (first.done) throw new TypeError("Reduce of empty structure with no initial value");
+        if (first.done) raise(TypeError, "Reduce of empty structure with no initial value");
         acc = first.value;
         index = 1;
       }
@@ -705,7 +711,7 @@ var directedGraphTyped = (() => {
       __publicField(this, "_elements", []);
       __publicField(this, "_DEFAULT_COMPARATOR", (a, b) => {
         if (typeof a === "object" || typeof b === "object") {
-          throw new TypeError(ERR.comparatorRequired("Heap"));
+          raise(TypeError, ERR.comparatorRequired("Heap"));
         }
         if (a > b) return 1;
         if (a < b) return -1;
@@ -754,6 +760,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -811,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.
       
@@ -838,6 +851,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -892,6 +912,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -949,6 +976,12 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
       
       
       
@@ -956,6 +989,34 @@ 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 {
@@ -983,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();
@@ -1020,6 +1089,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1117,6 +1193,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1161,6 +1244,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1178,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)
@@ -1208,6 +1288,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1252,6 +1339,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1276,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 {
@@ -1286,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)) {
@@ -1302,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 {
@@ -1342,6 +1442,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1419,6 +1526,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1469,6 +1583,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1518,6 +1639,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1574,6 +1702,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1590,7 +1725,7 @@ var directedGraphTyped = (() => {
       */
     map(callback, options, thisArg) {
       const { comparator, toElementFn, ...rest } = options != null ? options : {};
-      if (!comparator) throw new TypeError(ERR.comparatorRequired("Heap.map"));
+      if (!comparator) raise(TypeError, ERR.comparatorRequired("Heap.map"));
       const out = this._createLike([], { ...rest, comparator, toElementFn });
       let i = 0;
       for (const x of this) {
@@ -1772,6 +1907,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1819,6 +1961,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1836,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)
@@ -1882,6 +2039,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1941,6 +2105,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2007,6 +2178,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2063,6 +2241,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2112,6 +2297,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2166,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)
@@ -2202,6 +2409,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2245,6 +2459,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2311,6 +2532,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2361,6 +2589,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2415,6 +2650,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2651,7 +2893,7 @@ var directedGraphTyped = (() => {
           const newEdge = this.createEdge(srcOrEdge, dest, weight, value);
           return this._addEdge(newEdge);
         } else {
-          throw new TypeError(ERR.invalidArgument("dest must be a Vertex or vertex key when srcOrEdge is an Edge.", "Graph"));
+          raise(TypeError, ERR.invalidArgument("dest must be a Vertex or vertex key when srcOrEdge is an Edge.", "Graph"));
         }
       }
     }
@@ -3542,6 +3784,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3627,6 +3876,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3710,6 +3966,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3784,6 +4047,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3835,6 +4105,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3939,6 +4216,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4024,6 +4308,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4071,6 +4362,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4171,6 +4469,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4274,6 +4579,13 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+