data-structure-typed 2.5.2 → 2.6.0

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

@@ -6,7 +6,7 @@
 
 # Class: SinglyLinkedListNode\<E\>
 
-Defined in: [data-structures/linked-list/singly-linked-list.ts:17](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/singly-linked-list.ts#L17)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:17](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L17)
 
 Node of a singly linked list; stores value and the next link.
 
@@ -32,7 +32,7 @@ Time O(1), Space O(1)
 new SinglyLinkedListNode<E>(value): SinglyLinkedListNode<E>;
 ```
 
-Defined in: [data-structures/linked-list/singly-linked-list.ts:25](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/singly-linked-list.ts#L25)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:25](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L25)
 
 Create a list node.
 
@@ -68,7 +68,7 @@ Time O(1), Space O(1)
 get next(): SinglyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/singly-linked-list.ts:39](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/singly-linked-list.ts#L39)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:39](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L39)
 
 Get the next node.
 
@@ -88,7 +88,7 @@ Next node or undefined.
 set next(value): void;
 ```
 
-Defined in: [data-structures/linked-list/singly-linked-list.ts:50](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/singly-linked-list.ts#L50)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:50](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L50)
 
 Set the next node.
 
@@ -124,7 +124,7 @@ void
 get value(): E;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:27](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/linear-base.ts#L27)
+Defined in: [data-structures/base/linear-base.ts:27](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L27)
 
 Element payload getter.
 
@@ -144,7 +144,7 @@ Element value.
 set value(value): void;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:36](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/linear-base.ts#L36)
+Defined in: [data-structures/base/linear-base.ts:36](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L36)
 
 Element payload setter.
 

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

@@ -6,7 +6,7 @@
 
 # Class: SkipList\<K, V, R\>
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:49](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L49)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:49](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L49)
 
 SkipList — a probabilistic sorted key-value container.
 
@@ -49,7 +49,7 @@ Reference: Java ConcurrentSkipListMap (NavigableMap interface).
 get size(): number;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:122](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L122)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:122](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L122)
 
 Total number of entries.
 
@@ -75,7 +75,7 @@ Entry count.
 iterator: IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L22)
+Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L22)
 
 Default iterator yielding `[key, value]` entries.
 
@@ -107,7 +107,7 @@ Time O(n) to iterate, Space O(1)
 ceiling(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:783](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L783)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:831](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L831)
 
 Least entry ≥ key, or `undefined`.
 
@@ -140,7 +140,7 @@ Least entry ≥ key, or `undefined`.
 clear(): void;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:221](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L221)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L229)
 
 Remove all entries
 
@@ -171,7 +171,7 @@ Remove all entries
 clone(): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:268](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L268)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:280](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L280)
 
 Create independent copy
 
@@ -203,7 +203,7 @@ Create independent copy
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:525](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L525)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:553](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L553)
 
 Delete a key. Returns `true` if the key was found and removed.
 
@@ -243,7 +243,7 @@ Delete a key. Returns `true` if the key was found and removed.
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L31)
+Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L31)
 
 Iterate over `[key, value]` pairs (may yield `undefined` values).
 
@@ -269,7 +269,7 @@ Time O(n), Space O(1)
 every(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L66)
+Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L66)
 
 Test whether all entries satisfy the predicate.
 
@@ -309,7 +309,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1129](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1129)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1201](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1201)
 
 Creates a new SkipList with entries that pass the predicate.
 
@@ -350,7 +350,7 @@ Creates a new SkipList with entries that pass the predicate.
 find(callbackfn, thisArg?): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L114)
+Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L114)
 
 Find the first entry that matches a predicate.
 
@@ -390,7 +390,7 @@ Time O(n), Space O(1)
 first(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:589](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L589)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L621)
 
 Returns the first (smallest key) entry, or `undefined` if empty.
 
@@ -416,7 +416,7 @@ Returns the first (smallest key) entry, or `undefined` if empty.
 floor(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:838](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L838)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:890](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L890)
 
 Greatest entry ≤ key, or `undefined`.
 
@@ -449,7 +449,7 @@ Greatest entry ≤ key, or `undefined`.
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L99)
+Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L99)
 
 Visit each entry, left-to-right.
 
@@ -487,7 +487,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:422](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L422)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:442](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L442)
 
 Get the value for a key, or `undefined` if not found.
 Overrides base O(n) with O(log n) skip-list search.
@@ -540,7 +540,7 @@ Overrides base O(n) with O(log n) skip-list search.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:471](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L471)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:495](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L495)
 
 Check if a key exists.
 Overrides base O(n) with O(log n) skip-list search.
@@ -578,7 +578,7 @@ Overrides base O(n) with O(log n) skip-list search.
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L143)
+Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L143)
 
 Whether there exists an entry with the given value.
 
@@ -612,7 +612,7 @@ Time O(n), Space O(1)
 higher(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:893](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L893)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:949](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L949)
 
 Least entry strictly > key, or `undefined`.
 
@@ -645,7 +645,7 @@ Least entry strictly > key, or `undefined`.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:177](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L177)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L181)
 
 Check if empty
 
@@ -675,7 +675,7 @@ Check if empty
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L42)
+Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L42)
 
 Iterate over keys only.
 
@@ -701,7 +701,7 @@ Time O(n), Space O(1)
 last(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:636](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L636)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:672](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L672)
 
 Returns the last (largest key) entry, or `undefined` if empty.
 
@@ -727,7 +727,7 @@ Returns the last (largest key) entry, or `undefined` if empty.
 lower(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:945](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L945)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1005](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1005)
 
 Greatest entry strictly < key, or `undefined`.
 
@@ -760,7 +760,7 @@ Greatest entry strictly < key, or `undefined`.
 map<MK, MV>(callback, options?): SkipList<MK, MV>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1076](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1076)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1144](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1144)
 
 Creates a new SkipList with entries transformed by callback.
 
@@ -811,7 +811,7 @@ Creates a new SkipList with entries transformed by callback.
 pollFirst(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:686](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L686)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:726](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L726)
 
 Remove and return the first (smallest key) entry.
 
@@ -838,7 +838,7 @@ Remove and return the first (smallest key) entry.
 pollLast(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:733](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L733)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:777](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L777)
 
 Remove and return the last (largest key) entry.
 
@@ -865,7 +865,7 @@ Remove and return the last (largest key) entry.
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L203)
+Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L203)
 
 Print a human-friendly representation to the console.
 
@@ -889,7 +889,7 @@ Time O(n), Space O(n)
 rangeSearch(range, options?): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1003](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1003)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1067](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1067)
 
 Returns entries within the given key range.
 
@@ -926,7 +926,7 @@ Returns entries within the given key range.
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L171)
+Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L171)
 
 Reduce entries into a single accumulator.
 
@@ -972,7 +972,7 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:333](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L333)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:349](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L349)
 
 Insert or update a key-value pair. Returns `this` for chaining.
 Unique keys only — if key exists, value is updated in place.
@@ -1021,7 +1021,7 @@ Unique keys only — if key exists, value is updated in place.
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L83)
+Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L83)
 
 Test whether any entry satisfies the predicate.
 
@@ -1061,7 +1061,7 @@ Time O(n), Space O(1)
 toArray(): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L186)
+Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L186)
 
 Converts data structure to `[key, value]` pairs.
 
@@ -1087,7 +1087,7 @@ Time O(n), Space O(n)
 toVisual(): string | [K, V | undefined][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L195)
+Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L195)
 
 Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
 
@@ -1113,7 +1113,7 @@ Time O(n), Space O(n)
 values(): IterableIterator<V | undefined>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L53)
+Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L53)
 
 Iterate over values only.
 
@@ -1139,7 +1139,7 @@ Time O(n), Space O(1)
 static createDefaultComparator<K>(): Comparator<K>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:86](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L86)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:86](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L86)
 
 Creates a default comparator supporting number, string, Date, and bigint.
 
@@ -1164,7 +1164,7 @@ Creates a default comparator supporting number, string, Date, and bigint.
 protected _findNode(key): SkipListNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1182](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1182)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1254)
 
 Finds the node for a given key, or undefined.
 
@@ -1186,7 +1186,7 @@ Finds the node for a given key, or undefined.
 protected _findUpdate(key): SkipListNode<K, V>[];
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1164](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1164)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1236](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1236)
 
 Finds the update array (predecessors at each level) for a given key.
 
@@ -1208,7 +1208,7 @@ Finds the update array (predecessors at each level) for a given key.
 protected _getIterator(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1148](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/linked-list/skip-linked-list.ts#L1148)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1220)
 
 Underlying iterator for the default iteration protocol.