max-priority-queue-typed 2.5.1 → 2.5.3

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

@@ -198,14 +198,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Check empty
-   *  console.log(new TreeMap().isEmpty()); // true;
-     */
-    isEmpty(): boolean;
-    /**
-     * Set or overwrite a value for a key.
-     * @remarks Expected time O(log n)
      
      
      
@@ -241,6 +233,15 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Check empty
+   *  console.log(new TreeMap().isEmpty()); // true;
+     */
+    isEmpty(): boolean;
+    /**
+     * Set or overwrite a value for a key.
+     * @remarks Expected time O(log n)
+     
      
      
      
@@ -358,31 +359,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Sorted dictionary for a contact book
-   *  const contacts = new TreeMap<string, string>([
-   *       ['Bob', '555-0102'],
-   *       ['Alice', '555-0101'],
-   *       ['Charlie', '555-0103']
-   *     ]);
-   *
-   *     // Contacts are automatically sorted by name
-   *     console.log([...contacts.keys()]); // ['Alice', 'Bob', 'Charlie'];
-   *     console.log(contacts.get('Bob')); // '555-0102';
-   *
-   *     // Find the first contact alphabetically after 'B'
-   *     console.log(contacts.ceiling('B')); // ['Bob', '555-0102'];
-   *
-   *     // Find contacts in range
-   *     console.log(contacts.rangeSearch(['Alice', 'Bob'])); // [
-   *  //      ['Alice', '555-0101'],
-   *  //      ['Bob', '555-0102']
-   *  //    ];
-     */
-    set(key: K, value: V | undefined): this;
-    /**
-     * Get the value under a key.
-     * @remarks Expected time O(log n)
      
      
      
@@ -452,6 +428,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Sorted dictionary for a contact book
+   *  const contacts = new TreeMap<string, string>([
+   *       ['Bob', '555-0102'],
+   *       ['Alice', '555-0101'],
+   *       ['Charlie', '555-0103']
+   *     ]);
+   *
+   *     // Contacts are automatically sorted by name
+   *     console.log([...contacts.keys()]); // ['Alice', 'Bob', 'Charlie'];
+   *     console.log(contacts.get('Bob')); // '555-0102';
+   *
+   *     // Find the first contact alphabetically after 'B'
+   *     console.log(contacts.ceiling('B')); // ['Bob', '555-0102'];
+   *
+   *     // Find contacts in range
+   *     console.log(contacts.rangeSearch(['Alice', 'Bob'])); // [
+   *  //      ['Alice', '555-0101'],
+   *  //      ['Bob', '555-0102']
+   *  //    ];
+     */
+    set(key: K, value: V | undefined): this;
+    /**
+     * Set multiple key-value pairs at once.
+     * @remarks Expected time O(m log n), where m is the number of entries.
+     * @param entries - Iterable of `[key, value]` tuples.
+     * @returns Array of booleans indicating whether each entry was successfully set.
+    
      
      
      
@@ -467,6 +471,16 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Set multiple key-value pairs
+   *  const tm = new TreeMap<number, string>();
+   *     tm.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+   *     console.log(tm.size); // 3;
+     */
+    setMany(entries: Iterable<[K, V | undefined]>): boolean[];
+    /**
+     * Get the value under a key.
+     * @remarks Expected time O(log n)
      
      
      
@@ -537,22 +551,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Configuration registry with typed lookups
-   *  const config = new TreeMap<string, number>([
-   *       ['maxRetries', 3],
-   *       ['timeout', 5000],
-   *       ['poolSize', 10]
-   *     ]);
-   *
-   *     console.log(config.get('timeout')); // 5000;
-   *     console.log(config.get('missing')); // undefined;
-   *     console.log(config.size); // 3;
-     */
-    get(key: K): V | undefined;
-    /**
-     * Test whether a key exists.
-     * @remarks Expected time O(log n)
      
      
      
@@ -672,6 +670,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Configuration registry with typed lookups
+   *  const config = new TreeMap<string, number>([
+   *       ['maxRetries', 3],
+   *       ['timeout', 5000],
+   *       ['poolSize', 10]
+   *     ]);
+   *
+   *     console.log(config.get('timeout')); // 5000;
+   *     console.log(config.get('missing')); // undefined;
+   *     console.log(config.size); // 3;
+     */
+    get(key: K): V | undefined;
+    /**
+     * Test whether a key exists.
+     * @remarks Expected time O(log n)
      
      
      
@@ -707,22 +721,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Feature flag checking
-   *  const flags = new TreeMap<string, boolean>([
-   *       ['darkMode', true],
-   *       ['betaFeature', false],
-   *       ['notifications', true]
-   *     ]);
-   *
-   *     console.log(flags.has('darkMode')); // true;
-   *     console.log(flags.has('unknownFlag')); // false;
-     */
-    has(key: K): boolean;
-    /**
-     * Delete a key.
-     * @returns `true` if the key existed; otherwise `false`.
-     * @remarks Expected time O(log n)
      
      
      
@@ -878,22 +876,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
       * @example
-   * // Session management with expiry
-   *  const sessions = new TreeMap<string, number>([
-   *       ['sess_abc', Date.now()],
-   *       ['sess_def', Date.now()],
-   *       ['sess_ghi', Date.now()]
+   * // Feature flag checking
+   *  const flags = new TreeMap<string, boolean>([
+   *       ['darkMode', true],
+   *       ['betaFeature', false],
+   *       ['notifications', true]
    *     ]);
    *
-   *     console.log(sessions.size); // 3;
-   *     sessions.delete('sess_def');
-   *     console.log(sessions.has('sess_def')); // false;
-   *     console.log(sessions.size); // 2;
+   *     console.log(flags.has('darkMode')); // true;
+   *     console.log(flags.has('unknownFlag')); // false;
      */
-    delete(key: K): boolean;
+    has(key: K): boolean;
     /**
-     * Remove all entries.
-     
+     * Delete a key.
+     * @returns `true` if the key existed; otherwise `false`.
+     * @remarks Expected time O(log n)
      
      
      
@@ -1036,15 +1033,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Remove all
-   *  const tm = new TreeMap<number, string>([[1, 'a']]);
-   *       tm.clear();
-   *       console.log(tm.isEmpty()); // true;
-     */
-    clear(): void;
-    /**
-     * Iterate over keys in ascending order.
      
      
      
@@ -1092,6 +1080,29 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Session management with expiry
+   *  const sessions = new TreeMap<string, number>([
+   *       ['sess_abc', Date.now()],
+   *       ['sess_def', Date.now()],
+   *       ['sess_ghi', Date.now()]
+   *     ]);
+   *
+   *     console.log(sessions.size); // 3;
+   *     sessions.delete('sess_def');
+   *     console.log(sessions.has('sess_def')); // false;
+   *     console.log(sessions.size); // 2;
+     */
+    delete(key: K): boolean;
+    /**
+     * Delete all entries matching a predicate.
+     * @remarks Time O(N), Space O(N)
+     * @param predicate - Function (key, value, index, map) → boolean; return true to delete.
+     * @returns True if at least one entry was deleted.
+     */
+    deleteWhere(predicate: (key: K, value: V | undefined, index: number, map: this) => boolean): boolean;
+    /**
+     * Remove all entries.
      
      
      
@@ -1188,17 +1199,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Get sorted keys
-   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a']]);
-   *       console.log([...tm.keys()]); // [1, 3];
-     */
-    keys(): IterableIterator<K>;
-    private _entryFromKey;
-    /**
-     * Iterate over values in ascending key order.
-     *
-     * Note: values may be `undefined` (TreeMap allows storing `undefined`, like native `Map`).
      
      
      
@@ -1281,6 +1281,15 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Remove all
+   *  const tm = new TreeMap<number, string>([[1, 'a']]);
+   *       tm.clear();
+   *       console.log(tm.isEmpty()); // true;
+     */
+    clear(): void;
+    /**
+     * Iterate over keys in ascending order.
      
      
      
@@ -1342,16 +1351,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Get values in key order
-   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
-   *       console.log([...tm.values()]); // ['a', 'b'];
-     */
-    values(): IterableIterator<V | undefined>;
-    /**
-     * Iterate over `[key, value]` entries in ascending key order.
-     *
-     * Note: values may be `undefined`.
      
      
      
@@ -1469,6 +1468,17 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Get sorted keys
+   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a']]);
+   *       console.log([...tm.keys()]); // [1, 3];
+     */
+    keys(): IterableIterator<K>;
+    private _entryFromKey;
+    /**
+     * Iterate over values in ascending key order.
+     *
+     * Note: values may be `undefined` (TreeMap allows storing `undefined`, like native `Map`).
      
      
      
@@ -1495,17 +1505,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Iterate key-value pairs
-   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a'], [2, 'b']]);
-   *       console.log([...tm.entries()]); // [[1, 'a'], [2, 'b'], [3, 'c']];
-     */
-    entries(): IterableIterator<[K, V | undefined]>;
-    [Symbol.iterator](): IterableIterator<[K, V | undefined]>;
-    /**
-     * Visit each entry in ascending key order.
-     *
-     * Note: callback value may be `undefined`.
      
      
      
@@ -1649,19 +1648,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Execute for each entry
-   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
-   *       const pairs: string[] = [];
-   *       tm.forEach((v, k) => pairs.push(`${k}:${v}`));
-   *       console.log(pairs); // ['1:a', '2:b'];
-     */
-    forEach(cb: (value: V | undefined, key: K, map: TreeMap<K, V>) => void, thisArg?: unknown): void;
-    /**
-     * Create a new TreeMap by mapping each entry to a new `[key, value]` entry.
-     *
-     * This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
-     * @remarks Time O(n log n) expected, Space O(n)
      
      
      
@@ -1671,6 +1657,16 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Get values in key order
+   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
+   *       console.log([...tm.values()]); // ['a', 'b'];
+     */
+    values(): IterableIterator<V | undefined>;
+    /**
+     * Iterate over `[key, value]` entries in ascending key order.
+     *
+     * Note: values may be `undefined`.
      
      
      
@@ -1805,18 +1801,477 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Transform entries
-   *  const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
-   *       const doubled = tm.map((v, k) => [k, (v ?? 0) * 2] as [number, number]);
-   *       console.log([...doubled.values()]); // [20, 40];
-     */
-    map<MK, MV>(callbackfn: TreeMapEntryCallback<K, V, [MK, MV], TreeMap<K, V>>, options?: Omit<TreeMapOptions<MK, MV>, 'toEntryFn'> & {
-        comparator?: (a: MK, b: MK) => number;
-    }, thisArg?: unknown): TreeMap<MK, MV>;
-    /**
-     * Create a new TreeMap containing only entries that satisfy the predicate.
-     * @remarks Time O(n log n) expected, Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Iterate key-value pairs
+   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a'], [2, 'b']]);
+   *       console.log([...tm.entries()]); // [[1, 'a'], [2, 'b'], [3, 'c']];
+     */
+    entries(): IterableIterator<[K, V | undefined]>;
+    [Symbol.iterator](): IterableIterator<[K, V | undefined]>;
+    /**
+     * Visit each entry in ascending key order.
+     *
+     * Note: callback value may be `undefined`.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Execute for each entry
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       const pairs: string[] = [];
+   *       tm.forEach((v, k) => pairs.push(`${k}:${v}`));
+   *       console.log(pairs); // ['1:a', '2:b'];
+     */
+    forEach(cb: (value: V | undefined, key: K, map: TreeMap<K, V>) => void, thisArg?: unknown): void;
+    /**
+     * Create a new TreeMap by mapping each entry to a new `[key, value]` entry.
+     *
+     * This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
+     * @remarks Time O(n log n) expected, Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Transform entries
+   *  const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
+   *       const doubled = tm.map((v, k) => [k, (v ?? 0) * 2] as [number, number]);
+   *       console.log([...doubled.values()]); // [20, 40];
+     */
+    map<MK, MV>(callbackfn: TreeMapEntryCallback<K, V, [MK, MV], TreeMap<K, V>>, options?: Omit<TreeMapOptions<MK, MV>, 'toEntryFn'> & {
+        comparator?: (a: MK, b: MK) => number;
+    }, thisArg?: unknown): TreeMap<MK, MV>;
+    /**
+     * Create a new TreeMap containing only entries that satisfy the predicate.
+     * @remarks Time O(n log n) expected, Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2092,6 +2547,41 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2242,6 +2732,41 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2392,6 +2917,41 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2564,15 +3124,120 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Find matching entry
-   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
-   *       console.log(tm.find(v => v === 'b')?.[0]); // 2;
-     */
-    find(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): [K, V | undefined] | undefined;
-    /**
-     * Materialize the map into an array of `[key, value]` tuples.
-     * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Find matching entry
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       console.log(tm.find(v => v === 'b')?.[0]); // 2;
+     */
+    find(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): [K, V | undefined] | undefined;
+    /**
+     * Materialize the map into an array of `[key, value]` tuples.
+     * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2681,6 +3346,15 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+      * @example
+   * // Convert to array
+   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
+   *       console.log(tm.toArray()); // [[1, 'a'], [2, 'b']];
+     */
+    toArray(): Array<[K, V | undefined]>;
+    /**
+     * Print a human-friendly representation.
+     * @remarks Time O(n), Space O(n)
      
      
      
@@ -2716,15 +3390,6 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
-      * @example
-   * // Convert to array
-   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
-   *       console.log(tm.toArray()); // [[1, 'a'], [2, 'b']];
-     */
-    toArray(): Array<[K, V | undefined]>;
-    /**
-     * Print a human-friendly representation.
-     * @remarks Time O(n), Space O(n)
      
      
      
@@ -2900,6 +3565,13 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2962,6 +3634,13 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3008,6 +3687,13 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3056,6 +3742,13 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3181,6 +3874,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3338,6 +4059,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3479,6 +4228,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3620,6 +4397,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3762,6 +4567,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3815,6 +4648,66 @@ 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 by position in tree order
+   *  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)
@@ -3941,6 +4834,41 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+