data-structure-typed 2.6.1 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: TreeMap\<K, V, R\>
 
-Defined in: [data-structures/binary-tree/tree-map.ts:26](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L26)
+Defined in: [data-structures/binary-tree/tree-map.ts:30](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L30)
 
 An ordered Map backed by a red-black tree.
 
@@ -48,7 +48,7 @@ An ordered Map backed by a red-black tree.
 new TreeMap<K, V, R>(entries?, options?): TreeMap<K, V, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:46](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L46)
+Defined in: [data-structures/binary-tree/tree-map.ts:50](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L50)
 
 Create a TreeMap from an iterable of `[key, value]` entries or raw elements.
 
@@ -97,7 +97,7 @@ const map = new TreeMap<number, User, User>(users, { toEntryFn: u => [u.id, u] }
 get size(): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:134](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L134)
+Defined in: [data-structures/binary-tree/tree-map.ts:81](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L81)
 
 Number of entries in the map.
 
@@ -113,12 +113,10 @@ Number of entries in the map.
 ceiling(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4498](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4498)
+Defined in: [data-structures/binary-tree/tree-map.ts:683](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L683)
 
 Smallest entry whose key is >= the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -146,12 +144,7 @@ Smallest entry whose key is >= the given key.
     events.set(standup, 'Daily Standup');
 
     // Events are sorted chronologically
-    console.log([...events.values()]); // [
- //      'Daily Standup',
- //      'Team Meeting',
- //      'Lunch Break',
- //      'Code Review'
- //    ];
+    console.log([...events.values()]); // ['Daily Standup', 'Team Meeting', 'Lunch Break', 'Code Review'];
 
     // Next event after 11:00
     const after11 = new Date('2024-01-15T11:00:00Z');
@@ -172,12 +165,10 @@ Smallest entry whose key is >= the given key.
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1513](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1513)
+Defined in: [data-structures/binary-tree/tree-map.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L269)
 
 Remove all entries.
 
- *
-
 #### Returns
 
 `void`
@@ -199,7 +190,7 @@ Remove all entries.
 clone(): TreeMap<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5564](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5564)
+Defined in: [data-structures/binary-tree/tree-map.ts:882](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L882)
 
 Creates a shallow clone of this map.
 
@@ -211,13 +202,14 @@ Creates a shallow clone of this map.
 
 Time O(n log n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
 // Deep clone
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b']
+      ]);
       const copy = tm.clone();
       copy.delete(1);
       console.log(tm.has(1)); // true;
@@ -231,7 +223,7 @@ Time O(n log n), Space O(n)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1289](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1289)
+Defined in: [data-structures/binary-tree/tree-map.ts:238](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L238)
 
 Delete a key.
 
@@ -251,8 +243,6 @@ Delete a key.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -277,7 +267,7 @@ Expected time O(log n)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1300](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1300)
+Defined in: [data-structures/binary-tree/tree-map.ts:249](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L249)
 
 Delete all entries matching a predicate.
 
@@ -307,14 +297,12 @@ Time O(N), Space O(N)
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L2135)
+Defined in: [data-structures/binary-tree/tree-map.ts:320](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L320)
 
 Iterate over `[key, value]` entries in ascending key order.
 
 Note: values may be `undefined`.
 
- *
-
 #### Returns
 
 `IterableIterator`\<\[`K`, `V` \| `undefined`\]\>
@@ -323,8 +311,16 @@ Note: values may be `undefined`.
 
 ```ts
 // Iterate key-value pairs
- const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a'], [2, 'b']]);
-      console.log([...tm.entries()]); // [[1, 'a'], [2, 'b'], [3, 'c']];
+ const tm = new TreeMap<number, string>([
+        [3, 'c'],
+        [1, 'a'],
+        [2, 'b']
+      ]);
+      console.log([...tm.entries()]); // [
+ //        [1, 'a'],
+ //        [2, 'b'],
+ //        [3, 'c']
+ //      ];
 ```
 
 ***
@@ -335,7 +331,7 @@ Note: values may be `undefined`.
 every(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3192](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L3192)
+Defined in: [data-structures/binary-tree/tree-map.ts:444](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L444)
 
 Test whether all entries satisfy a predicate.
 
@@ -357,13 +353,14 @@ Test whether all entries satisfy a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
 // Test all entries
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b']
+      ]);
       console.log(tm.every((v, k) => k > 0)); // true;
 ```
 
@@ -375,7 +372,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): TreeMap<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2773](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L2773)
+Defined in: [data-structures/binary-tree/tree-map.ts:396](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L396)
 
 Create a new TreeMap containing only entries that satisfy the predicate.
 
@@ -397,13 +394,15 @@ Create a new TreeMap containing only entries that satisfy the predicate.
 
 Time O(n log n) expected, Space O(n)
 
- *
-
 #### Example
 
 ```ts
 // Filter entries
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b'],
+        [3, 'c']
+      ]);
       const filtered = tm.filter((v, k) => k > 1);
       console.log([...filtered.keys()]); // [2, 3];
 ```
@@ -416,7 +415,7 @@ Time O(n log n) expected, Space O(n)
 find(callbackfn, thisArg?): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3613](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L3613)
+Defined in: [data-structures/binary-tree/tree-map.ts:503](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L503)
 
 Find the first entry that satisfies a predicate.
 
@@ -440,13 +439,14 @@ The first matching `[key, value]` tuple, or `undefined`.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
 // Find matching entry
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b']
+      ]);
       console.log(tm.find(v => v === 'b')?.[0]); // 2;
 ```
 
@@ -458,12 +458,10 @@ Time O(n), Space O(1)
 first(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4109](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4109)
+Defined in: [data-structures/binary-tree/tree-map.ts:584](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L584)
 
 Smallest entry by key.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -506,12 +504,10 @@ Smallest entry by key.
 floor(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4684](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4684)
+Defined in: [data-structures/binary-tree/tree-map.ts:707](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L707)
 
 Largest entry whose key is <= the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -549,14 +545,12 @@ Largest entry whose key is <= the given key.
 forEach(cb, thisArg?): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L2347)
+Defined in: [data-structures/binary-tree/tree-map.ts:342](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L342)
 
 Visit each entry in ascending key order.
 
 Note: callback value may be `undefined`.
 
- *
-
 #### Parameters
 
 ##### cb
@@ -575,7 +569,10 @@ Note: callback value may be `undefined`.
 
 ```ts
 // Execute for each entry
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b']
+      ]);
       const pairs: string[] = [];
       tm.forEach((v, k) => pairs.push(`${k}:${v}`));
       console.log(pairs); // ['1:a', '2:b'];
@@ -589,7 +586,7 @@ Note: callback value may be `undefined`.
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:840](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L840)
+Defined in: [data-structures/binary-tree/tree-map.ts:197](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L197)
 
 Get the value under a key.
 
@@ -607,8 +604,6 @@ Get the value under a key.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -632,7 +627,7 @@ Expected time O(log n)
 getByRank(k): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5296](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5296)
+Defined in: [data-structures/binary-tree/tree-map.ts:823](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L823)
 
 Returns the entry at the k-th position in tree order (0-indexed).
 
@@ -650,8 +645,6 @@ Returns the entry at the k-th position in tree order (0-indexed).
 
 Time O(log n). Requires `enableOrderStatistic: true`.
 
- *
-
 #### Example
 
 ```ts
@@ -673,7 +666,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 getRank(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5316](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5316)
+Defined in: [data-structures/binary-tree/tree-map.ts:843](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L843)
 
 Returns the 0-based rank of a key (number of elements that precede it in tree order).
 
@@ -690,7 +683,6 @@ Returns the 0-based rank of a key (number of elements that precede it in tree or
 #### Remarks
 
 Time O(log n). Requires `enableOrderStatistic: true`.
- *
 
 #### Example
 
@@ -714,7 +706,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1063](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1063)
+Defined in: [data-structures/binary-tree/tree-map.ts:216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L216)
 
 Test whether a key exists.
 
@@ -732,8 +724,6 @@ Test whether a key exists.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -756,12 +746,10 @@ Expected time O(log n)
 higher(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4870](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4870)
+Defined in: [data-structures/binary-tree/tree-map.ts:731](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L731)
 
 Smallest entry whose key is > the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -799,12 +787,10 @@ Smallest entry whose key is > the given key.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:337](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L337)
+Defined in: [data-structures/binary-tree/tree-map.ts:124](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L124)
 
 Whether the map is empty.
 
- *
-
 #### Returns
 
 `boolean`
@@ -824,12 +810,10 @@ Whether the map is empty.
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1717](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1717)
+Defined in: [data-structures/binary-tree/tree-map.ts:283](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L283)
 
 Iterate over keys in ascending order.
 
- *
-
 #### Returns
 
 `IterableIterator`\<`K`\>
@@ -838,7 +822,10 @@ Iterate over keys in ascending order.
 
 ```ts
 // Get sorted keys
- const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a']]);
+ const tm = new TreeMap<number, string>([
+        [3, 'c'],
+        [1, 'a']
+      ]);
       console.log([...tm.keys()]); // [1, 3];
 ```
 
@@ -850,12 +837,10 @@ Iterate over keys in ascending order.
 last(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4169](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4169)
+Defined in: [data-structures/binary-tree/tree-map.ts:602](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L602)
 
 Largest entry by key.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -882,12 +867,10 @@ Largest entry by key.
 lower(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5054](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5054)
+Defined in: [data-structures/binary-tree/tree-map.ts:753](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L753)
 
 Largest entry whose key is < the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -926,7 +909,7 @@ map<MK, MV>(
 thisArg?): TreeMap<MK, MV>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2555](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L2555)
+Defined in: [data-structures/binary-tree/tree-map.ts:360](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L360)
 
 Create a new TreeMap by mapping each entry to a new `[key, value]` entry.
 
@@ -964,13 +947,14 @@ This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
 
 Time O(n log n) expected, Space O(n)
 
- *
-
 #### Example
 
 ```ts
 // Transform entries
- const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
+ const tm = new TreeMap<number, number>([
+        [1, 10],
+        [2, 20]
+      ]);
       const doubled = tm.map((v, k) => [k, (v ?? 0) * 2] as [number, number]);
       console.log([...doubled.values()]); // [20, 40];
 ```
@@ -983,12 +967,10 @@ Time O(n log n) expected, Space O(n)
 pollFirst(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4231](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4231)
+Defined in: [data-structures/binary-tree/tree-map.ts:625](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L625)
 
 Remove and return the smallest entry.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -1017,12 +999,10 @@ Remove and return the smallest entry.
 pollLast(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4295)
+Defined in: [data-structures/binary-tree/tree-map.ts:647](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L647)
 
 Remove and return the largest entry.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -1051,7 +1031,7 @@ Remove and return the largest entry.
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:4030](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L4030)
+Defined in: [data-structures/binary-tree/tree-map.ts:550](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L550)
 
 Print a human-friendly representation.
 
@@ -1063,8 +1043,6 @@ Print a human-friendly representation.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1081,7 +1059,7 @@ Time O(n), Space O(n)
 rangeByRank(start, end): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5353](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5353)
+Defined in: [data-structures/binary-tree/tree-map.ts:864](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L864)
 
 Returns keys by rank range (0-indexed, inclusive on both ends).
 
@@ -1103,16 +1081,11 @@ Returns keys by rank range (0-indexed, inclusive on both ends).
 
 Time O(log n + k). Requires `enableOrderStatistic: true`.
 
- *
-
 #### Example
 
 ```ts
 // Pagination by position in tree order
- const tree = new TreeMap<number>(
-        [10, 20, 30, 40, 50, 60, 70, 80, 90],
-        { enableOrderStatistic: true }
-      );
+ const tree = new TreeMap<number>([10, 20, 30, 40, 50, 60, 70, 80, 90], { enableOrderStatistic: true });
       const pageSize = 3;
 
       // Page 1
@@ -1131,7 +1104,7 @@ Time O(log n + k). Requires `enableOrderStatistic: true`.
 rangeSearch(range, options?): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:5258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L5258)
+Defined in: [data-structures/binary-tree/tree-map.ts:792](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L792)
 
 Return all entries in a given key range.
 
@@ -1149,8 +1122,6 @@ Return all entries in a given key range.
 
 Inclusive/exclusive bounds (defaults to inclusive).
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\][]
@@ -1182,10 +1153,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
     console.log([...highStock.keys()]); // ['Doohickey', 'Widget'];
 
     // Calculate total inventory value
-    const totalValue = inventory.reduce(
-      (sum, p) => sum + (p ? p.price * p.stock : 0),
-      0
-    );
+    const totalValue = inventory.reduce((sum, p) => sum + (p ? p.price * p.stock : 0), 0);
     console.log(totalValue); // toBeCloseTo;
 ```
 
@@ -1197,7 +1165,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
 reduce<A>(callbackfn, initialValue): A;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2986](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L2986)
+Defined in: [data-structures/binary-tree/tree-map.ts:426](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L426)
 
 Reduce entries into a single accumulator.
 
@@ -1225,13 +1193,14 @@ Reduce entries into a single accumulator.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
 // Aggregate values
- const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
+ const tm = new TreeMap<number, number>([
+        [1, 10],
+        [2, 20]
+      ]);
       console.log(tm.reduce((acc, v) => acc + (v ?? 0), 0)); // 30;
 ```
 
@@ -1243,7 +1212,7 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:567](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L567)
+Defined in: [data-structures/binary-tree/tree-map.ts:152](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L152)
 
 Set or overwrite a value for a key.
 
@@ -1265,8 +1234,6 @@ Set or overwrite a value for a key.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -1299,7 +1266,7 @@ Expected time O(log n)
 setMany(entries): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:612](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L612)
+Defined in: [data-structures/binary-tree/tree-map.ts:173](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L173)
 
 Set multiple key-value pairs at once.
 
@@ -1317,8 +1284,6 @@ Iterable of `[key, value]` tuples.
 
 Array of booleans indicating whether each entry was successfully set.
 
- *
-
 #### Remarks
 
 Expected time O(m log n), where m is the number of entries.
@@ -1328,7 +1293,11 @@ Expected time O(m log n), where m is the number of entries.
 ```ts
 // Set multiple key-value pairs
  const tm = new TreeMap<number, string>();
-    tm.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+    tm.setMany([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     console.log(tm.size); // 3;
 ```
 
@@ -1340,7 +1309,7 @@ Expected time O(m log n), where m is the number of entries.
 some(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3402](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L3402)
+Defined in: [data-structures/binary-tree/tree-map.ts:473](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L473)
 
 Test whether any entry satisfies a predicate.
 
@@ -1362,13 +1331,14 @@ Test whether any entry satisfies a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
 // Test any entry
- const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+ const tm = new TreeMap<number, string>([
+        [1, 'a'],
+        [2, 'b']
+      ]);
       console.log(tm.some((v, k) => k === 2)); // true;
 ```
 
@@ -1380,7 +1350,7 @@ Time O(n), Space O(1)
 toArray(): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3825](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L3825)
+Defined in: [data-structures/binary-tree/tree-map.ts:538](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L538)
 
 Materialize the map into an array of `[key, value]` tuples.
 
@@ -1392,14 +1362,18 @@ Materialize the map into an array of `[key, value]` tuples.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
 // Convert to array
- const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
-      console.log(tm.toArray()); // [[1, 'a'], [2, 'b']];
+ const tm = new TreeMap<number, string>([
+        [2, 'b'],
+        [1, 'a']
+      ]);
+      console.log(tm.toArray()); // [
+ //        [1, 'a'],
+ //        [2, 'b']
+ //      ];
 ```
 
 ***
@@ -1410,14 +1384,12 @@ Time O(n), Space O(n)
 values(): IterableIterator<V | undefined>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1929](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L1929)
+Defined in: [data-structures/binary-tree/tree-map.ts:299](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L299)
 
 Iterate over values in ascending key order.
 
 Note: values may be `undefined` (TreeMap allows storing `undefined`, like native `Map`).
 
- *
-
 #### Returns
 
 `IterableIterator`\<`V` \| `undefined`\>
@@ -1426,7 +1398,10 @@ Note: values may be `undefined` (TreeMap allows storing `undefined`, like native
 
 ```ts
 // Get values in key order
- const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
+ const tm = new TreeMap<number, string>([
+        [2, 'b'],
+        [1, 'a']
+      ]);
       console.log([...tm.values()]); // ['a', 'b'];
 ```
 
@@ -1438,7 +1413,7 @@ Note: values may be `undefined` (TreeMap allows storing `undefined`, like native
 static createDefaultComparator<K>(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:87](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L87)
+Defined in: [data-structures/binary-tree/tree-map.ts:95](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-map.ts#L95)
 
 Create the strict default comparator.