data-structure-typed 2.5.1 → 2.5.3

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

@@ -56,6 +56,14 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -214,19 +222,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Check empty
-   *  console.log(new TreeMultiSet().isEmpty()); // true;
-     */
-    isEmpty(): boolean;
-    /**
-     * Whether the multiset contains the given key.
-     * @remarks Time O(log n), Space O(1)
-     
-     
-     
-     
-     
      
      
      
@@ -267,6 +262,14 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Check empty
+   *  console.log(new TreeMultiSet().isEmpty()); // true;
+     */
+    isEmpty(): boolean;
+    /**
+     * Whether the multiset contains the given key.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -363,17 +366,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Check existence
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1);
-   *       console.log(ms.has(1)); // true;
-   *       console.log(ms.has(2)); // false;
-     */
-    has(key: K): boolean;
-    /**
-     * Returns the count of occurrences for the given key.
-     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -396,17 +388,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Get occurrence count
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 5);
-   *       console.log(ms.count(1)); // 5;
-     */
-    count(key: K): number;
-    /**
-     * Add `n` occurrences of `key`.
-     * @returns True if the multiset changed.
-     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -470,6 +451,17 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Check existence
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1);
+   *       console.log(ms.has(1)); // true;
+   *       console.log(ms.has(2)); // false;
+     */
+    has(key: K): boolean;
+    /**
+     * Returns the count of occurrences for the given key.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -500,6 +492,17 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Get occurrence count
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 5);
+   *       console.log(ms.count(1)); // 5;
+     */
+    count(key: K): number;
+    /**
+     * Add `n` occurrences of `key`.
+     * @returns True if the multiset changed.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -539,20 +542,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Add elements
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1);
-   *       ms.add(1);
-   *       ms.add(2);
-   *       console.log(ms.count(1)); // 2;
-   *       console.log(ms.size); // 3;
-     */
-    add(key: K, n?: number): boolean;
-    /**
-     * Set count for `key` to exactly `n`.
-     * @returns True if changed.
-     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -575,17 +564,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Set occurrence count
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.setCount(1, 3);
-   *       console.log(ms.count(1)); // 3;
-     */
-    setCount(key: K, n: number): boolean;
-    /**
-     * Delete `n` occurrences of `key` (default 1).
-     * @returns True if any occurrence was removed.
-     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -697,6 +675,20 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Add elements
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1);
+   *       ms.add(1);
+   *       ms.add(2);
+   *       console.log(ms.count(1)); // 2;
+   *       console.log(ms.size); // 3;
+     */
+    add(key: K, n?: number): boolean;
+    /**
+     * Set count for `key` to exactly `n`.
+     * @returns True if changed.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -728,15 +720,14 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Remove one occurrence
+   * // Set occurrence count
    *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       ms.delete(1);
-   *       console.log(ms.count(1)); // 2;
+   *       ms.setCount(1, 3);
+   *       console.log(ms.count(1)); // 3;
      */
-    delete(key: K, n?: number): boolean;
+    setCount(key: K, n: number): boolean;
     /**
-     * Delete all occurrences of the given key.
+     * Delete `n` occurrences of `key` (default 1).
      * @returns True if any occurrence was removed.
      * @remarks Time O(log n), Space O(1)
      
@@ -761,18 +752,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Remove all occurrences
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       ms.deleteAll(1);
-   *       console.log(ms.has(1)); // false;
-     */
-    deleteAll(key: K): boolean;
-    /**
-     * Iterates over distinct keys (each key yielded once).
-     * @remarks Time O(n), Space O(1)
-     
      
      
      
@@ -794,17 +773,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Iterate unique keys
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(2);
-   *       console.log([...ms.keysDistinct()]); // [1, 2];
-     */
-    keysDistinct(): IterableIterator<K>;
-    /**
-     * Iterates over entries as [key, count] pairs.
-     * @remarks Time O(n), Space O(1)
      
      
      
@@ -944,20 +912,17 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Iterate entries
+   * // Remove one occurrence
    *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       console.log([...ms.entries()].length); // > 0;
-     */
-    entries(): IterableIterator<[K, number]>;
-    /**
-     * Expanded iteration (default). Each key is yielded `count(key)` times.
-     * @remarks Time O(size), Space O(1) where size is total occurrences
+   *       ms.add(1, 3);
+   *       ms.delete(1);
+   *       console.log(ms.count(1)); // 2;
      */
-    [Symbol.iterator](): Iterator<K>;
+    delete(key: K, n?: number): boolean;
     /**
-     * Returns an array with all elements (expanded).
-     * @remarks Time O(size), Space O(size)
+     * Delete all occurrences of the given key.
+     * @returns True if any occurrence was removed.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -988,6 +953,17 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Remove all occurrences
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 3);
+   *       ms.deleteAll(1);
+   *       console.log(ms.has(1)); // false;
+     */
+    deleteAll(key: K): boolean;
+    /**
+     * Iterates over distinct keys (each key yielded once).
+     * @remarks Time O(n), Space O(1)
      
      
      
@@ -1018,6 +994,17 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Iterate unique keys
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(2);
+   *       console.log([...ms.keysDistinct()]); // [1, 2];
+     */
+    keysDistinct(): IterableIterator<K>;
+    /**
+     * Iterates over entries as [key, count] pairs.
+     * @remarks Time O(n), Space O(1)
      
      
      
@@ -1096,17 +1083,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // All elements (with duplicates)
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(2);
-   *       console.log(ms.toArray()); // [1, 1, 2];
-     */
-    toArray(): K[];
-    /**
-     * Returns an array with distinct keys only.
-     * @remarks Time O(n), Space O(n)
      
      
      
@@ -1129,17 +1105,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Unique keys only
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       ms.add(2);
-   *       console.log(ms.toDistinctArray()); // [1, 2];
-     */
-    toDistinctArray(): K[];
-    /**
-     * Returns an array of [key, count] entries.
-     * @remarks Time O(n), Space O(n)
      
      
      
@@ -1162,23 +1127,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Key-count pairs
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(3);
-   *       console.log(ms.toEntries()); // [[1, 2], [3, 1]];
-     */
-    toEntries(): Array<[K, number]>;
-    /**
-     * Expose comparator for advanced usage/testing (read-only).
-     * @remarks Time O(1), Space O(1)
-     */
-    get comparator(): Comparator<K>;
-    /**
-     * Remove all elements from the multiset.
-     * @remarks Time O(1), Space O(1)
-    
      
      
      
@@ -1235,6 +1183,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Iterate entries
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       console.log([...ms.entries()].length); // > 0;
+     */
+    entries(): IterableIterator<[K, number]>;
+    /**
+     * Expanded iteration (default). Each key is yielded `count(key)` times.
+     * @remarks Time O(size), Space O(1) where size is total occurrences
+     */
+    [Symbol.iterator](): Iterator<K>;
+    /**
+     * Returns an array with all elements (expanded).
+     * @remarks Time O(size), Space O(size)
      
      
      
@@ -1317,18 +1280,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Remove all
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1);
-   *       ms.clear();
-   *       console.log(ms.isEmpty()); // true;
-     */
-    clear(): void;
-    /**
-     * Returns the smallest key, or undefined if empty.
-     * @remarks Time O(log n), Space O(1)
-    
      
      
      
@@ -1351,9 +1302,402 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Smallest element
-   *  const ms = new TreeMultiSet<number>();
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // All elements (with duplicates)
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(2);
+   *       console.log(ms.toArray()); // [1, 1, 2];
+     */
+    toArray(): K[];
+    /**
+     * Returns an array with distinct keys only.
+     * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Unique keys only
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 3);
+   *       ms.add(2);
+   *       console.log(ms.toDistinctArray()); // [1, 2];
+     */
+    toDistinctArray(): K[];
+    /**
+     * Returns an array of [key, count] entries.
+     * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Key-count pairs
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(3);
+   *       console.log(ms.toEntries()); // [[1, 2], [3, 1]];
+     */
+    toEntries(): Array<[K, number]>;
+    /**
+     * Expose comparator for advanced usage/testing (read-only).
+     * @remarks Time O(1), Space O(1)
+     */
+    get comparator(): Comparator<K>;
+    /**
+     * Remove all elements from the multiset.
+     * @remarks Time O(1), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Remove all
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1);
+   *       ms.clear();
+   *       console.log(ms.isEmpty()); // true;
+     */
+    clear(): void;
+    /**
+     * Returns the smallest key, or undefined if empty.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Smallest element
+   *  const ms = new TreeMultiSet<number>();
    *       ms.add(3);
    *       ms.add(1);
    *       console.log(ms.first()); // 1;
@@ -1364,6 +1708,252 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      * @remarks Time O(log n), Space O(1)
     
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Largest element
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1);
+   *       ms.add(3);
+   *       console.log(ms.last()); // 3;
+     */
+    last(): K | undefined;
+    /**
+     * Removes all occurrences of the smallest key and returns it.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Remove and return smallest
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(2);
+   *       ms.add(1);
+   *       console.log(ms.pollFirst()); // 1;
+   *       console.log(ms.has(1)); // false;
+     */
+    pollFirst(): K | undefined;
+    /**
+     * Removes all occurrences of the largest key and returns it.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Remove and return largest
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1);
+   *       ms.add(3);
+   *       console.log(ms.pollLast()); // 3;
+     */
+    pollLast(): K | undefined;
+    /**
+     * Returns the smallest key >= given key, or undefined.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1386,15 +1976,16 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Largest element
+   * // Least key ≥ target
    *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1);
-   *       ms.add(3);
-   *       console.log(ms.last()); // 3;
+   *       ms.add(10);
+   *       ms.add(20);
+   *       ms.add(30);
+   *       console.log(ms.ceiling(15)); // 20;
      */
-    last(): K | undefined;
+    ceiling(key: K): K | undefined;
     /**
-     * Removes all occurrences of the smallest key and returns it.
+     * Returns the largest key <= given key, or undefined.
      * @remarks Time O(log n), Space O(1)
     
      
@@ -1416,20 +2007,139 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
       * @example
-   * // Remove and return smallest
+   * // Greatest key ≤ target
    *  const ms = new TreeMultiSet<number>();
-   *       ms.add(2);
-   *       ms.add(1);
-   *       console.log(ms.pollFirst()); // 1;
-   *       console.log(ms.has(1)); // false;
+   *       ms.add(10);
+   *       ms.add(20);
+   *       ms.add(30);
+   *       console.log(ms.floor(25)); // 20;
      */
-    pollFirst(): K | undefined;
+    floor(key: K): K | undefined;
     /**
-     * Removes all occurrences of the largest key and returns it.
+     * Returns the smallest key > given key, or undefined.
      * @remarks Time O(log n), Space O(1)
     
      
@@ -1454,18 +2164,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Remove and return largest
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1);
-   *       ms.add(3);
-   *       console.log(ms.pollLast()); // 3;
-     */
-    pollLast(): K | undefined;
-    /**
-     * Returns the smallest key >= given key, or undefined.
-     * @remarks Time O(log n), Space O(1)
-    
      
      
      
@@ -1575,19 +2273,60 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Least key ≥ target
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(10);
-   *       ms.add(20);
-   *       ms.add(30);
-   *       console.log(ms.ceiling(15)); // 20;
-     */
-    ceiling(key: K): K | undefined;
-    /**
-     * Returns the largest key <= given key, or undefined.
-     * @remarks Time O(log n), Space O(1)
-    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Least key > target
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(10);
+   *       ms.add(20);
+   *       console.log(ms.higher(10)); // 20;
+     */
+    higher(key: K): K | undefined;
+    /**
+     * Returns the largest key < given key, or undefined.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1698,17 +2437,16 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Greatest key ≤ target
+   * // Greatest key < target
    *  const ms = new TreeMultiSet<number>();
    *       ms.add(10);
    *       ms.add(20);
-   *       ms.add(30);
-   *       console.log(ms.floor(25)); // 20;
+   *       console.log(ms.lower(20)); // 10;
      */
-    floor(key: K): K | undefined;
+    lower(key: K): K | undefined;
     /**
-     * Returns the smallest key > given key, or undefined.
-     * @remarks Time O(log n), Space O(1)
+     * Iterates over distinct keys with their counts.
+     * @remarks Time O(n), Space O(1)
     
      
      
@@ -1819,18 +2557,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Least key > target
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(10);
-   *       ms.add(20);
-   *       console.log(ms.higher(10)); // 20;
-     */
-    higher(key: K): K | undefined;
-    /**
-     * Returns the largest key < given key, or undefined.
-     * @remarks Time O(log n), Space O(1)
-    
      
      
      
@@ -1900,6 +2626,20 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Iterate
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(2);
+   *       const pairs: [number, number][] = [];
+   *       ms.forEach((k, c) => pairs.push([k, c]));
+   *       console.log(pairs); // [[1, 2], [2, 1]];
+     */
+    forEach(callback: (key: K, count: number) => void): void;
+    /**
+     * Creates a new TreeMultiSet with entries that match the predicate.
+     * @remarks Time O(n log n), Space O(n)
+    
      
      
      
@@ -1940,18 +2680,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Greatest key < target
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(10);
-   *       ms.add(20);
-   *       console.log(ms.lower(20)); // 10;
-     */
-    lower(key: K): K | undefined;
-    /**
-     * Iterates over distinct keys with their counts.
-     * @remarks Time O(n), Space O(1)
-    
      
      
      
@@ -2091,18 +2819,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Iterate
+   * // Filter
    *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(2);
-   *       const pairs: [number, number][] = [];
-   *       ms.forEach((k, c) => pairs.push([k, c]));
-   *       console.log(pairs); // [[1, 2], [2, 1]];
+   *       ms.add(1, 3);
+   *       ms.add(2, 1);
+   *       ms.add(3, 2);
+   *       const filtered = ms.filter((k, c) => c > 1);
+   *       console.log([...filtered.keysDistinct()]); // [1, 3];
      */
-    forEach(callback: (key: K, count: number) => void): void;
+    filter(predicate: (key: K, count: number) => boolean): TreeMultiSet<K>;
     /**
-     * Creates a new TreeMultiSet with entries that match the predicate.
-     * @remarks Time O(n log n), Space O(n)
+     * Reduces the multiset to a single value.
+     * @remarks Time O(n), Space O(1)
     
      
      
@@ -2242,28 +2970,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Filter
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       ms.add(2, 1);
-   *       ms.add(3, 2);
-   *       const filtered = ms.filter((k, c) => c > 1);
-   *       console.log([...filtered.keysDistinct()]); // [1, 3];
-     */
-    filter(predicate: (key: K, count: number) => boolean): TreeMultiSet<K>;
-    /**
-     * Reduces the multiset to a single value.
-     * @remarks Time O(n), Space O(1)
-    
-     
-     
-     
-     
-     
-     
-     
-     
      
      
      
@@ -2304,6 +3010,20 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Aggregate
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(2, 3);
+   *       const sum = ms.reduce((acc, k, c) => acc + k * c, 0);
+   *       console.log(sum); // 8;
+     */
+    reduce<U>(callback: (accumulator: U, key: K, count: number) => U, initialValue: U): U;
+    /**
+     * Maps keys and counts to a new TreeMultiSet.
+     * When multiple keys map to the same new key, counts are merged (added).
+     * @remarks Time O(n log n), Space O(n)
+    
      
      
      
@@ -2394,20 +3114,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Aggregate
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(2, 3);
-   *       const sum = ms.reduce((acc, k, c) => acc + k * c, 0);
-   *       console.log(sum); // 8;
-     */
-    reduce<U>(callback: (accumulator: U, key: K, count: number) => U, initialValue: U): U;
-    /**
-     * Maps keys and counts to a new TreeMultiSet.
-     * When multiple keys map to the same new key, counts are merged (added).
-     * @remarks Time O(n log n), Space O(n)
-    
      
      
      
@@ -2496,6 +3202,21 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Transform
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 2);
+   *       ms.add(2, 3);
+   *       const doubled = ms.map((k, c) => [k * 10, c] as [number, number]);
+   *       console.log([...doubled.keysDistinct()]); // [10, 20];
+     */
+    map<K2>(mapper: (key: K, count: number) => [K2, number], options?: {
+        comparator?: Comparator<K2>;
+    }): TreeMultiSet<K2>;
+    /**
+     * Creates an independent copy of this multiset.
+     * @remarks Time O(n log n), Space O(n)
+    
      
      
      
@@ -2546,21 +3267,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Transform
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 2);
-   *       ms.add(2, 3);
-   *       const doubled = ms.map((k, c) => [k * 10, c] as [number, number]);
-   *       console.log([...doubled.keysDistinct()]); // [10, 20];
-     */
-    map<K2>(mapper: (key: K, count: number) => [K2, number], options?: {
-        comparator?: Comparator<K2>;
-    }): TreeMultiSet<K2>;
-    /**
-     * Creates an independent copy of this multiset.
-     * @remarks Time O(n log n), Space O(n)
-    
      
      
      
@@ -2667,6 +3373,94 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // 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 by position in tree order
+ *  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.
+     * @remarks Time O(log n + k), Space O(k) where k is result size
+    
      
      
      
@@ -2699,19 +3493,6 @@ 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;
-     */
-    clone(): TreeMultiSet<K>;
-    /**
-     * Returns keys within the given range.
-     * @remarks Time O(log n + k), Space O(k) where k is result size
-    
      
      
      
@@ -2952,6 +3733,46 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+