data-structure-typed 2.6.1 → 2.6.2

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/main/src/data-structures/linked-list/singly-linked-list.ts#L17)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:16](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L16)
 
 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/main/src/data-structures/linked-list/singly-linked-list.ts#L25)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:23](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L23)
 
 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/main/src/data-structures/linked-list/singly-linked-list.ts#L39)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:36](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L36)
 
 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/main/src/data-structures/linked-list/singly-linked-list.ts#L50)
+Defined in: [data-structures/linked-list/singly-linked-list.ts:46](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/singly-linked-list.ts#L46)
 
 Set the next node.
 

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/main/src/data-structures/linked-list/skip-linked-list.ts#L49)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:46](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L46)
 
 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/main/src/data-structures/linked-list/skip-linked-list.ts#L122)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:79](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L79)
 
 Total number of entries.
 
@@ -107,12 +107,10 @@ Time O(n) to iterate, Space O(1)
 ceiling(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:867](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L867)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L385)
 
 Least entry ≥ key, or `undefined`.
 
- *
-
 #### Parameters
 
 ##### key
@@ -127,7 +125,11 @@ Least entry ≥ key, or `undefined`.
 
 ```ts
 // Least entry ≥ key
- const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
+ const sl = new SkipList<number, string>([
+      [10, 'a'],
+      [20, 'b'],
+      [30, 'c']
+    ]);
     console.log(sl.ceiling(15)); // [20, 'b'];
     console.log(sl.ceiling(20)); // [20, 'b'];
 ```
@@ -140,12 +142,10 @@ Least entry ≥ key, or `undefined`.
 clear(): void;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:235](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L235)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:146](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L146)
 
 Remove all entries
 
- *
-
 #### Returns
 
 `void`
@@ -154,7 +154,10 @@ Remove all entries
 
 ```ts
 // Remove all entries
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b']
+    ]);
     sl.clear();
     console.log(sl.isEmpty()); // true;
 ```
@@ -171,12 +174,10 @@ Remove all entries
 clone(): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:289](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L289)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:164](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L164)
 
 Create independent copy
 
- *
-
 #### Returns
 
 `this`
@@ -185,7 +186,10 @@ Create independent copy
 
 ```ts
 // Create independent copy
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b']
+    ]);
     const copy = sl.clone();
     copy.delete(1);
     console.log(sl.has(1)); // true;
@@ -203,12 +207,10 @@ Create independent copy
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:574](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L574)
+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)
 
 Delete a key. Returns `true` if the key was found and removed.
 
- *
-
 #### Parameters
 
 ##### key
@@ -309,12 +311,10 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1255](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1255)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:556](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L556)
 
 Creates a new SkipList with entries that pass the predicate.
 
- *
-
 #### Parameters
 
 ##### callbackfn
@@ -333,7 +333,11 @@ Creates a new SkipList with entries that pass the predicate.
 
 ```ts
 // Filter entries
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     const result = sl.filter((v, k) => k > 1);
     console.log(result.size); // 2;
 ```
@@ -390,12 +394,10 @@ Time O(n), Space O(1)
 first(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:645](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L645)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L309)
 
 Returns the first (smallest key) entry, or `undefined` if empty.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -404,7 +406,11 @@ Returns the first (smallest key) entry, or `undefined` if empty.
 
 ```ts
 // Access the minimum entry
- const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
+ const sl = new SkipList<number, string>([
+      [5, 'e'],
+      [1, 'a'],
+      [3, 'c']
+    ]);
     console.log(sl.first()); // [1, 'a'];
 ```
 
@@ -416,12 +422,10 @@ 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:929](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L929)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:409](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L409)
 
 Greatest entry ≤ key, or `undefined`.
 
- *
-
 #### Parameters
 
 ##### key
@@ -436,7 +440,11 @@ Greatest entry ≤ key, or `undefined`.
 
 ```ts
 // Greatest entry ≤ key
- const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
+ const sl = new SkipList<number, string>([
+      [10, 'a'],
+      [20, 'b'],
+      [30, 'c']
+    ]);
     console.log(sl.floor(25)); // [20, 'b'];
     console.log(sl.floor(5)); // undefined;
 ```
@@ -487,13 +495,11 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:457](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L457)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:243](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L243)
 
 Get the value for a key, or `undefined` if not found.
 Overrides base O(n) with O(log n) skip-list search.
 
- *
-
 #### Parameters
 
 ##### key
@@ -540,13 +546,11 @@ Overrides base O(n) with O(log n) skip-list search.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:513](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L513)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:261](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L261)
 
 Check if a key exists.
 Overrides base O(n) with O(log n) skip-list search.
 
- *
-
 #### Parameters
 
 ##### key
@@ -561,7 +565,11 @@ Overrides base O(n) with O(log n) skip-list search.
 
 ```ts
 // Check key existence
- const sl = new SkipList<number, string>([[1, 'a'], [3, 'c'], [5, 'e']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [3, 'c'],
+      [5, 'e']
+    ]);
     console.log(sl.has(3)); // true;
     console.log(sl.has(4)); // false;
 ```
@@ -612,12 +620,10 @@ Time O(n), Space O(1)
 higher(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:991](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L991)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L435)
 
 Least entry strictly > key, or `undefined`.
 
- *
-
 #### Parameters
 
 ##### key
@@ -632,7 +638,11 @@ Least entry strictly > key, or `undefined`.
 
 ```ts
 // Strictly greater entry
- const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
+ const sl = new SkipList<number, string>([
+      [10, 'a'],
+      [20, 'b'],
+      [30, 'c']
+    ]);
     console.log(sl.higher(15)); // [20, 'b'];
     console.log(sl.higher(30)); // undefined;
 ```
@@ -645,12 +655,10 @@ Least entry strictly > key, or `undefined`.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:184](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L184)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L131)
 
 Check if empty
 
- *
-
 #### Returns
 
 `boolean`
@@ -701,12 +709,10 @@ Time O(n), Space O(1)
 last(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:699](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L699)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:325](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L325)
 
 Returns the last (largest key) entry, or `undefined` if empty.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -715,7 +721,11 @@ Returns the last (largest key) entry, or `undefined` if empty.
 
 ```ts
 // Access the maximum entry
- const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
+ const sl = new SkipList<number, string>([
+      [5, 'e'],
+      [1, 'a'],
+      [3, 'c']
+    ]);
     console.log(sl.last()); // [5, 'e'];
 ```
 
@@ -727,12 +737,10 @@ 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:1050](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1050)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:459](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L459)
 
 Greatest entry strictly < key, or `undefined`.
 
- *
-
 #### Parameters
 
 ##### key
@@ -747,7 +755,11 @@ Greatest entry strictly < key, or `undefined`.
 
 ```ts
 // Strictly less entry
- const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
+ const sl = new SkipList<number, string>([
+      [10, 'a'],
+      [20, 'b'],
+      [30, 'c']
+    ]);
     console.log(sl.lower(25)); // [20, 'b'];
     console.log(sl.lower(10)); // undefined;
 ```
@@ -760,12 +772,10 @@ Greatest entry strictly < key, or `undefined`.
 map<MK, MV>(callback, options?): SkipList<MK, MV>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1195)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L531)
 
 Creates a new SkipList with entries transformed by callback.
 
- *
-
 #### Type Parameters
 
 ##### MK
@@ -794,7 +804,10 @@ Creates a new SkipList with entries transformed by callback.
 
 ```ts
 // Transform entries
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b']
+    ]);
     const mapped = sl.map((v, k) => [k, v?.toUpperCase()] as [number, string]);
     console.log([...mapped.values()]); // ['A', 'B'];
 ```
@@ -811,12 +824,10 @@ Creates a new SkipList with entries transformed by callback.
 pollFirst(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:756](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L756)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L347)
 
 Remove and return the first (smallest key) entry.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -825,7 +836,11 @@ Remove and return the first (smallest key) entry.
 
 ```ts
 // Remove and return smallest
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     console.log(sl.pollFirst()); // [1, 'a'];
     console.log(sl.size); // 2;
 ```
@@ -838,12 +853,10 @@ Remove and return the first (smallest key) entry.
 pollLast(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:810](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L810)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:366](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L366)
 
 Remove and return the last (largest key) entry.
 
- *
-
 #### Returns
 
 \[`K`, `V` \| `undefined`\] \| `undefined`
@@ -852,7 +865,11 @@ Remove and return the last (largest key) entry.
 
 ```ts
 // Remove and return largest
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c']
+    ]);
     console.log(sl.pollLast()); // [3, 'c'];
     console.log(sl.size); // 2;
 ```
@@ -889,12 +906,10 @@ Time O(n), Space O(n)
 rangeSearch(range, options?): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1115](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1115)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:492](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L492)
 
 Returns entries within the given key range.
 
- *
-
 #### Parameters
 
 ##### range
@@ -913,9 +928,19 @@ Returns entries within the given key range.
 
 ```ts
 // Find entries in a range
- const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd'], [5, 'e']]);
+ const sl = new SkipList<number, string>([
+      [1, 'a'],
+      [2, 'b'],
+      [3, 'c'],
+      [4, 'd'],
+      [5, 'e']
+    ]);
     const result = sl.rangeSearch([2, 4]);
-    console.log(result); // [[2, 'b'], [3, 'c'], [4, 'd']];
+    console.log(result); // [
+ //      [2, 'b'],
+ //      [3, 'c'],
+ //      [4, 'd']
+ //    ];
 ```
 
 ***
@@ -972,13 +997,11 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:361](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L361)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L194)
 
 Insert or update a key-value pair. Returns `this` for chaining.
 Unique keys only — if key exists, value is updated in place.
 
- *
-
 #### Parameters
 
 ##### key
@@ -1139,7 +1162,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/main/src/data-structures/linked-list/skip-linked-list.ts#L86)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:102](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L102)
 
 Creates a default comparator supporting number, string, Date, and bigint.
 
@@ -1164,7 +1187,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:1308](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1308)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:603](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L603)
 
 Finds the node for a given key, or undefined.
 
@@ -1186,7 +1209,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:1290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1290)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:587](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L587)
 
 Finds the update array (predecessors at each level) for a given key.
 
@@ -1208,7 +1231,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:1274](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1274)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:571](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L571)
 
 Underlying iterator for the default iteration protocol.