max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -182,6 +182,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -342,6 +357,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -521,6 +551,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -691,6 +736,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -861,6 +921,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1020,6 +1095,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1172,6 +1262,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1326,6 +1431,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1479,6 +1599,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1633,6 +1768,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1789,6 +1939,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1944,6 +2109,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2097,6 +2277,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2247,6 +2442,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2397,6 +2607,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2548,6 +2773,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2700,6 +2940,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2852,6 +3107,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2904,6 +3174,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
      
      
      
@@ -2966,6 +3239,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
      
      
      
@@ -3012,6 +3288,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
      
      
      
@@ -3060,6 +3339,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
      
      
      
@@ -3189,6 +3471,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3346,6 +3640,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3487,6 +3793,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3628,6 +3946,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3770,6 +4100,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3815,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)
@@ -3946,6 +4340,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+