binary-tree-typed 2.5.1 → 2.5.2

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

@@ -62,6 +62,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -204,6 +207,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -358,6 +376,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -404,6 +437,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -540,6 +576,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -589,6 +640,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -734,6 +788,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -781,6 +850,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -815,6 +887,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -957,6 +1032,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1115,6 +1205,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1161,6 +1266,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1195,6 +1303,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1343,6 +1454,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1390,6 +1516,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1425,6 +1554,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1460,6 +1592,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1496,6 +1631,9 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -1612,6 +1750,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1738,6 +1888,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1864,6 +2026,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1989,6 +2163,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2141,6 +2327,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2298,6 +2499,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2455,6 +2671,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2612,6 +2843,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2772,6 +3018,19 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2787,13 +3046,60 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Deep clone
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       const copy = ms.clone();
-   *       copy.deleteAll(1);
-   *       console.log(ms.has(1)); // true;
+   * // Order-statistic on BST
+   *  const tree = new TreeMultiSet<number>([30, 10, 50, 20, 40], { enableOrderStatistic: true });
+   *       console.log(tree.getByRank(0)); // 10;
+   *       console.log(tree.getByRank(4)); // 50;
+   *       console.log(tree.getRank(30)); // 2;
      */
+    getByRank(k: number): K | undefined;
+    /**
+   * Get the rank of a key in sorted order
+   * @example
+ * // Get the rank of a key in sorted order
+ *  const tree = new TreeMultiSet<number>(
+ *         [10, 20, 30, 40, 50],
+ *         { enableOrderStatistic: true }
+ *       );
+ *       console.log(tree.getRank(10)); // 0;  // smallest → rank 0
+ *       console.log(tree.getRank(30)); // 2;  // 2 elements before 30 in tree order
+ *       console.log(tree.getRank(50)); // 4;  // largest → rank 4
+ *       console.log(tree.getRank(25)); // 2;
+   */
+    getRank(key: K): number;
+    /**
+   * Get elements by rank range
+  
+    * @example
+ * // Pagination with rangeByRank
+ *  const tree = new TreeMultiSet<number>(
+ *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
+ *         { enableOrderStatistic: true }
+ *       );
+ *       const pageSize = 3;
+ *
+ *       // Page 1
+ *       console.log(tree.rangeByRank(0, pageSize - 1)); // [10, 20, 30];
+ *       // Page 2
+ *       console.log(tree.rangeByRank(pageSize, 2 * pageSize - 1)); // [40, 50, 60];
+ *       // Page 3
+ *       console.log(tree.rangeByRank(2 * pageSize, 3 * pageSize - 1)); // [70, 80, 90];
+   */
+    rangeByRank(start: number, end: number): K[];
+    /**
+   * Deep copy
+  
+   
+   
+   
+    * @example
+ * // Deep clone
+ *  const ms = new TreeMultiSet<number>();
+ *       ms.add(1, 3);
+ *       const copy = ms.clone();
+ *       copy.deleteAll(1);
+ *       console.log(ms.has(1)); // true;
+   */
     clone(): TreeMultiSet<K>;
     /**
      * Returns keys within the given range.
@@ -2899,6 +3205,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3053,6 +3371,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+