data-structure-typed 2.6.1 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: TreeSet\<K, R\>
 
-Defined in: [data-structures/binary-tree/tree-set.ts:26](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L26)
+Defined in: [data-structures/binary-tree/tree-set.ts:30](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L30)
 
 An ordered Set backed by a red-black tree.
 
@@ -44,7 +44,7 @@ An ordered Set backed by a red-black tree.
 new TreeSet<K, R>(elements?, options?): TreeSet<K, R>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:46](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L46)
+Defined in: [data-structures/binary-tree/tree-set.ts:50](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L50)
 
 Create a TreeSet from an iterable of keys or raw elements.
 
@@ -92,7 +92,7 @@ const set = new TreeSet<number, User>(users, { toElementFn: u => u.id });
 get size(): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:101](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L101)
+Defined in: [data-structures/binary-tree/tree-set.ts:70](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L70)
 
 Number of elements in the set.
 
@@ -108,7 +108,7 @@ Number of elements in the set.
 add(key): this;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:538](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L538)
+Defined in: [data-structures/binary-tree/tree-set.ts:133](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L133)
 
 Add a key to the set (no-op if already present).
 
@@ -126,8 +126,6 @@ Add a key to the set (no-op if already present).
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -151,7 +149,7 @@ Expected time O(log n)
 addMany(keys): boolean[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:584](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L584)
+Defined in: [data-structures/binary-tree/tree-set.ts:151](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L151)
 
 Add multiple keys at once.
 
@@ -169,8 +167,6 @@ Iterable of keys to add.
 
 Array of booleans indicating whether each key was newly added.
 
- *
-
 #### Remarks
 
 Expected time O(m log n), where m is the number of keys.
@@ -192,12 +188,10 @@ Expected time O(m log n), where m is the number of keys.
 ceiling(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4199)
+Defined in: [data-structures/binary-tree/tree-set.ts:550](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L550)
 
 Smallest key that is >= the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -236,12 +230,10 @@ Smallest key that is >= the given key.
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1252)
+Defined in: [data-structures/binary-tree/tree-set.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L218)
 
 Remove all keys.
 
- *
-
 #### Returns
 
 `void`
@@ -263,12 +255,10 @@ Remove all keys.
 clone(): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5350](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5350)
+Defined in: [data-structures/binary-tree/tree-set.ts:837](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L837)
 
 Deep copy
 
- *
-
 #### Returns
 
 `TreeSet`\<`K`\>
@@ -291,7 +281,7 @@ Deep copy
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1028](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1028)
+Defined in: [data-structures/binary-tree/tree-set.ts:187](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L187)
 
 Delete a key.
 
@@ -311,8 +301,6 @@ Delete a key.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -332,7 +320,7 @@ Expected time O(log n)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1039](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1039)
+Defined in: [data-structures/binary-tree/tree-set.ts:198](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L198)
 
 Delete all keys matching a predicate.
 
@@ -362,7 +350,7 @@ Time O(N), Space O(N)
 difference(other): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5252)
+Defined in: [data-structures/binary-tree/tree-set.ts:748](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L748)
 
 Return a new TreeSet containing elements in this set but not in the other.
 
@@ -379,7 +367,6 @@ Any iterable of keys.
 `TreeSet`\<`K`\>
 
 A new TreeSet.
- *
 
 #### Remarks
 
@@ -400,14 +387,12 @@ Time O(n+m) with ordered merge when possible, otherwise O(n log m).
 entries(): IterableIterator<[K, K]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1868](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1868)
+Defined in: [data-structures/binary-tree/tree-set.ts:255](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L255)
 
 Iterate over `[value, value]` pairs (native Set convention).
 
 Note: TreeSet stores only keys internally; `[k, k]` is created on-the-fly during iteration.
 
- *
-
 #### Returns
 
 `IterableIterator`\<\[`K`, `K`\]\>
@@ -428,7 +413,7 @@ Note: TreeSet stores only keys internally; `[k, k]` is created on-the-fly during
 every(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2926](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2926)
+Defined in: [data-structures/binary-tree/tree-set.ts:357](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L357)
 
 Test whether all values satisfy a predicate.
 
@@ -450,8 +435,6 @@ Test whether all values satisfy a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -468,7 +451,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2506](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2506)
+Defined in: [data-structures/binary-tree/tree-set.ts:315](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L315)
 
 Create a new TreeSet containing only values that satisfy the predicate.
 
@@ -490,8 +473,6 @@ Create a new TreeSet containing only values that satisfy the predicate.
 
 Time O(n log n) expected, Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -509,7 +490,7 @@ Time O(n log n) expected, Space O(n)
 find(callbackfn, thisArg?): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3347)
+Defined in: [data-structures/binary-tree/tree-set.ts:408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L408)
 
 Find the first value that satisfies a predicate.
 
@@ -531,8 +512,6 @@ Find the first value that satisfies a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -550,12 +529,10 @@ Time O(n), Space O(1)
 first(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3843](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3843)
+Defined in: [data-structures/binary-tree/tree-set.ts:480](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L480)
 
 Smallest key in the set.
 
- *
-
 #### Returns
 
 `K` \| `undefined`
@@ -599,12 +576,10 @@ Smallest key in the set.
 floor(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4377](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4377)
+Defined in: [data-structures/binary-tree/tree-set.ts:566](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L566)
 
 Largest key that is <= the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -635,14 +610,12 @@ Largest key that is <= the given key.
 forEach(cb, thisArg?): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2080](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2080)
+Defined in: [data-structures/binary-tree/tree-set.ts:274](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L274)
 
 Visit each value in ascending order.
 
 Callback follows native Set convention: `(value, value2, set)`.
 
- *
-
 #### Parameters
 
 ##### cb
@@ -675,7 +648,7 @@ Callback follows native Set convention: `(value, value2, set)`.
 getByRank(k): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4955](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4955)
+Defined in: [data-structures/binary-tree/tree-set.ts:650](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L650)
 
 Returns the element at the k-th position in tree order (0-indexed).
 
@@ -693,8 +666,6 @@ Returns the element at the k-th position in tree order (0-indexed).
 
 Time O(log n). Requires `enableOrderStatistic: true`.
 
- *
-
 #### Example
 
 ```ts
@@ -713,7 +684,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 getRank(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4973](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4973)
+Defined in: [data-structures/binary-tree/tree-set.ts:670](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L670)
 
 Returns the 0-based rank of a key (number of elements that precede it in tree order).
 
@@ -730,7 +701,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
 
@@ -754,7 +724,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L807)
+Defined in: [data-structures/binary-tree/tree-set.ts:170](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L170)
 
 Test whether a key exists.
 
@@ -772,8 +742,6 @@ Test whether a key exists.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -792,12 +760,10 @@ Expected time O(log n)
 higher(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4553](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4553)
+Defined in: [data-structures/binary-tree/tree-set.ts:580](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L580)
 
 Smallest key that is > the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -826,7 +792,7 @@ Smallest key that is > the given key.
 intersection(other): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5234](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5234)
+Defined in: [data-structures/binary-tree/tree-set.ts:730](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L730)
 
 Return a new TreeSet containing only elements present in both sets.
 
@@ -843,7 +809,6 @@ Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
 `TreeSet`\<`K`\>
 
 A new TreeSet.
- *
 
 #### Remarks
 
@@ -864,7 +829,7 @@ Time O(n+m) with ordered merge when possible, otherwise O(n log m).
 isDisjointFrom(other): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5324](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5324)
+Defined in: [data-structures/binary-tree/tree-set.ts:820](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L820)
 
 Check whether this set and the other share no common elements.
 
@@ -881,7 +846,6 @@ Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
 `boolean`
 
 `true` if sets are disjoint.
- *
 
 #### Remarks
 
@@ -902,12 +866,10 @@ Time O(min(n,m)), can short-circuit on first overlap.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:304](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L304)
+Defined in: [data-structures/binary-tree/tree-set.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L114)
 
 Whether the set is empty.
 
- *
-
 #### Returns
 
 `boolean`
@@ -927,7 +889,7 @@ Whether the set is empty.
 isSubsetOf(other): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5291](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5291)
+Defined in: [data-structures/binary-tree/tree-set.ts:787](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L787)
 
 Check whether every element in this set is also in the other.
 
@@ -944,7 +906,6 @@ Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
 `boolean`
 
 `true` if this is a subset of other.
- *
 
 #### Remarks
 
@@ -965,7 +926,7 @@ Time O(n).
 isSupersetOf(other): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5308](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5308)
+Defined in: [data-structures/binary-tree/tree-set.ts:804](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L804)
 
 Check whether every element in the other set is also in this set.
 
@@ -982,7 +943,6 @@ Any iterable of keys.
 `boolean`
 
 `true` if this is a superset of other.
- *
 
 #### Remarks
 
@@ -1003,12 +963,10 @@ Time O(m).
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1456](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1456)
+Defined in: [data-structures/binary-tree/tree-set.ts:229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L229)
 
 Iterate over keys in ascending order.
 
- *
-
 #### Returns
 
 `IterableIterator`\<`K`\>
@@ -1029,12 +987,10 @@ Iterate over keys in ascending order.
 last(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3897)
+Defined in: [data-structures/binary-tree/tree-set.ts:494](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L494)
 
 Largest key in the set.
 
- *
-
 #### Returns
 
 `K` \| `undefined`
@@ -1056,12 +1012,10 @@ Largest key in the set.
 lower(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4729](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4729)
+Defined in: [data-structures/binary-tree/tree-set.ts:594](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L594)
 
 Largest key that is < the given key.
 
- *
-
 #### Parameters
 
 ##### key
@@ -1093,7 +1047,7 @@ map<MK>(
 thisArg?): TreeSet<MK>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2288](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2288)
+Defined in: [data-structures/binary-tree/tree-set.ts:289](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L289)
 
 Create a new TreeSet by mapping each value to a new key.
 
@@ -1127,8 +1081,6 @@ This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
 
 Time O(n log n) expected, Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1146,12 +1098,10 @@ Time O(n log n) expected, Space O(n)
 pollFirst(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3953](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3953)
+Defined in: [data-structures/binary-tree/tree-set.ts:508](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L508)
 
 Remove and return the smallest key.
 
- *
-
 #### Returns
 
 `K` \| `undefined`
@@ -1175,12 +1125,10 @@ Remove and return the smallest key.
 pollLast(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4011](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4011)
+Defined in: [data-structures/binary-tree/tree-set.ts:524](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L524)
 
 Remove and return the largest key.
 
- *
-
 #### Returns
 
 `K` \| `undefined`
@@ -1203,7 +1151,7 @@ Remove and return the largest key.
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3764](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3764)
+Defined in: [data-structures/binary-tree/tree-set.ts:445](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L445)
 
 Print a human-friendly representation.
 
@@ -1215,8 +1163,6 @@ Print a human-friendly representation.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1233,7 +1179,7 @@ Time O(n), Space O(n)
 rangeByRank(start, end): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5010](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5010)
+Defined in: [data-structures/binary-tree/tree-set.ts:689](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L689)
 
 Returns elements by rank range (0-indexed, inclusive on both ends).
 
@@ -1255,16 +1201,11 @@ Returns elements 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 TreeSet<number>(
-        [10, 20, 30, 40, 50, 60, 70, 80, 90],
-        { enableOrderStatistic: true }
-      );
+ const tree = new TreeSet<number>([10, 20, 30, 40, 50, 60, 70, 80, 90], { enableOrderStatistic: true });
       const pageSize = 3;
 
       // Page 1
@@ -1283,7 +1224,7 @@ Time O(log n + k). Requires `enableOrderStatistic: true`.
 rangeSearch(range, options?): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4919](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4919)
+Defined in: [data-structures/binary-tree/tree-set.ts:622](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L622)
 
 Return all keys in a given range.
 
@@ -1301,8 +1242,6 @@ Return all keys in a given range.
 
 Inclusive/exclusive bounds (defaults to inclusive).
 
- *
-
 #### Returns
 
 `K`[]
@@ -1316,7 +1255,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
       167772160, // 10.0.0.0
       167772416, // 10.0.1.0
       167772672, // 10.0.2.0
-      167773184  // 10.0.4.0
+      167773184 // 10.0.4.0
     ]);
 
     // Check if any blocked IP is in range 10.0.1.0 - 10.0.3.0
@@ -1336,7 +1275,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
 reduce<A>(callbackfn, initialValue): A;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2720](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2720)
+Defined in: [data-structures/binary-tree/tree-set.ts:342](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L342)
 
 Reduce values into a single accumulator.
 
@@ -1364,8 +1303,6 @@ Reduce values into a single accumulator.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1383,7 +1320,7 @@ Time O(n), Space O(1)
 some(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3136](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3136)
+Defined in: [data-structures/binary-tree/tree-set.ts:382](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L382)
 
 Test whether any value satisfies a predicate.
 
@@ -1405,8 +1342,6 @@ Test whether any value satisfies a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1423,7 +1358,7 @@ Time O(n), Space O(1)
 symmetricDifference(other): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5270](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5270)
+Defined in: [data-structures/binary-tree/tree-set.ts:766](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L766)
 
 Return a new TreeSet containing elements in either set but not both.
 
@@ -1440,7 +1375,6 @@ Any iterable of keys.
 `TreeSet`\<`K`\>
 
 A new TreeSet.
- *
 
 #### Remarks
 
@@ -1461,7 +1395,7 @@ Time O(n+m).
 toArray(): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3559](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3559)
+Defined in: [data-structures/binary-tree/tree-set.ts:433](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L433)
 
 Materialize the set into an array of keys.
 
@@ -1473,8 +1407,6 @@ Materialize the set into an array of keys.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1491,7 +1423,7 @@ Time O(n), Space O(n)
 union(other): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:5219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L5219)
+Defined in: [data-structures/binary-tree/tree-set.ts:702](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L702)
 
 Return a new TreeSet containing all elements from both sets.
 
@@ -1508,7 +1440,6 @@ Any iterable of keys.
 `TreeSet`\<`K`\>
 
 A new TreeSet.
- *
 
 #### Remarks
 
@@ -1529,14 +1460,12 @@ When both sets share the same comparator, uses O(n+m) merge. Otherwise O(m log n
 values(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1662](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1662)
+Defined in: [data-structures/binary-tree/tree-set.ts:242](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L242)
 
 Iterate over values in ascending order.
 
 Note: for Set-like containers, `values()` is the same as `keys()`.
 
- *
-
 #### Returns
 
 `IterableIterator`\<`K`\>
@@ -1557,7 +1486,7 @@ Note: for Set-like containers, `values()` is the same as `keys()`.
 static createDefaultComparator<K>(): Comparator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:71](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L71)
+Defined in: [data-structures/binary-tree/tree-set.ts:84](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L84)
 
 Create the strict default comparator.