data-structure-typed 2.6.1 → 2.6.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/main/src/data-structures/binary-tree/tree-multi-map.ts#L28)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:27](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L27)
 
 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/main/src/data-structures/binary-tree/tree-multi-map.ts#L45)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:44](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L44)
 
 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:5413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5413)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:115](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L115)
 
 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/main/src/data-structures/binary-tree/tree-multi-map.ts#L109)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:90](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L90)
 
 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:616](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L616)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:105](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L105)
 
 Total number of values across all buckets (Σ bucket.length).
 
@@ -155,8 +155,6 @@ Total number of values across all buckets (Σ bucket.length).
 
 Time O(n), Space O(1)
 
- *
-
 ##### Example
 
 ```ts
@@ -180,7 +178,7 @@ Time O(n), Space O(1)
 iterator: Iterator<[K, V[]]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2029](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2029)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:330](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L330)
 
 Iterates over all entries as [key, bucket] pairs.
 
@@ -206,7 +204,7 @@ Iterable.[iterator]
 add(key, value): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1326](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1326)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L200)
 
 Append a single value.
 
@@ -228,8 +226,6 @@ Append a single value.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -249,7 +245,7 @@ Time O(log n), Space O(1)
 ceiling(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3126](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3126)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:525](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L525)
 
 Returns the entry with the smallest key >= given key.
 
@@ -267,8 +263,6 @@ Returns the entry with the smallest key >= given key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -288,7 +282,7 @@ Time O(log n), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:520](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L520)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:140](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L140)
 
 Removes all entries from the map.
 
@@ -300,8 +294,6 @@ Removes all entries from the map.
 
 Time O(1), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -320,12 +312,10 @@ Time O(1), Space O(1)
 clone(): TreeMultiMap<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:5405](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5405)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:781](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L781)
 
 Deep copy
 
- *
-
 #### Returns
 
 `TreeMultiMap`\<`K`, `V`, `R`\>
@@ -349,7 +339,7 @@ Deep copy
 count(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:567](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L567)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:154](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L154)
 
 Bucket length for a key (missing => 0).
 
@@ -367,8 +357,6 @@ Bucket length for a key (missing => 0).
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -387,7 +375,7 @@ Time O(log n), Space O(1)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1856](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1856)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L256)
 
 Deletes a key and its entire bucket.
 
@@ -405,8 +393,6 @@ Deletes a key and its entire bucket.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -429,7 +415,7 @@ deleteValue(
    eq?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1954](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1954)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:288](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L288)
 
 Delete a single occurrence of a value from a key's bucket.
 
@@ -455,8 +441,6 @@ Delete a single occurrence of a value from a key's bucket.
 
 Time O(log n + m), Space O(1) where m is bucket size
 
- *
-
 #### Example
 
 ```ts
@@ -479,7 +463,7 @@ deleteValues(
    eq?): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2009](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2009)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:310](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L310)
 
 Delete all occurrences of a value from a key's bucket.
 
@@ -505,8 +489,6 @@ Delete all occurrences of a value from a key's bucket.
 
 Time O(log n + m), Space O(1) where m is bucket size
 
- *
-
 #### Example
 
 ```ts
@@ -527,7 +509,7 @@ Time O(log n + m), Space O(1) where m is bucket size
 entries(): IterableIterator<[K, V[]]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2472](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2472)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:379](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L379)
 
 Iterate over all `[key, values[]]` entries (Map-compatible).
 
@@ -539,8 +521,6 @@ Iterate over all `[key, values[]]` entries (Map-compatible).
 
 Time O(n), Space O(1) per step.
 
- *
-
 #### Example
 
 ```ts
@@ -563,7 +543,7 @@ Time O(n), Space O(1) per step.
 entriesOf(key): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2521](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2521)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:398](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L398)
 
 Iterates over all entries for a specific key.
 
@@ -581,8 +561,6 @@ Iterates over all entries for a specific key.
 
 Time O(log n + m), Space O(1) where m is bucket size
 
- *
-
 #### Example
 
 ```ts
@@ -590,7 +568,10 @@ Time O(log n + m), Space O(1) where m is bucket size
  const mm = new TreeMultiMap<number, string>();
       mm.add(1, 'a');
       mm.add(1, 'b');
-      console.log([...mm.entriesOf(1)]); // [[1, 'a'], [1, 'b']];
+      console.log([...mm.entriesOf(1)]); // [
+ //        [1, 'a'],
+ //        [1, 'b']
+ //      ];
 ```
 
 ***
@@ -601,7 +582,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:4317](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4317)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L633)
 
 Creates a new map with entries that pass the predicate.
 
@@ -619,8 +600,6 @@ Creates a new map with entries that pass the predicate.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -641,7 +620,7 @@ Time O(n), Space O(n)
 first(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2714)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:453](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L453)
 
 Returns the entry with the smallest key.
 
@@ -653,8 +632,6 @@ Returns the entry with the smallest key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -673,7 +650,7 @@ Time O(log n), Space O(1)
 flatEntries(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2620](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2620)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L435)
 
 Iterates over all [key, value] pairs (flattened from buckets).
 
@@ -685,8 +662,6 @@ Iterates over all [key, value] pairs (flattened from buckets).
 
 Time O(T), Space O(1) where T is totalSize
 
- *
-
 #### Example
 
 ```ts
@@ -695,7 +670,11 @@ Time O(T), Space O(1) where T is totalSize
       mm.add(1, 'a');
       mm.add(1, 'b');
       mm.add(2, 'c');
-      console.log([...mm.flatEntries()]); // [[1, 'a'], [1, 'b'], [2, 'c']];
+      console.log([...mm.flatEntries()]); // [
+ //        [1, 'a'],
+ //        [1, 'b'],
+ //        [2, 'c']
+ //      ];
 ```
 
 ***
@@ -706,7 +685,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:3341](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3341)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:544](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L544)
 
 Returns the entry with the largest key <= given key.
 
@@ -724,8 +703,6 @@ Returns the entry with the largest key <= given key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -745,7 +722,7 @@ Time O(log n), Space O(1)
 forEach(callback): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:4106](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4106)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L615)
 
 Executes a callback for each entry.
 
@@ -763,8 +740,6 @@ Executes a callback for each entry.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -785,7 +760,7 @@ Time O(n), Space O(1)
 get(key): V[] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1123](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1123)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:184](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L184)
 
 Live bucket reference (do not auto-delete key if bucket becomes empty via mutation).
 
@@ -803,8 +778,6 @@ Live bucket reference (do not auto-delete key if bucket becomes empty via mutati
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -823,7 +796,7 @@ Time O(log n), Space O(1)
 getByRank(k): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:5294](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5294)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:729](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L729)
 
 Creates a shallow clone of this map.
 
@@ -841,8 +814,6 @@ Creates a shallow clone of this map.
 
 Time O(n log n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -861,7 +832,7 @@ Time O(n log n), Space O(n)
 getRank(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:5313](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5313)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:748](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L748)
 
 Get the rank of a key in sorted order
 
@@ -897,7 +868,7 @@ Get the rank of a key in sorted order
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:870](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L870)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:169](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L169)
 
 Whether the map contains the given key.
 
@@ -915,8 +886,6 @@ Whether the map contains the given key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -938,7 +907,7 @@ hasEntry(
    eq?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1904](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1904)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:271](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L271)
 
 Check if a specific value exists in a key's bucket.
 
@@ -964,8 +933,6 @@ Check if a specific value exists in a key's bucket.
 
 Time O(log n + m), Space O(1) where m is bucket size
 
- *
-
 #### Example
 
 ```ts
@@ -984,7 +951,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:3513](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3513)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:562](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L562)
 
 Returns the entry with the smallest key > given key.
 
@@ -1002,8 +969,6 @@ Returns the entry with the smallest key > given key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1022,7 +987,7 @@ Time O(log n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:313](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L313)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:126](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L126)
 
 Whether the map is empty.
 
@@ -1034,8 +999,6 @@ Whether the map is empty.
 
 Time O(1), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1051,7 +1014,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2239](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2239)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L347)
 
 Iterates over all keys.
 
@@ -1063,8 +1026,6 @@ Iterates over all keys.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1083,7 +1044,7 @@ Time O(n), Space O(1)
 last(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2807)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:470](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L470)
 
 Returns the entry with the largest key.
 
@@ -1095,8 +1056,6 @@ Returns the entry with the largest key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1115,7 +1074,7 @@ Time O(log n), Space O(1)
 lower(key): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3685](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3685)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:580](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L580)
 
 Returns the entry with the largest key < given key.
 
@@ -1133,8 +1092,6 @@ Returns the entry with the largest key < given key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1153,7 +1110,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:4528](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4528)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:651](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L651)
 
 Creates a new map by transforming each entry.
 
@@ -1177,8 +1134,6 @@ Creates a new map by transforming each entry.
 
 Time O(n log n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1197,7 +1152,7 @@ Time O(n log n), Space O(n)
 pollFirst(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2860](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2860)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:489](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L489)
 
 Removes and returns the entry with the smallest key.
 
@@ -1209,8 +1164,6 @@ Removes and returns the entry with the smallest key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1231,7 +1184,7 @@ Time O(log n), Space O(1)
 pollLast(): [K, V[]] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2912](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2912)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:507](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L507)
 
 Removes and returns the entry with the largest key.
 
@@ -1243,8 +1196,6 @@ Removes and returns the entry with the largest key.
 
 Time O(log n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1264,7 +1215,7 @@ Time O(log n), Space O(1)
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:3897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3897)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:599](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L599)
 
 Prints the internal tree structure (for debugging).
 
@@ -1276,8 +1227,6 @@ Prints the internal tree structure (for debugging).
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1295,12 +1244,10 @@ Time O(n), Space O(n)
 rangeByRank(start, end): [K, V[]][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:5349](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5349)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:766](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L766)
 
 Get elements by rank range
 
- *
-
 #### Parameters
 
 ##### start
@@ -1319,10 +1266,7 @@ Get elements by rank range
 
 ```ts
 // Pagination by position in tree order
- const tree = new TreeMultiMap<number>(
-        [10, 20, 30, 40, 50, 60, 70, 80, 90],
-        { enableOrderStatistic: true }
-      );
+ const tree = new TreeMultiMap<number>([10, 20, 30, 40, 50, 60, 70, 80, 90], { enableOrderStatistic: true });
       const pageSize = 3;
 
       // Page 1
@@ -1341,7 +1285,7 @@ Get elements by rank range
 rangeSearch<C>(range, callback?): ReturnType<C>[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:5119](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5119)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:711](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L711)
 
 Searches for entries within a key range.
 
@@ -1369,8 +1313,6 @@ Searches for entries within a key range.
 
 Time O(log n + k), Space O(k) where k is result size
 
- *
-
 #### Example
 
 ```ts
@@ -1391,7 +1333,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:4742](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4742)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:670](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L670)
 
 Reduces all entries to a single value.
 
@@ -1419,8 +1361,6 @@ Reduces all entries to a single value.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1442,7 +1382,7 @@ Time O(n), Space O(1)
 set(entry, value?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:1582](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1582)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L220)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1467,8 +1407,6 @@ Alias for compatibility with existing TreeMultiMap semantics.
 
 Time O(log n), Space O(1) for single value; O(log n + m) for bucket append
 
- *
-
 ##### Example
 
 ```ts
@@ -1485,7 +1423,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:1583](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1583)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:221](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L221)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1507,8 +1445,6 @@ Alias for compatibility with existing TreeMultiMap semantics.
 
 Time O(log n), Space O(1) for single value; O(log n + m) for bucket append
 
- *
-
 ##### Example
 
 ```ts
@@ -1527,7 +1463,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:4944](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4944)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:690](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L690)
 
 Sets multiple entries at once.
 
@@ -1545,14 +1481,15 @@ Sets multiple entries at once.
 
 Time O(m log n), Space O(m) where m is input size
 
- *
-
 #### Example
 
 ```ts
 // Set multiple entries
  const mm = new TreeMultiMap<number, string>();
-      mm.setMany([[1, ['a']], [2, ['b']]]);
+      mm.setMany([
+        [1, ['a']],
+        [2, ['b']]
+      ]);
       console.log(mm.size); // 2;
 ```
 
@@ -1564,7 +1501,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:2446](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2446)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:361](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L361)
 
 Iterates over all buckets.
 
@@ -1576,8 +1513,6 @@ Iterates over all buckets.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1596,7 +1531,7 @@ Time O(n), Space O(1)
 valuesOf(key): IterableIterator<V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-multi-map.ts:2570](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2570)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:414](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L414)
 
 Iterates over all values for a specific key.
 
@@ -1614,8 +1549,6 @@ Iterates over all values for a specific key.
 
 Time O(log n + m), Space O(1) where m is bucket size
 
- *
-
 #### Example
 
 ```ts