directed-graph-typed 2.5.1 → 2.5.2

package/dist/types/types/data-structures/binary-tree/tree-map.d.ts

@@ -8,6 +8,11 @@ export interface TreeMapOptions<K, V, R = [K, V]> {
      * - `false`: store values on tree nodes (Node Mode).
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     * When true, subtree counts are maintained on every node.
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into `[key, value]` entries.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<[K, V]>`.

package/dist/types/types/data-structures/binary-tree/tree-multi-set.d.ts

@@ -8,6 +8,10 @@ export interface TreeMultiSetOptions<K, R = K> {
      * - `false`: Node Mode.
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into keys.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<K>`.

package/dist/types/types/data-structures/binary-tree/tree-set.d.ts

@@ -8,6 +8,10 @@ export interface TreeSetOptions<K, R = K> {
      * - `false`: store values on tree nodes (Node Mode).
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into keys.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<K>`.

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;
@@ -758,6 +764,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -842,6 +851,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -896,6 +908,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -952,6 +967,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1024,6 +1042,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1121,6 +1142,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1165,6 +1189,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1212,6 +1239,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1256,6 +1286,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1346,6 +1379,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1423,6 +1459,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1473,6 +1512,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1522,6 +1564,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1578,6 +1623,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1590,7 +1638,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) {
@@ -1776,6 +1824,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1823,6 +1874,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1886,6 +1940,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1945,6 +2002,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2011,6 +2071,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2067,6 +2130,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2116,6 +2182,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2206,6 +2275,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2249,6 +2321,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2315,6 +2390,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2365,6 +2443,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2419,6 +2500,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2651,7 +2735,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"));
         }
       }
     }
@@ -3546,6 +3630,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3631,6 +3718,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3714,6 +3804,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3788,6 +3881,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3839,6 +3935,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3943,6 +4042,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4028,6 +4130,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4075,6 +4180,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4175,6 +4283,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4278,6 +4389,9 @@ var directedGraphTyped = (() => {
       
       
       
+      
+      
+