data-structure-typed 2.5.1 → 2.5.2

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

@@ -60,6 +60,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -193,6 +197,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -342,6 +366,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -391,6 +435,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -518,6 +566,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -570,6 +638,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -706,6 +778,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -756,6 +848,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -789,6 +885,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -922,6 +1022,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1075,6 +1195,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1124,6 +1264,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1157,6 +1301,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1296,6 +1444,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1346,6 +1514,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1380,6 +1552,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1414,6 +1590,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1449,6 +1629,10 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1558,6 +1742,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1680,6 +1880,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1802,6 +2018,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1923,6 +2155,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2069,6 +2317,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2221,6 +2489,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2373,6 +2661,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2525,6 +2833,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2680,6 +3008,24 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2700,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.
@@ -2804,6 +3197,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2952,6 +3361,26 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+