graph-typed 2.5.1 → 2.5.2

package/dist/esm-legacy/index.mjs

@@ -25,6 +25,10 @@ var arrayRemove = /* @__PURE__ */ __name(function(array, predicate) {
 }, "arrayRemove");
 
 // src/common/error.ts
+function raise(ErrorClass, message) {
+  throw new ErrorClass(message);
+}
+__name(raise, "raise");
 var ERR = {
   // Range / index
   indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
@@ -46,7 +50,9 @@ var ERR = {
   matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
   matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
   matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
-  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch")
+  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch"),
+  // Order statistic
+  orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
 };
 
 // src/common/index.ts
@@ -275,7 +281,7 @@ var _IterableElementBase = class _IterableElementBase {
     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");
     }
   }
   /**
@@ -431,7 +437,7 @@ var _IterableElementBase = class _IterableElementBase {
       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;
     }
@@ -682,7 +688,7 @@ var _Heap = class _Heap extends IterableElementBase {
     __publicField(this, "_elements", []);
     __publicField(this, "_DEFAULT_COMPARATOR", /* @__PURE__ */ __name((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;
@@ -735,6 +741,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -819,6 +828,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -873,6 +885,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -929,6 +944,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1001,6 +1019,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1098,6 +1119,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1142,6 +1166,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1189,6 +1216,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1233,6 +1263,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1323,6 +1356,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1400,6 +1436,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1450,6 +1489,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1499,6 +1541,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1555,6 +1600,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1567,7 +1615,7 @@ var _Heap = class _Heap extends IterableElementBase {
     */
   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) {
@@ -1755,6 +1803,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1802,6 +1853,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1865,6 +1919,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1924,6 +1981,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1990,6 +2050,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2046,6 +2109,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2095,6 +2161,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2185,6 +2254,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2228,6 +2300,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2294,6 +2369,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2344,6 +2422,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2398,6 +2479,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2636,7 +2720,7 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
         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"));
       }
     }
   }
@@ -3537,6 +3621,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -3622,6 +3709,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -3705,6 +3795,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -3779,6 +3872,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -3830,6 +3926,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -3934,6 +4033,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4019,6 +4121,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4066,6 +4171,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4166,6 +4274,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4269,6 +4380,9 @@ var _DirectedGraph = class _DirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4436,6 +4550,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4518,6 +4635,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4599,6 +4719,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4695,6 +4818,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4746,6 +4872,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -4867,6 +4996,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -5010,6 +5142,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -5075,6 +5210,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -5122,6 +5260,9 @@ var _UndirectedGraph = class _UndirectedGraph extends AbstractGraph {
     
     
     
+    
+    
+    
     
     
     
@@ -5284,6 +5425,6 @@ var MapGraph = _MapGraph;
  * @license MIT License
  */
 
-export { AbstractEdge, AbstractGraph, AbstractVertex, DFSOperation, DirectedEdge, DirectedGraph, DirectedVertex, ERR, MapEdge, MapGraph, MapVertex, Range, UndirectedEdge, UndirectedGraph, UndirectedVertex };
+export { AbstractEdge, AbstractGraph, AbstractVertex, DFSOperation, DirectedEdge, DirectedGraph, DirectedVertex, ERR, MapEdge, MapGraph, MapVertex, Range, UndirectedEdge, UndirectedGraph, UndirectedVertex, raise };
 //# sourceMappingURL=index.mjs.map
 //# sourceMappingURL=index.mjs.map