data-structure-typed 2.5.1 → 2.5.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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L26)
+Defined in: [data-structures/binary-tree/tree-map.ts:26](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L26)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L46)
+Defined in: [data-structures/binary-tree/tree-map.ts:46](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L46)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L134)
+Defined in: [data-structures/binary-tree/tree-map.ts:134](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L134)
 
 Number of entries in the map.
 
@@ -113,7 +113,7 @@ Number of entries in the map.
 ceiling(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3061](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3061)
+Defined in: [data-structures/binary-tree/tree-map.ts:3747](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3747)
 
 Smallest entry whose key is >= the given key.
 
@@ -172,7 +172,7 @@ Smallest entry whose key is >= the given key.
 clear(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1028](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1028)
+Defined in: [data-structures/binary-tree/tree-map.ts:1238](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1238)
 
 Remove all entries.
 
@@ -199,7 +199,7 @@ Remove all entries.
 clone(): TreeMap<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3751](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3751)
+Defined in: [data-structures/binary-tree/tree-map.ts:4652](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4652)
 
 Creates a shallow clone of this map.
 
@@ -231,7 +231,7 @@ Time O(n log n), Space O(n)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:891](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L891)
+Defined in: [data-structures/binary-tree/tree-map.ts:1066](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1066)
 
 Delete a key.
 
@@ -277,7 +277,7 @@ Expected time O(log n)
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1440](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1440)
+Defined in: [data-structures/binary-tree/tree-map.ts:1755](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1755)
 
 Iterate over `[key, value]` entries in ascending key order.
 
@@ -305,7 +305,7 @@ Note: values may be `undefined`.
 every(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2147](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2147)
+Defined in: [data-structures/binary-tree/tree-map.ts:2637](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2637)
 
 Test whether all entries satisfy a predicate.
 
@@ -345,7 +345,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): TreeMap<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1868](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1868)
+Defined in: [data-structures/binary-tree/tree-map.ts:2288](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2288)
 
 Create a new TreeMap containing only entries that satisfy the predicate.
 
@@ -386,7 +386,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:2428](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2428)
+Defined in: [data-structures/binary-tree/tree-map.ts:2988](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2988)
 
 Find the first entry that satisfies a predicate.
 
@@ -428,7 +428,7 @@ Time O(n), Space O(1)
 first(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2770](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2770)
+Defined in: [data-structures/binary-tree/tree-map.ts:3407](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3407)
 
 Smallest entry by key.
 
@@ -476,7 +476,7 @@ Smallest entry by key.
 floor(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3191](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3191)
+Defined in: [data-structures/binary-tree/tree-map.ts:3905](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3905)
 
 Largest entry whose key is <= the given key.
 
@@ -519,7 +519,7 @@ Largest entry whose key is <= the given key.
 forEach(cb, thisArg?): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1582](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1582)
+Defined in: [data-structures/binary-tree/tree-map.ts:1932](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1932)
 
 Visit each entry in ascending key order.
 
@@ -535,7 +535,7 @@ Note: callback value may be `undefined`.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 #### Returns
 
@@ -559,7 +559,7 @@ Note: callback value may be `undefined`.
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:582](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L582)
+Defined in: [data-structures/binary-tree/tree-map.ts:687](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L687)
 
 Get the value under a key.
 
@@ -596,13 +596,95 @@ Expected time O(log n)
 
 ***
 
+### getByRank()
+
+```ts
+getByRank(k): [K, V | undefined] | undefined;
+```
+
+Defined in: [data-structures/binary-tree/tree-map.ts:4433](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4433)
+
+Returns the entry at the k-th position in tree order (0-indexed).
+
+#### Parameters
+
+##### k
+
+`number`
+
+#### Returns
+
+\[`K`, `V` \| `undefined`\] \| `undefined`
+
+#### Remarks
+
+Time O(log n). Requires `enableOrderStatistic: true`.
+
+ *
+
+#### Example
+
+```ts
+// Find k-th entry in a TreeMap
+ const map = new TreeMap<string, number>(
+        [['alice', 95], ['bob', 87], ['charlie', 92]],
+        { enableOrderStatistic: true }
+      );
+      console.log(map.getByRank(0)); // 'alice';
+      console.log(map.getByRank(1)); // 'bob';
+      console.log(map.getByRank(2)); // 'charlie';
+```
+
+***
+
+### getRank()
+
+```ts
+getRank(key): number;
+```
+
+Defined in: [data-structures/binary-tree/tree-map.ts:4453](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4453)
+
+Returns the 0-based rank of a key (number of elements that precede it in tree order).
+
+#### Parameters
+
+##### key
+
+`K`
+
+#### Returns
+
+`number`
+
+#### Remarks
+
+Time O(log n). Requires `enableOrderStatistic: true`.
+ *
+
+#### Example
+
+```ts
+// Get the rank of a key in sorted order
+ const tree = new TreeMap<number>(
+        [10, 20, 30, 40, 50],
+        { enableOrderStatistic: true }
+      );
+      console.log(tree.getRank(10)); // 0;  // smallest → rank 0
+      console.log(tree.getRank(30)); // 2;  // 2 elements before 30 in tree order
+      console.log(tree.getRank(50)); // 4;  // largest → rank 4
+      console.log(tree.getRank(25)); // 2;
+```
+
+***
+
 ### has()
 
 ```ts
 has(key): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:735](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L735)
+Defined in: [data-structures/binary-tree/tree-map.ts:875](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L875)
 
 Test whether a key exists.
 
@@ -644,7 +726,7 @@ Expected time O(log n)
 higher(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3321](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3321)
+Defined in: [data-structures/binary-tree/tree-map.ts:4063](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4063)
 
 Smallest entry whose key is > the given key.
 
@@ -687,7 +769,7 @@ Smallest entry whose key is > the given key.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:267](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L267)
+Defined in: [data-structures/binary-tree/tree-map.ts:302](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L302)
 
 Whether the map is empty.
 
@@ -712,7 +794,7 @@ Whether the map is empty.
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1162](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1162)
+Defined in: [data-structures/binary-tree/tree-map.ts:1407](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1407)
 
 Iterate over keys in ascending order.
 
@@ -738,7 +820,7 @@ Iterate over keys in ascending order.
 last(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2816](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2816)
+Defined in: [data-structures/binary-tree/tree-map.ts:3460](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3460)
 
 Largest entry by key.
 
@@ -770,7 +852,7 @@ Largest entry by key.
 lower(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3449](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3449)
+Defined in: [data-structures/binary-tree/tree-map.ts:4219](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4219)
 
 Largest entry whose key is < the given key.
 
@@ -814,7 +896,7 @@ map<MK, MV>(
 thisArg?): TreeMap<MK, MV>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1720](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1720)
+Defined in: [data-structures/binary-tree/tree-map.ts:2105](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2105)
 
 Create a new TreeMap by mapping each entry to a new `[key, value]` entry.
 
@@ -871,7 +953,7 @@ Time O(n log n) expected, Space O(n)
 pollFirst(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2864](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2864)
+Defined in: [data-structures/binary-tree/tree-map.ts:3515](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3515)
 
 Remove and return the smallest entry.
 
@@ -905,7 +987,7 @@ Remove and return the smallest entry.
 pollLast(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2914](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2914)
+Defined in: [data-structures/binary-tree/tree-map.ts:3572](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3572)
 
 Remove and return the largest entry.
 
@@ -939,7 +1021,7 @@ Remove and return the largest entry.
 print(): void;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2705](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2705)
+Defined in: [data-structures/binary-tree/tree-map.ts:3335](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3335)
 
 Print a human-friendly representation.
 
@@ -963,13 +1045,63 @@ Time O(n), Space O(n)
 
 ***
 
+### rangeByRank()
+
+```ts
+rangeByRank(start, end): [K, V | undefined][];
+```
+
+Defined in: [data-structures/binary-tree/tree-map.ts:4476](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4476)
+
+Returns keys by rank range (0-indexed, inclusive on both ends).
+
+#### Parameters
+
+##### start
+
+`number`
+
+##### end
+
+`number`
+
+#### Returns
+
+\[`K`, `V` \| `undefined`\][]
+
+#### Remarks
+
+Time O(log n + k). Requires `enableOrderStatistic: true`.
+
+ *
+
+#### Example
+
+```ts
+// Pagination with rangeByRank
+ const tree = new TreeMap<number>(
+        [10, 20, 30, 40, 50, 60, 70, 80, 90],
+        { enableOrderStatistic: true }
+      );
+      const pageSize = 3;
+
+      // Page 1
+      console.log(tree.rangeByRank(0, pageSize - 1)); // [10, 20, 30];
+      // Page 2
+      console.log(tree.rangeByRank(pageSize, 2 * pageSize - 1)); // [40, 50, 60];
+      // Page 3
+      console.log(tree.rangeByRank(2 * pageSize, 3 * pageSize - 1)); // [70, 80, 90];
+```
+
+***
+
 ### rangeSearch()
 
 ```ts
 rangeSearch(range, options?): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:3597](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L3597)
+Defined in: [data-structures/binary-tree/tree-map.ts:4395](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L4395)
 
 Return all entries in a given key range.
 
@@ -1035,7 +1167,7 @@ Inclusive/exclusive bounds (defaults to inclusive).
 reduce<A>(callbackfn, initialValue): A;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2011](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2011)
+Defined in: [data-structures/binary-tree/tree-map.ts:2466](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2466)
 
 Reduce entries into a single accumulator.
 
@@ -1081,7 +1213,7 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:427](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L427)
+Defined in: [data-structures/binary-tree/tree-map.ts:497](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L497)
 
 Set or overwrite a value for a key.
 
@@ -1137,7 +1269,7 @@ Expected time O(log n)
 some(callbackfn, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2287](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2287)
+Defined in: [data-structures/binary-tree/tree-map.ts:2812](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L2812)
 
 Test whether any entry satisfies a predicate.
 
@@ -1177,7 +1309,7 @@ Time O(n), Space O(1)
 toArray(): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:2570](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L2570)
+Defined in: [data-structures/binary-tree/tree-map.ts:3165](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L3165)
 
 Materialize the map into an array of `[key, value]` tuples.
 
@@ -1207,7 +1339,7 @@ Time O(n), Space O(n)
 values(): IterableIterator<V | undefined>;
 ```
 
-Defined in: [data-structures/binary-tree/tree-map.ts:1304](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L1304)
+Defined in: [data-structures/binary-tree/tree-map.ts:1584](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L1584)
 
 Iterate over values in ascending key order.
 
@@ -1235,7 +1367,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/binary-tree/tree-map.ts#L87)
+Defined in: [data-structures/binary-tree/tree-map.ts:87](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/tree-map.ts#L87)
 
 Create the strict default comparator.