data-structure-typed 2.5.1 → 2.5.2

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

@@ -172,6 +172,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -327,6 +347,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -501,6 +541,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -666,6 +726,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -831,6 +911,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -985,6 +1085,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1132,6 +1252,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1281,6 +1421,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1429,6 +1589,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1578,6 +1758,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1729,6 +1929,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1879,6 +2099,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2027,6 +2267,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2172,6 +2432,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2317,6 +2597,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2463,6 +2763,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2610,6 +2930,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2757,6 +3097,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2812,6 +3172,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2873,6 +3237,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2918,6 +3286,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -2965,6 +3337,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3087,6 +3463,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3240,6 +3632,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3377,6 +3785,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3514,6 +3938,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3652,6 +4092,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3701,6 +4157,58 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
    *     console.log(totalValue); // toBeCloseTo;
      */
     rangeSearch(range: [K, K], options?: TreeMapRangeOptions): Array<[K, V | undefined]>;
+    /**
+     * Returns the entry at the k-th position in tree order (0-indexed).
+     * @remarks Time O(log n). Requires `enableOrderStatistic: true`.
+     
+     
+     
+      * @example
+   * // Find k-th entry in a TreeMap
+   *  const map = new TreeMap<string, number>(
+   *         [['alice', 95], ['bob', 87], ['charlie', 92]],
+   *         { enableOrderStatistic: true }
+   *       );
+   *       console.log(map.getByRank(0)); // 'alice';
+   *       console.log(map.getByRank(1)); // 'bob';
+   *       console.log(map.getByRank(2)); // 'charlie';
+     */
+    getByRank(k: number): [K, V | undefined] | undefined;
+    /**
+     * Returns the 0-based rank of a key (number of elements that precede it in tree order).
+     * @remarks Time O(log n). Requires `enableOrderStatistic: true`.
+      * @example
+   * // Get the rank of a key in sorted order
+   *  const tree = new TreeMap<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;
+    /**
+     * Returns keys by rank range (0-indexed, inclusive on both ends).
+     * @remarks Time O(log n + k). Requires `enableOrderStatistic: true`.
+     
+      * @example
+   * // Pagination with rangeByRank
+   *  const tree = new TreeMap<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 | undefined]>;
     /**
      * Creates a shallow clone of this map.
      * @remarks Time O(n log n), Space O(n)
@@ -3822,6 +4330,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+