data-structure-typed 2.6.0 → 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:508](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L508)
+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:542](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L542)
+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:3908](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3908)
+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:1165](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1165)
+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,20 +255,14 @@ Remove all keys.
 clone(): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4858](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4858)
+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)
 
-Creates a shallow clone of this set.
+Deep copy
 
 #### Returns
 
 `TreeSet`\<`K`\>
 
-#### Remarks
-
-Time O(n log n), Space O(n)
-
- *
-
 #### Example
 
 ```ts
@@ -295,7 +281,7 @@ Time O(n log n), Space O(n)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:956](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L956)
+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.
 
@@ -315,8 +301,6 @@ Delete a key.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -336,7 +320,7 @@ Expected time O(log n)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:967](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L967)
+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.
 
@@ -360,20 +344,55 @@ Time O(N), Space O(N)
 
 ***
 
+### difference()
+
+```ts
+difference(other): TreeSet<K>;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys.
+
+#### Returns
+
+`TreeSet`\<`K`\>
+
+A new TreeSet.
+
+#### Remarks
+
+Time O(n+m) with ordered merge when possible, otherwise O(n log m).
+
+#### Example
+
+```ts
+// Find exclusive elements
+ console.log([...a.difference(b)]); // [1, 2];
+```
+
+***
+
 ### entries()
 
 ```ts
 entries(): IterableIterator<[K, K]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1736](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1736)
+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`\]\>
@@ -394,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:2719](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2719)
+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.
 
@@ -416,8 +435,6 @@ Test whether all values satisfy a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -434,7 +451,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): TreeSet<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2329](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2329)
+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.
 
@@ -456,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
@@ -475,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:3110](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3110)
+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.
 
@@ -497,8 +512,6 @@ Find the first value that satisfies a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -516,12 +529,10 @@ Time O(n), Space O(1)
 first(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3573](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3573)
+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`
@@ -565,12 +576,10 @@ Smallest key in the set.
 floor(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4074](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4074)
+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
@@ -601,14 +610,12 @@ Largest key that is <= the given key.
 forEach(cb, thisArg?): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1933](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1933)
+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
@@ -641,7 +648,7 @@ Callback follows native Set convention: `(value, value2, set)`.
 getByRank(k): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4616](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4616)
+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).
 
@@ -659,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
@@ -679,7 +684,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 getRank(key): number;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4634](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4634)
+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).
 
@@ -696,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
 
@@ -720,7 +724,7 @@ Time O(log n). Requires `enableOrderStatistic: true`.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:750](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L750)
+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.
 
@@ -738,8 +742,6 @@ Test whether a key exists.
 
 Expected time O(log n)
 
- *
-
 #### Example
 
 ```ts
@@ -758,12 +760,10 @@ Expected time O(log n)
 higher(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4238](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4238)
+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
@@ -786,18 +786,90 @@ Smallest key that is > the given key.
 
 ***
 
+### intersection()
+
+```ts
+intersection(other): TreeSet<K>;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+
+#### Returns
+
+`TreeSet`\<`K`\>
+
+A new TreeSet.
+
+#### Remarks
+
+Time O(n+m) with ordered merge when possible, otherwise O(n log m).
+
+#### Example
+
+```ts
+// Find common elements
+ console.log([...a.intersection(b)]); // [3, 4, 5];
+```
+
+***
+
+### isDisjointFrom()
+
+```ts
+isDisjointFrom(other): boolean;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+
+#### Returns
+
+`boolean`
+
+`true` if sets are disjoint.
+
+#### Remarks
+
+Time O(min(n,m)), can short-circuit on first overlap.
+
+#### Example
+
+```ts
+// Check disjoint
+ console.log(a.isDisjointFrom(new TreeSet([8, 9]))); // true;
+```
+
+***
+
 ### isEmpty()
 
 ```ts
 isEmpty(): boolean;
 ```
 
-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)
+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`
@@ -811,18 +883,90 @@ Whether the set is empty.
 
 ***
 
+### isSubsetOf()
+
+```ts
+isSubsetOf(other): boolean;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+
+#### Returns
+
+`boolean`
+
+`true` if this is a subset of other.
+
+#### Remarks
+
+Time O(n).
+
+#### Example
+
+```ts
+// Check subset
+ console.log(new TreeSet([3, 4]).isSubsetOf(a)); // true;
+```
+
+***
+
+### isSupersetOf()
+
+```ts
+isSupersetOf(other): boolean;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys.
+
+#### Returns
+
+`boolean`
+
+`true` if this is a superset of other.
+
+#### Remarks
+
+Time O(m).
+
+#### Example
+
+```ts
+// Check superset
+ console.log(a.isSupersetOf(new TreeSet([2, 3]))); // true;
+```
+
+***
+
 ### keys()
 
 ```ts
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1354](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1354)
+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`\>
@@ -843,12 +987,10 @@ Iterate over keys in ascending order.
 last(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3624](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3624)
+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`
@@ -870,12 +1012,10 @@ Largest key in the set.
 lower(key): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4402](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4402)
+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
@@ -907,7 +1047,7 @@ map<MK>(
 thisArg?): TreeSet<MK>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2126](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2126)
+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.
 
@@ -941,8 +1081,6 @@ This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
 
 Time O(n log n) expected, Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -960,12 +1098,10 @@ Time O(n log n) expected, Space O(n)
 pollFirst(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3677)
+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`
@@ -989,12 +1125,10 @@ Remove and return the smallest key.
 pollLast(): K | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3732](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3732)
+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`
@@ -1017,7 +1151,7 @@ Remove and return the largest key.
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3497](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3497)
+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.
 
@@ -1029,8 +1163,6 @@ Print a human-friendly representation.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1047,7 +1179,7 @@ Time O(n), Space O(n)
 rangeByRank(start, end): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4665](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4665)
+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).
 
@@ -1069,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
@@ -1097,7 +1224,7 @@ Time O(log n + k). Requires `enableOrderStatistic: true`.
 rangeSearch(range, options?): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:4580](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L4580)
+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.
 
@@ -1115,8 +1242,6 @@ Return all keys in a given range.
 
 Inclusive/exclusive bounds (defaults to inclusive).
 
- *
-
 #### Returns
 
 `K`[]
@@ -1130,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
@@ -1150,7 +1275,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
 reduce<A>(callbackfn, initialValue): A;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2528](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2528)
+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.
 
@@ -1178,8 +1303,6 @@ Reduce values into a single accumulator.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1197,7 +1320,7 @@ Time O(n), Space O(1)
 some(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:2914](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L2914)
+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.
 
@@ -1219,8 +1342,6 @@ Test whether any value satisfies a predicate.
 
 Time O(n), Space O(1)
 
- *
-
 #### Example
 
 ```ts
@@ -1231,13 +1352,50 @@ Time O(n), Space O(1)
 
 ***
 
+### symmetricDifference()
+
+```ts
+symmetricDifference(other): TreeSet<K>;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys.
+
+#### Returns
+
+`TreeSet`\<`K`\>
+
+A new TreeSet.
+
+#### Remarks
+
+Time O(n+m).
+
+#### Example
+
+```ts
+// Find symmetric difference
+ console.log([...a.symmetricDifference(b)]); // [1, 2, 6, 7];
+```
+
+***
+
 ### toArray()
 
 ```ts
 toArray(): K[];
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:3307](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L3307)
+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.
 
@@ -1249,8 +1407,6 @@ Materialize the set into an array of keys.
 
 Time O(n), Space O(n)
 
- *
-
 #### Example
 
 ```ts
@@ -1261,20 +1417,55 @@ Time O(n), Space O(n)
 
 ***
 
+### union()
+
+```ts
+union(other): TreeSet<K>;
+```
+
+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.
+
+#### Parameters
+
+##### other
+
+`Iterable`\<`K`\>
+
+Any iterable of keys.
+
+#### Returns
+
+`TreeSet`\<`K`\>
+
+A new TreeSet.
+
+#### Remarks
+
+When both sets share the same comparator, uses O(n+m) merge. Otherwise O(m log n).
+
+#### Example
+
+```ts
+// Merge two sets
+ console.log([...a.union(b)]); // [1, 2, 3, 4, 5, 6, 7];
+```
+
+***
+
 ### values()
 
 ```ts
 values(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-set.ts:1545](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/tree-set.ts#L1545)
+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`\>
@@ -1295,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.