binary-tree-typed 2.5.1 → 2.5.2

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

@@ -178,6 +178,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -329,6 +344,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -375,6 +405,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -409,6 +442,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -584,6 +620,24 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -773,6 +827,24 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -924,6 +996,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1109,6 +1196,24 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1299,6 +1404,24 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1349,6 +1472,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1383,6 +1509,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1418,6 +1547,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1567,6 +1699,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1721,6 +1868,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1767,6 +1929,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1801,6 +1966,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1835,6 +2003,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -1900,6 +2071,12 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1967,6 +2144,12 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2005,6 +2188,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -2042,6 +2228,9 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
      
      
      
@@ -2188,6 +2377,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2346,6 +2550,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2475,6 +2694,18 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2600,6 +2831,18 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2751,6 +2994,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2904,6 +3162,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3060,6 +3333,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3216,6 +3504,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3370,6 +3673,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3517,6 +3835,21 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3644,6 +3977,18 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3799,6 +4144,19 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3814,13 +4172,60 @@ export declare class TreeMultiMap<K = any, V = any, R = any> implements Iterable
      
      
       * @example
-   * // Deep clone
-   *  const mm = new TreeMultiMap<number, string>();
-   *       mm.add(1, 'a');
-   *       const copy = mm.clone();
-   *       copy.delete(1);
-   *       console.log(mm.has(1)); // true;
+   * // Order-statistic on BST
+   *  const tree = new TreeMultiMap<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, V[]] | undefined;
+    /**
+   * Get the rank of a key in sorted order
+   * @example
+ * // Get the rank of a key in sorted order
+ *  const tree = new TreeMultiMap<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 TreeMultiMap<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): Array<[K, V[]]>;
+    /**
+   * Deep copy
+  
+   
+   
+   
+    * @example
+ * // Deep clone
+ *  const mm = new TreeMultiMap<number, string>();
+ *       mm.add(1, 'a');
+ *       const copy = mm.clone();
+ *       copy.delete(1);
+ *       console.log(mm.has(1)); // true;
+   */
     clone(): TreeMultiMap<K, V, R>;
     /**
      * Expose comparator for advanced usage/testing (read-only).