binary-tree-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/binary-tree-typed.js

@@ -27,7 +27,8 @@ var binaryTreeTyped = (() => {
     BinaryTreeNode: () => BinaryTreeNode,
     DFSOperation: () => DFSOperation,
     ERR: () => ERR,
-    Range: () => Range
+    Range: () => Range,
+    raise: () => raise
   });
 
   // src/utils/utils.ts
@@ -81,6 +82,57 @@ var binaryTreeTyped = (() => {
     return (...args) => trampoline(fn(...args));
   }
 
+  // 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}].`,
+    invalidIndex: (ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`,
+    // Type / argument
+    invalidArgument: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
+    comparatorRequired: (ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`,
+    invalidKey: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
+    notAFunction: (name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`,
+    invalidEntry: (ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`,
+    invalidNaN: (ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`,
+    invalidDate: (ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`,
+    reduceEmpty: (ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`,
+    callbackReturnType: (expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`,
+    // State / operation
+    invalidOperation: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
+    // Matrix
+    matrixDimensionMismatch: (op) => `Matrix: Dimensions must be compatible for ${op}.`,
+    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}.`,
+    // Order statistic
+    orderStatisticNotEnabled: (method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`
+  };
+
+  // src/common/index.ts
+  var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
+    DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
+    DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
+    return DFSOperation2;
+  })(DFSOperation || {});
+  var Range = class {
+    constructor(low, high, includeLow = true, includeHigh = true) {
+      this.low = low;
+      this.high = high;
+      this.includeLow = includeLow;
+      this.includeHigh = includeHigh;
+    }
+    // Determine whether a key is within the range
+    isInRange(key, comparator) {
+      const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
+      const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
+      return lowCheck && highCheck;
+    }
+  };
+
   // src/data-structures/base/iterable-element-base.ts
   var IterableElementBase = class {
     /**
@@ -103,7 +155,7 @@ var binaryTreeTyped = (() => {
       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");
       }
     }
     /**
@@ -259,7 +311,7 @@ var binaryTreeTyped = (() => {
         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;
       }
@@ -491,52 +543,6 @@ var binaryTreeTyped = (() => {
     }
   };
 
-  // src/common/error.ts
-  var ERR = {
-    // Range / index
-    indexOutOfRange: (index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`,
-    invalidIndex: (ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`,
-    // Type / argument
-    invalidArgument: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
-    comparatorRequired: (ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`,
-    invalidKey: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
-    notAFunction: (name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`,
-    invalidEntry: (ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`,
-    invalidNaN: (ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`,
-    invalidDate: (ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`,
-    reduceEmpty: (ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`,
-    callbackReturnType: (expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`,
-    // State / operation
-    invalidOperation: (reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`,
-    // Matrix
-    matrixDimensionMismatch: (op) => `Matrix: Dimensions must be compatible for ${op}.`,
-    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}.`
-  };
-
-  // src/common/index.ts
-  var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
-    DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
-    DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
-    return DFSOperation2;
-  })(DFSOperation || {});
-  var Range = class {
-    constructor(low, high, includeLow = true, includeHigh = true) {
-      this.low = low;
-      this.high = high;
-      this.includeLow = includeLow;
-      this.includeHigh = includeHigh;
-    }
-    // Determine whether a key is within the range
-    isInRange(key, comparator) {
-      const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
-      const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
-      return lowCheck && highCheck;
-    }
-  };
-
   // src/data-structures/base/iterable-entry-base.ts
   var IterableEntryBase = class {
     /**
@@ -801,6 +807,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -848,6 +857,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -911,6 +923,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -970,6 +985,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1036,6 +1054,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1092,6 +1113,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1141,6 +1165,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1231,6 +1258,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1274,6 +1304,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1340,6 +1373,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1390,6 +1426,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1444,6 +1483,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1712,7 +1754,7 @@ var binaryTreeTyped = (() => {
         if (isMapMode !== void 0) this._isMapMode = isMapMode;
         if (isDuplicate !== void 0) this._isDuplicate = isDuplicate;
         if (typeof toEntryFn === "function") this._toEntryFn = toEntryFn;
-        else if (toEntryFn) throw new TypeError(ERR.notAFunction("toEntryFn", "BinaryTree"));
+        else if (toEntryFn) raise(TypeError, ERR.notAFunction("toEntryFn", "BinaryTree"));
       }
       if (keysNodesEntriesOrRaws) this.setMany(keysNodesEntriesOrRaws);
     }
@@ -1945,6 +1987,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1996,6 +2041,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2099,6 +2147,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2138,6 +2189,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2198,6 +2252,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2257,6 +2314,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2394,6 +2454,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2449,6 +2512,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2507,6 +2573,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2552,6 +2621,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2606,6 +2678,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2687,6 +2762,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -2745,6 +2823,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3219,6 +3300,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3268,6 +3352,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3321,6 +3408,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -3399,6 +3489,9 @@ var binaryTreeTyped = (() => {
       
       
       
+      
+      
+