data-structure-typed 2.5.2 → 2.6.0

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/8292cb978daf85ebe846186c7c7572aece04fb7b/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/main/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/8292cb978daf85ebe846186c7c7572aece04fb7b/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/main/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:4533](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4533)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:5021](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5021)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/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/main/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:532](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L532)
+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)
 
 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:1721](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1721)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1897)
 
 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:1123](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1123)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1239](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1239)
 
 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:2624](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2624)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2896](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2896)
 
 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:450](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L450)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:490](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L490)
 
 Removes all entries from the map.
 
@@ -320,7 +320,7 @@ Time O(1), Space O(1)
 clone(): TreeMultiMap<K, V, R>;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:5013](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L5013)
 
 Deep copy
 
@@ -349,7 +349,7 @@ Deep copy
 count(key): number;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:534](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L534)
 
 Bucket length for a key (missing => 0).
 
@@ -387,7 +387,7 @@ Time O(log n), Space O(1)
 delete(key): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1733](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1733)
 
 Deletes a key and its entire bucket.
 
@@ -429,7 +429,7 @@ deleteValue(
    eq?): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1825](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1825)
 
 Delete a single occurrence of a value from a key's bucket.
 
@@ -479,7 +479,7 @@ deleteValues(
    eq?): number;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1877](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1877)
 
 Delete all occurrences of a value from a key's bucket.
 
@@ -527,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:2110](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2110)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2330](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2330)
 
 Iterates over all entries for a specific key.
 
@@ -565,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:3619](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3619)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4003](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4003)
 
 Creates a new map with entries that pass the predicate.
 
@@ -605,7 +605,7 @@ Time O(n), Space O(n)
 first(): [K, V[]] | undefined;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2511](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2511)
 
 Returns the entry with the smallest key.
 
@@ -637,7 +637,7 @@ Time O(log n), Space O(1)
 flatEntries(): IterableIterator<[K, V]>;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2423](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2423)
 
 Iterates over all [key, value] pairs (flattened from buckets).
 
@@ -670,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:2804](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2804)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3096](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3096)
 
 Returns the entry with the largest key <= given key.
 
@@ -709,7 +709,7 @@ Time O(log n), Space O(1)
 forEach(callback): void;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3807)
 
 Executes a callback for each entry.
 
@@ -749,7 +749,7 @@ Time O(n), Space O(1)
 get(key): V[] | undefined;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1051](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1051)
 
 Live bucket reference (do not auto-delete key if bucket becomes empty via mutation).
 
@@ -787,7 +787,7 @@ Time O(log n), Space O(1)
 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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4923](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4923)
 
 Creates a shallow clone of this map.
 
@@ -825,7 +825,7 @@ Time O(n log n), Space O(n)
 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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4942](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4942)
 
 Get the rank of a key in sorted order
 
@@ -861,7 +861,7 @@ Get the rank of a key in sorted order
 has(key): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:816](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L816)
 
 Whether the map contains the given key.
 
@@ -902,7 +902,7 @@ hasEntry(
    eq?): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1778](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1778)
 
 Check if a specific value exists in a key's bucket.
 
@@ -948,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:2948](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2948)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3256)
 
 Returns the entry with the smallest key > given key.
 
@@ -986,7 +986,7 @@ Time O(log n), Space O(1)
 isEmpty(): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L298)
 
 Whether the map is empty.
 
@@ -1015,7 +1015,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2092](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2092)
 
 Iterates over all keys.
 
@@ -1047,7 +1047,7 @@ Time O(n), Space O(1)
 last(): [K, V[]] | undefined;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2598](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2598)
 
 Returns the entry with the largest key.
 
@@ -1079,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:3092](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3092)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3416](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3416)
 
 Returns the entry with the largest key < given key.
 
@@ -1117,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:3795](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3795)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4199)
 
 Creates a new map by transforming each entry.
 
@@ -1161,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:2400](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2400)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2648](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2648)
 
 Removes and returns the entry with the smallest key.
 
@@ -1195,7 +1195,7 @@ Time O(log n), Space O(1)
 pollLast(): [K, V[]] | undefined;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2697](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2697)
 
 Removes and returns the entry with the largest key.
 
@@ -1228,7 +1228,7 @@ Time O(log n), Space O(1)
 print(): void;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:3613](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L3613)
 
 Prints the internal tree structure (for debugging).
 
@@ -1259,7 +1259,7 @@ Time O(n), Space O(n)
 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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4972](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4972)
 
 Get elements by rank range
 
@@ -1282,7 +1282,7 @@ Get elements by rank range
 #### Example
 
 ```ts
-// Pagination with rangeByRank
+// Pagination by position in tree order
  const tree = new TreeMultiMap<number>(
         [10, 20, 30, 40, 50, 60, 70, 80, 90],
         { enableOrderStatistic: true }
@@ -1305,7 +1305,7 @@ Get elements by rank range
 rangeSearch<C>(range, callback?): ReturnType<C>[];
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4748](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4748)
 
 Searches for entries within a key range.
 
@@ -1355,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:3974](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L3974)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4398](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4398)
 
 Reduces all entries to a single value.
 
@@ -1406,7 +1406,7 @@ Time O(n), Space O(1)
 set(entry, value?): boolean;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1477](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1477)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1449,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:1338](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L1338)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:1478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L1478)
 
 Alias for compatibility with existing TreeMultiMap semantics.
 
@@ -1491,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:4141](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L4141)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:4585](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L4585)
 
 Sets multiple entries at once.
 
@@ -1528,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:2068](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-multi-map.ts#L2068)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2284)
 
 Iterates over all buckets.
 
@@ -1560,7 +1560,7 @@ Time O(n), Space O(1)
 valuesOf(key): IterableIterator<V>;
 ```
 
-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)
+Defined in: [data-structures/binary-tree/tree-multi-map.ts:2376](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-multi-map.ts#L2376)
 
 Iterates over all values for a specific key.