data-structure-typed 2.6.1 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: DoublyLinkedListNode\<E\>
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:17](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L17)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:16](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L16)
 
 Node of a doubly linked list; stores value and prev/next links.
 
@@ -32,7 +32,7 @@ Time O(1), Space O(1)
 new DoublyLinkedListNode<E>(value): DoublyLinkedListNode<E>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:25](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L25)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:23](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L23)
 
 Create a node.
 
@@ -68,7 +68,7 @@ Time O(1), Space O(1)
 get next(): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:40](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L40)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:37](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L37)
 
 Get the next node link.
 
@@ -88,7 +88,7 @@ Next node or undefined.
 set next(value): void;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:51](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L51)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:47](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L47)
 
 Set the next node link.
 
@@ -124,7 +124,7 @@ void
 get prev(): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:63](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L63)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:58](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L58)
 
 Get the previous node link.
 
@@ -144,7 +144,7 @@ Previous node or undefined.
 set prev(value): void;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:74](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L74)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:68](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L68)
 
 Set the previous node link.
 

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

@@ -6,7 +6,7 @@
 
 # Class: FibonacciHeap\<E\>
 
-Defined in: [data-structures/heap/heap.ts:1430](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1430)
+Defined in: [data-structures/heap/heap.ts:844](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L844)
 
 Fibonacci heap (min-heap) optimized for fast merges and amortized operations.
 
@@ -34,7 +34,7 @@ examples will be generated by unit test
 new FibonacciHeap<E>(comparator?): FibonacciHeap<E>;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1438](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1438)
+Defined in: [data-structures/heap/heap.ts:853](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L853)
 
 Create a FibonacciHeap.
 
@@ -66,7 +66,7 @@ Time O(1), Space O(1)
 get min(): FibonacciHeapNode<E> | undefined;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1469](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1469)
+Defined in: [data-structures/heap/heap.ts:883](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L883)
 
 Get the current minimum node.
 
@@ -90,7 +90,7 @@ Min node or undefined.
 get root(): FibonacciHeapNode<E> | undefined;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1452](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1452)
+Defined in: [data-structures/heap/heap.ts:866](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L866)
 
 Get the circular root list head.
 
@@ -112,7 +112,7 @@ Root node or undefined.
 consumeLinkedList(head?): FibonacciHeapNode<E>[];
 ```
 
-Defined in: [data-structures/heap/heap.ts:1518](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1518)
+Defined in: [data-structures/heap/heap.ts:928](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L928)
 
 Collect nodes from a circular doubly linked list starting at head.
 
@@ -142,7 +142,7 @@ Time O(K), Space O(K)
 merge(heapToMerge): void;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1589](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1589)
+Defined in: [data-structures/heap/heap.ts:996](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L996)
 
 Meld another heap into this heap.
 
@@ -172,7 +172,7 @@ Time O(1), Space O(1)
 mergeWithChild(parent, node): void;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1540](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1540)
+Defined in: [data-structures/heap/heap.ts:949](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L949)
 
 Insert a node into a parent's child list (circular).
 
@@ -208,7 +208,7 @@ Time O(1), Space O(1)
 pop(): E | undefined;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1560](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1560)
+Defined in: [data-structures/heap/heap.ts:968](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L968)
 
 Remove and return the minimum element, consolidating the root list.
 
@@ -230,7 +230,7 @@ Time O(log N) amortized, Space O(1)
 push(element): boolean;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1497](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1497)
+Defined in: [data-structures/heap/heap.ts:908](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L908)
 
 Push an element into the root list.
 

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

@@ -6,7 +6,7 @@
 
 # Class: FibonacciHeapNode\<E\>
 
-Defined in: [data-structures/heap/heap.ts:1408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1408)
+Defined in: [data-structures/heap/heap.ts:822](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L822)
 
 Node container used by FibonacciHeap.
 

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

@@ -6,7 +6,7 @@
 
 # Class: HashMap\<K, V, R\>
 
-Defined in: [data-structures/hash/hash-map.ts:97](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L97)
+Defined in: [data-structures/hash/hash-map.ts:103](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L103)
 
 Hash-based map. Supports object keys and custom hashing; offers O(1) average set/get/has.
 
@@ -72,7 +72,11 @@ Time O(1), Space O(1)
 
 ```ts
 // Aggregate values
- const counts = new HashMap<string, number>([['a', 5], ['b', 3], ['c', 8]]);
+ const counts = new HashMap<string, number>([
+      ['a', 5],
+      ['b', 3],
+      ['c', 8]
+    ]);
 
     const total = counts.reduce((sum, v) => sum + (v ?? 0), 0);
     console.log(total); // 16;
@@ -80,7 +84,10 @@ Time O(1), Space O(1)
 
 ```ts
 // Iterate over entries
- const map = new HashMap<string, number>([['x', 1], ['y', 2]]);
+ const map = new HashMap<string, number>([
+      ['x', 1],
+      ['y', 2]
+    ]);
     const keys: string[] = [];
 
     map.forEach((v, k) => keys.push(k));
@@ -119,7 +126,7 @@ If you try to insert another entry with the same key, the new one will replace t
 new HashMap<K, V, R>(entryOrRawElements?, options?): HashMap<K, V, R>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:105](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L105)
+Defined in: [data-structures/hash/hash-map.ts:113](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L113)
 
 Create a HashMap and optionally bulk-insert entries.
 
@@ -163,7 +170,7 @@ IterableEntryBase<K, V>.constructor
 get hashFn(): (key) => string;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:166](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L166)
+Defined in: [data-structures/hash/hash-map.ts:172](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L172)
 
 Get the current hash function for non-object keys.
 
@@ -187,7 +194,7 @@ Hash function.
 get objMap(): Map<object, V>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:133](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L133)
+Defined in: [data-structures/hash/hash-map.ts:141](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L141)
 
 Get the internal Map used for object/function keys.
 
@@ -211,7 +218,7 @@ Map of object→value.
 get size(): number;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:155](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L155)
+Defined in: [data-structures/hash/hash-map.ts:161](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L161)
 
 Get the number of distinct keys stored.
 
@@ -239,7 +246,7 @@ Current size.
 get store(): object;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:122](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L122)
+Defined in: [data-structures/hash/hash-map.ts:130](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L130)
 
 Get the internal store for non-object keys.
 
@@ -263,7 +270,7 @@ Internal record of string→{key,value}.
 get toEntryFn(): ((rawElement) => [K, V]) | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:144](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L144)
+Defined in: [data-structures/hash/hash-map.ts:150](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L150)
 
 Get the raw→entry converter function if present.
 
@@ -317,7 +324,7 @@ Time O(n) to iterate, Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:273](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L273)
+Defined in: [data-structures/hash/hash-map.ts:202](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L202)
 
 Remove all entries and reset counters.
 
@@ -327,8 +334,6 @@ Remove all entries and reset counters.
 
 void
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -337,7 +342,10 @@ Time O(N), Space O(1)
 
 ```ts
 // Remove all entries
- const map = new HashMap<string, number>([['a', 1], ['b', 2]]);
+ const map = new HashMap<string, number>([
+      ['a', 1],
+      ['b', 2]
+    ]);
     map.clear();
     console.log(map.isEmpty()); // true;
 ```
@@ -354,7 +362,7 @@ Time O(N), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:743](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L743)
+Defined in: [data-structures/hash/hash-map.ts:393](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L393)
 
 Deep clone this map, preserving hashing behavior.
 
@@ -364,8 +372,6 @@ Deep clone this map, preserving hashing behavior.
 
 A new map with the same content.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -392,7 +398,7 @@ Time O(N), Space O(N)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:665](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L665)
+Defined in: [data-structures/hash/hash-map.ts:355](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L355)
 
 Delete an entry by key.
 
@@ -410,8 +416,6 @@ Key to delete.
 
 True if the key was found and removed.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -420,7 +424,11 @@ Time O(1), Space O(1)
 
 ```ts
 // Remove entries by key
- const map = new HashMap<string, number>([['x', 10], ['y', 20], ['z', 30]]);
+ const map = new HashMap<string, number>([
+      ['x', 10],
+      ['y', 20],
+      ['z', 30]
+    ]);
 
     console.log(map.delete('y')); // true;
     console.log(map.has('y')); // false;
@@ -501,7 +509,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:887](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L887)
+Defined in: [data-structures/hash/hash-map.ts:455](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L455)
 
 Filter entries into a new map.
 
@@ -525,8 +533,6 @@ Value for `this` inside the predicate.
 
 A new map containing entries that satisfied the predicate.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -650,7 +656,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:544](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L544)
+Defined in: [data-structures/hash/hash-map.ts:311](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L311)
 
 Get the value for a key.
 
@@ -668,8 +674,6 @@ Key to look up.
 
 Value or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -711,7 +715,7 @@ Time O(1), Space O(1)
 has(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:604](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L604)
+Defined in: [data-structures/hash/hash-map.ts:332](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L332)
 
 Check if a key exists.
 
@@ -729,8 +733,6 @@ Key to test.
 
 True if present.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -739,7 +741,10 @@ Time O(1), Space O(1)
 
 ```ts
 // Check key existence
- const map = new HashMap<string, number>([['a', 1], ['b', 2]]);
+ const map = new HashMap<string, number>([
+      ['a', 1],
+      ['b', 2]
+    ]);
 
     console.log(map.has('a')); // true;
     console.log(map.has('z')); // false;
@@ -791,7 +796,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L219)
+Defined in: [data-structures/hash/hash-map.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L185)
 
 Check whether the map is empty.
 
@@ -801,8 +806,6 @@ Check whether the map is empty.
 
 True if size is 0.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -827,7 +830,7 @@ Time O(1), Space O(1)
 isEntry(rawElement): rawElement is [K, V];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L284)
+Defined in: [data-structures/hash/hash-map.ts:213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L213)
 
 Type guard: check if a raw value is a [key, value] entry.
 
@@ -881,7 +884,7 @@ Time O(n), Space O(1)
 map<VM>(callbackfn, thisArg?): HashMap<K, VM>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:805](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L805)
+Defined in: [data-structures/hash/hash-map.ts:416](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L416)
 
 Map values to a new map with the same keys.
 
@@ -911,8 +914,6 @@ Value for `this` inside the callback.
 
 A new map with transformed values.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -921,7 +922,10 @@ Time O(N), Space O(N)
 
 ```ts
 // Transform all values
- const prices = new HashMap<string, number>([['apple', 1], ['banana', 2]]);
+ const prices = new HashMap<string, number>([
+      ['apple', 1],
+      ['banana', 2]
+    ]);
 
     const doubled = prices.map(v => (v ?? 0) * 2);
     console.log(doubled.get('apple')); // 2;
@@ -1010,7 +1014,7 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:397](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L397)
+Defined in: [data-structures/hash/hash-map.ts:242](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L242)
 
 Insert or replace a single entry.
 
@@ -1034,8 +1038,6 @@ Value.
 
 True when the operation succeeds.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1070,7 +1072,7 @@ Time O(1), Space O(1)
 setHashFn(fn): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:685](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L685)
+Defined in: [data-structures/hash/hash-map.ts:375](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L375)
 
 Replace the hash function and rehash the non-object store.
 
@@ -1100,7 +1102,7 @@ Time O(N), Space O(N)
 setMany(entryOrRawElements): boolean[];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:460](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L460)
+Defined in: [data-structures/hash/hash-map.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L269)
 
 Insert many entries from an iterable.
 
@@ -1118,8 +1120,6 @@ Iterable of entries or raw elements to insert.
 
 Array of per-entry results.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1129,7 +1129,11 @@ Time O(N), Space O(N)
 ```ts
 // Add multiple entries
  const map = new HashMap<string, number>();
-    map.setMany([['a', 1], ['b', 2], ['c', 3]]);
+    map.setMany([
+      ['a', 1],
+      ['b', 2],
+      ['c', 3]
+    ]);
     console.log(map.size); // 3;
 ```
 
@@ -1262,7 +1266,7 @@ Time O(n), Space O(1)
 protected _createLike<TK, TV, TR>(entries?, options?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:904](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L904)
+Defined in: [data-structures/hash/hash-map.ts:472](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L472)
 
 (Protected) Create a like-kind instance and seed it from an iterable.
 
@@ -1312,7 +1316,7 @@ Time O(N), Space O(N)
 protected _getIterator(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:918](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L918)
+Defined in: [data-structures/hash/hash-map.ts:489](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L489)
 
 Underlying iterator for the default iteration protocol.