data-structure-typed 2.5.1 → 2.5.2

package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md

@@ -6,7 +6,7 @@
 
 # Class: TreeMultiMap\<K, V, R\>
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:28](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L28)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:28](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L28)
 
 TreeMultiMap (ordered MultiMap) — key → bucket (Array of values).
 
@@ -51,7 +51,7 @@ Semantics (RFC):
 new TreeMultiMap<K, V, R>(keysNodesEntriesOrRaws?, options?): TreeMultiMap<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:45](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L45)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:45](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L45)
 
 Creates a new TreeMultiMap.
 
@@ -103,7 +103,7 @@ const mmap = new TreeMultiMap(players, { toEntryFn: p => [p.score, p.items] });
 get comparator(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3632](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3632)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4533](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4533)
 
 Expose comparator for advanced usage/testing (read-only).
 
@@ -125,7 +125,7 @@ Time O(1), Space O(1)
 get size(): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:109](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L109)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:109](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L109)
 
 Number of distinct keys.
 
@@ -147,7 +147,7 @@ Time O(1), Space O(1)
 get totalSize(): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:448](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L448)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:532](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L532)
 
 Total number of values across all buckets (Σ bucket.length).
 
@@ -180,7 +180,7 @@ Time O(n), Space O(1)
 iterator: Iterator<[K, V[]]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1413](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1413)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1721](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1721)
 
 Iterates over all entries as [key, bucket] pairs.
 
@@ -206,7 +206,7 @@ Iterable.[iterator]
 add(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:920](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L920)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1123](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1123)
 
 Append a single value.
 
@@ -249,7 +249,7 @@ Time O(log n), Space O(1)
 ceiling(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2148](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2148)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2624](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2624)
 
 Returns the entry with the smallest key >= given key.
 
@@ -288,7 +288,7 @@ Time O(log n), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:380](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L380)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:450](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L450)
 
 Removes all entries from the map.
 
@@ -320,20 +320,16 @@ Time O(1), Space O(1)
 clone(): TreeMultiMap<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3624](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3624)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4525](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4525)
 
-Creates a shallow clone of this map.
+Deep copy
+
+ *
 
 #### Returns
 
 `TreeMultiMap`\<`K`, `V`, `R`\>
 
-#### Remarks
-
-Time O(n log n), Space O(n)
-
- *
-
 #### Example
 
 ```ts
@@ -353,7 +349,7 @@ Time O(n log n), Space O(n)
 count(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:413](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L413)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:490](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L490)
 
 Bucket length for a key (missing => 0).
 
@@ -391,7 +387,7 @@ Time O(log n), Space O(1)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1282](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1282)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1569](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1569)
 
 Deletes a key and its entire bucket.
 
@@ -433,7 +429,7 @@ deleteValue(
    eq?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1352](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1352)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1653](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1653)
 
 Delete a single occurrence of a value from a key's bucket.
 
@@ -483,7 +479,7 @@ deleteValues(
    eq?): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1393](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1393)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1701](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1701)
 
 Delete all occurrences of a value from a key's bucket.
 
@@ -531,7 +527,7 @@ Time O(log n + m), Space O(1) where m is bucket size
 entriesOf(key): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1725](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1725)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2110](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2110)
 
 Iterates over all entries for a specific key.
 
@@ -569,7 +565,7 @@ Time O(log n + m), Space O(1) where m is bucket size
 filter(predicate): TreeMultiMap<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2947](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2947)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3619](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3619)
 
 Creates a new map with entries that pass the predicate.
 
@@ -609,7 +605,7 @@ Time O(n), Space O(n)
 first(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1862](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1862)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2275](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2275)
 
 Returns the entry with the smallest key.
 
@@ -641,7 +637,7 @@ Time O(log n), Space O(1)
 flatEntries(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1796](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1796)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2195](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2195)
 
 Iterates over all [key, value] pairs (flattened from buckets).
 
@@ -674,7 +670,7 @@ Time O(T), Space O(1) where T is totalSize
 floor(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2293](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2293)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2804](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2804)
 
 Returns the entry with the largest key <= given key.
 
@@ -713,7 +709,7 @@ Time O(log n), Space O(1)
 forEach(callback): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2806](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2806)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3443](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3443)
 
 Executes a callback for each entry.
 
@@ -753,7 +749,7 @@ Time O(n), Space O(1)
 get(key): V[] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:787](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L787)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:955](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L955)
 
 Live bucket reference (do not auto-delete key if bucket becomes empty via mutation).
 
@@ -785,13 +781,87 @@ Time O(log n), Space O(1)
 
 ***
 
+### getByRank()
+
+```ts
+getByRank(k): [K, V[]] | undefined;
+```
+
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4463](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4463)
+
+Creates a shallow clone of this map.
+
+#### Parameters
+
+##### k
+
+`number`
+
+#### Returns
+
+\[`K`, `V`[]\] \| `undefined`
+
+#### Remarks
+
+Time O(n log n), Space O(n)
+
+ *
+
+#### Example
+
+```ts
+// Order-statistic on BST
+ const tree = new TreeMultiMap<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;
+```
+
+***
+
+### getRank()
+
+```ts
+getRank(key): number;
+```
+
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4482](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4482)
+
+Get the rank of a key in sorted order
+
+#### Parameters
+
+##### key
+
+`K`
+
+#### Returns
+
+`number`
+
+#### Example
+
+```ts
+// Get the rank of a key in sorted order
+ const tree = new TreeMultiMap<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;
+```
+
+***
+
 ### has()
 
 ```ts
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:618](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L618)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:744](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L744)
 
 Whether the map contains the given key.
 
@@ -832,7 +902,7 @@ hasEntry(
    eq?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1316](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1316)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1610](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1610)
 
 Check if a specific value exists in a key's bucket.
 
@@ -878,7 +948,7 @@ Time O(log n + m), Space O(1) where m is bucket size
 higher(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2409](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2409)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2948](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2948)
 
 Returns the entry with the smallest key > given key.
 
@@ -916,7 +986,7 @@ Time O(log n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:243](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L243)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:278](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L278)
 
 Whether the map is empty.
 
@@ -945,7 +1015,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1553](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1553)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1896](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1896)
 
 Iterates over all keys.
 
@@ -977,7 +1047,7 @@ Time O(n), Space O(1)
 last(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1927](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1927)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2354](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2354)
 
 Returns the entry with the largest key.
 
@@ -1009,7 +1079,7 @@ Time O(log n), Space O(1)
 lower(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2525](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2525)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3092](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3092)
 
 Returns the entry with the largest key < given key.
 
@@ -1047,7 +1117,7 @@ Time O(log n), Space O(1)
 map<V2>(mapper): TreeMultiMap<K, V2, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3088](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3088)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3795](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3795)
 
 Creates a new map by transforming each entry.
 
@@ -1091,7 +1161,7 @@ Time O(n log n), Space O(n)
 pollFirst(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1966](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1966)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2400](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2400)
 
 Removes and returns the entry with the smallest key.
 
@@ -1125,7 +1195,7 @@ Time O(log n), Space O(1)
 pollLast(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2004](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2004)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2445](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2445)
 
 Removes and returns the entry with the largest key.
 
@@ -1158,7 +1228,7 @@ Time O(log n), Space O(1)
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2667](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L2667)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3269](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3269)
 
 Prints the internal tree structure (for debugging).
 
@@ -1183,13 +1253,59 @@ Time O(n), Space O(n)
 
 ***
 
+### rangeByRank()
+
+```ts
+rangeByRank(start, end): [K, V[]][];
+```
+
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4504](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4504)
+
+Get elements by rank range
+
+ *
+
+#### Parameters
+
+##### start
+
+`number`
+
+##### end
+
+`number`
+
+#### Returns
+
+\[`K`, `V`[]\][]
+
+#### Example
+
+```ts
+// Pagination with rangeByRank
+ const tree = new TreeMultiMap<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];
+```
+
+***
+
 ### rangeSearch()
 
 ```ts
 rangeSearch<C>(range, callback?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3483](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3483)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4288](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4288)
 
 Searches for entries within a key range.
 
@@ -1239,7 +1355,7 @@ Time O(log n + k), Space O(k) where k is result size
 reduce<U>(callback, initialValue): U;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3232](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3232)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3974](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3974)
 
 Reduces all entries to a single value.
 
@@ -1290,7 +1406,7 @@ Time O(n), Space O(1)
 set(entry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1092](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1092)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1337](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1337)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1333,7 +1449,7 @@ Time O(log n), Space O(1) for single value; O(log n + m) for bucket append
 set(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1093](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1093)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1338](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1338)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1375,7 +1491,7 @@ Time O(log n), Space O(1) for single value; O(log n + m) for bucket append
 setMany(keysNodesEntriesOrRaws): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3364](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L3364)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4141](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4141)
 
 Sets multiple entries at once.
 
@@ -1412,7 +1528,7 @@ Time O(m log n), Space O(m) where m is input size
 values(): IterableIterator<V[]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1690](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1690)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2068](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2068)
 
 Iterates over all buckets.
 
@@ -1444,7 +1560,7 @@ Time O(n), Space O(1)
 valuesOf(key): IterableIterator<V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1760](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-multi-map.ts#L1760)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2152](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2152)
 
 Iterates over all values for a specific key.