max-priority-queue-typed 2.5.2 → 2.6.0

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

@@ -61,6 +61,13 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -238,14 +245,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)
      
      
      
@@ -281,6 +280,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)
      
      
      
@@ -407,17 +414,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)
      
      
      
@@ -444,17 +440,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)
      
      
      
@@ -499,6 +484,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)
      
      
      
@@ -532,6 +528,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)
      
      
      
@@ -607,20 +614,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)
      
      
      
@@ -647,17 +640,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)
      
      
      
@@ -744,6 +726,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)
      
      
      
@@ -777,6 +773,26 @@ 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)
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -819,18 +835,6 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
-   * // Remove one occurrence
-   *  const ms = new TreeMultiSet<number>();
-   *       ms.add(1, 3);
-   *       ms.delete(1);
-   *       console.log(ms.count(1)); // 2;
-     */
-    delete(key: K, n?: number): boolean;
-    /**
-     * Delete all occurrences of the given key.
-     * @returns True if any occurrence was removed.
-     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -857,17 +861,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)
      
      
      
@@ -894,17 +887,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)
      
      
      
@@ -998,6 +980,18 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Remove one occurrence
+   *  const ms = new TreeMultiSet<number>();
+   *       ms.add(1, 3);
+   *       ms.delete(1);
+   *       console.log(ms.count(1)); // 2;
+     */
+    delete(key: K, n?: number): boolean;
+    /**
+     * Delete all occurrences of the given key.
+     * @returns True if any occurrence was removed.
+     * @remarks Time O(log n), Space O(1)
      
      
      
@@ -1031,6 +1025,18 @@ 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)
+     
      
      
      
@@ -1064,21 +1070,16 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Iterate entries
+   * // Iterate unique keys
    *  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(2);
+   *       console.log([...ms.keysDistinct()]); // [1, 2];
      */
-    [Symbol.iterator](): Iterator<K>;
+    keysDistinct(): IterableIterator<K>;
     /**
-     * Returns an array with all elements (expanded).
-     * @remarks Time O(size), Space O(size)
-     
+     * Iterates over entries as [key, count] pairs.
+     * @remarks Time O(n), Space O(1)
      
      
      
@@ -1236,17 +1237,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)
      
      
      
@@ -1273,17 +1263,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)
      
      
      
@@ -1294,6 +1273,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>;
+    /**
+     * Iterate over all elements with multiplicity (Set-compatible, alias for `[Symbol.iterator]`).
+     * @remarks Each key is yielded `count(key)` times. Time O(size), Space O(1) per step.
      
      
      
@@ -1302,6 +1296,16 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+      * @example
+   * // Iterate with multiplicity
+   *  const ms = new TreeMultiSet<number>();
+   *     ms.add(1); ms.add(1); ms.add(2); ms.add(3); ms.add(3); ms.add(3);
+   *     console.log([...ms.keys()]); // [1, 1, 2, 3, 3, 3];
+     */
+    keys(): IterableIterator<K>;
+    /**
+     * Iterate over all elements with multiplicity (Set-compatible, alias for `[Symbol.iterator]`).
+     * @remarks Each key is yielded `count(key)` times. Time O(size), Space O(1) per step.
      
      
      
@@ -1311,22 +1315,15 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Key-count pairs
+   * // Iterate with multiplicity
    *  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)
+   *     ms.add(5); ms.add(5); ms.add(10);
+   *     console.log([...ms.values()]); // [5, 5, 10];
      */
-    get comparator(): Comparator<K>;
+    values(): IterableIterator<K>;
     /**
-     * Remove all elements from the multiset.
-     * @remarks Time O(1), Space O(1)
-    
+     * Returns an array with all elements (expanded).
+     * @remarks Time O(size), Space O(size)
      
      
      
@@ -1485,7 +1482,340 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
-      * @example
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @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);
@@ -1515,6 +1845,13 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1553,6 +1890,13 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1591,6 +1935,13 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1630,6 +1981,13 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1754,6 +2112,34 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1892,6 +2278,200 @@ 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);
+   *       ms.add(30);
+   *       console.log(ms.floor(25)); // 20;
+     */
+    floor(key: K): K | undefined;
+    /**
+     * Returns the smallest key > given key, or undefined.
+     * @remarks Time O(log n), Space O(1)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1914,16 +2494,15 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
       * @example
-   * // Greatest key ≤ target
+   * // Least 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.higher(10)); // 20;
      */
-    floor(key: K): K | undefined;
+    higher(key: K): K | undefined;
     /**
-     * Returns the smallest key > given key, or undefined.
+     * Returns the largest key < given key, or undefined.
      * @remarks Time O(log n), Space O(1)
     
      
@@ -2051,18 +2630,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)
-    
      
      
      
@@ -2091,6 +2658,18 @@ 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)
+    
      
      
      
@@ -2188,18 +2767,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)
-    
      
      
      
@@ -2296,6 +2863,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)
+    
      
      
      
@@ -2358,20 +2939,6 @@ 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)
-    
      
      
      
@@ -2503,6 +3070,28 @@ 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)
+    
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2530,20 +3119,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)
-    
      
      
      
@@ -2853,6 +3428,41 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3070,8 +3680,22 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
     /**
    * Get elements by rank range
   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
- * // Pagination with rangeByRank
+ * // Pagination by position in tree order
  *  const tree = new TreeMultiSet<number>(
  *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
  *         { enableOrderStatistic: true }
@@ -3092,6 +3716,41 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Deep clone
  *  const ms = new TreeMultiSet<number>();
@@ -3209,6 +3868,34 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3381,6 +4068,41 @@ export declare class TreeMultiSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+