undirected-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/undirected-graph-typed.js

@@ -28,7 +28,8 @@ var undirectedGraphTyped = (() => {
     Range: () => Range,
     UndirectedEdge: () => UndirectedEdge,
     UndirectedGraph: () => UndirectedGraph,
-    UndirectedVertex: () => UndirectedVertex
+    UndirectedVertex: () => UndirectedVertex,
+    raise: () => raise
   });
 
   // src/utils/utils.ts
@@ -53,6 +54,9 @@ var undirectedGraphTyped = (() => {
   };
 
   // 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}].`,
@@ -74,7 +78,9 @@ var undirectedGraphTyped = (() => {
     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
@@ -299,7 +305,7 @@ var undirectedGraphTyped = (() => {
       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");
       }
     }
     /**
@@ -455,7 +461,7 @@ var undirectedGraphTyped = (() => {
         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;
       }
@@ -702,7 +708,7 @@ var undirectedGraphTyped = (() => {
       __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;
@@ -755,6 +761,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -839,6 +848,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -893,6 +905,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -949,6 +964,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1021,6 +1039,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1118,6 +1139,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1162,6 +1186,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1209,6 +1236,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1253,6 +1283,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1343,6 +1376,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1420,6 +1456,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1470,6 +1509,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1519,6 +1561,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1575,6 +1620,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1587,7 +1635,7 @@ var undirectedGraphTyped = (() => {
       */
     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) {
@@ -1773,6 +1821,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1820,6 +1871,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1883,6 +1937,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1942,6 +1999,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2008,6 +2068,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2064,6 +2127,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2113,6 +2179,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2203,6 +2272,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2246,6 +2318,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2312,6 +2387,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2362,6 +2440,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2416,6 +2497,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2648,7 +2732,7 @@ var undirectedGraphTyped = (() => {
           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"));
         }
       }
     }
@@ -3532,6 +3616,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3614,6 +3701,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3695,6 +3785,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3791,6 +3884,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3842,6 +3938,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3963,6 +4062,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4106,6 +4208,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4171,6 +4276,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -4218,6 +4326,9 @@ var undirectedGraphTyped = (() => {
       
       
       
+      
+      
+