data-structure-typed 2.5.1 → 2.5.3

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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L17)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L25)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L40)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L51)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L63)
+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)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/doubly-linked-list.ts#L74)
+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)
 
 Set the previous node link.
 
@@ -176,7 +176,7 @@ void
 get value(): E;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:27](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -196,7 +196,7 @@ Element value.
 set value(value): void;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:36](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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/FibonacciHeap.md

@@ -6,7 +6,7 @@
 
 # Class: FibonacciHeap\<E\>
 
-Defined in: [data-structures/heap/heap.ts:1202](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1202)
+Defined in: [data-structures/heap/heap.ts:1388](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1388)
 
 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:1210](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1210)
+Defined in: [data-structures/heap/heap.ts:1396](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1396)
 
 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:1241](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1241)
+Defined in: [data-structures/heap/heap.ts:1427](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1427)
 
 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:1224](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1224)
+Defined in: [data-structures/heap/heap.ts:1410](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1410)
 
 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:1290](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1290)
+Defined in: [data-structures/heap/heap.ts:1476](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1476)
 
 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:1361](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1361)
+Defined in: [data-structures/heap/heap.ts:1547](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1547)
 
 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:1312](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1312)
+Defined in: [data-structures/heap/heap.ts:1498](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1498)
 
 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:1332](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1332)
+Defined in: [data-structures/heap/heap.ts:1518](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1518)
 
 Remove and return the minimum element, consolidating the root list.
 
@@ -227,10 +227,10 @@ Time O(log N) amortized, Space O(1)
 ### push()
 
 ```ts
-push(element): this;
+push(element): boolean;
 ```
 
-Defined in: [data-structures/heap/heap.ts:1269](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1269)
+Defined in: [data-structures/heap/heap.ts:1455](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1455)
 
 Push an element into the root list.
 
@@ -244,9 +244,9 @@ Element to insert.
 
 #### Returns
 
-`this`
+`boolean`
 
-This heap.
+True when the element is added.
 
 #### Remarks
 

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

@@ -6,7 +6,7 @@
 
 # Class: FibonacciHeapNode\<E\>
 
-Defined in: [data-structures/heap/heap.ts:1180](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/heap/heap.ts#L1180)
+Defined in: [data-structures/heap/heap.ts:1366](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/heap/heap.ts#L1366)
 
 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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L97)
+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)
 
 Hash-based map. Supports object keys and custom hashing; offers O(1) average set/get/has.
 
@@ -119,7 +119,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L105)
+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)
 
 Create a HashMap and optionally bulk-insert entries.
 
@@ -163,7 +163,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L166)
+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)
 
 Get the current hash function for non-object keys.
 
@@ -187,7 +187,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L133)
+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)
 
 Get the internal Map used for object/function keys.
 
@@ -211,7 +211,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L155)
+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)
 
 Get the number of distinct keys stored.
 
@@ -239,7 +239,7 @@ Current size.
 get store(): object;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:122](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L122)
+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)
 
 Get the internal store for non-object keys.
 
@@ -263,7 +263,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/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L144)
+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)
 
 Get the raw→entry converter function if present.
 
@@ -285,7 +285,7 @@ Converter function or undefined.
 iterator: IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -293,7 +293,7 @@ Default iterator yielding `[key, value]` entries.
 
 ##### args
 
-...`any`[]
+...`unknown`[]
 
 #### Returns
 
@@ -317,7 +317,7 @@ Time O(n) to iterate, Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:245](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L245)
+Defined in: [data-structures/hash/hash-map.ts:267](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L267)
 
 Remove all entries and reset counters.
 
@@ -354,7 +354,7 @@ Time O(N), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:613](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L613)
+Defined in: [data-structures/hash/hash-map.ts:716](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L716)
 
 Deep clone this map, preserving hashing behavior.
 
@@ -392,7 +392,7 @@ Time O(N), Space O(N)
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:549](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L549)
+Defined in: [data-structures/hash/hash-map.ts:641](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L641)
 
 Delete an entry by key.
 
@@ -435,7 +435,7 @@ Time O(1), Space O(1)
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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).
 
@@ -461,7 +461,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/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -475,7 +475,7 @@ Test whether all entries satisfy the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -498,10 +498,10 @@ Time O(n), Space O(1)
 ### filter()
 
 ```ts
-filter(predicate, thisArg?): any;
+filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:729](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L729)
+Defined in: [data-structures/hash/hash-map.ts:854](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L854)
 
 Filter entries into a new map.
 
@@ -515,13 +515,13 @@ Predicate (key, value, index, map) → boolean.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Value for `this` inside the predicate.
 
 #### Returns
 
-`any`
+`this`
 
 A new map containing entries that satisfied the predicate.
 
@@ -572,7 +572,7 @@ Time O(N), Space O(N)
 find(callbackfn, thisArg?): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -586,7 +586,7 @@ Find the first entry that matches a predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -612,7 +612,7 @@ Time O(n), Space O(1)
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -626,7 +626,7 @@ Visit each entry, left-to-right.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -650,7 +650,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:456](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L456)
+Defined in: [data-structures/hash/hash-map.ts:526](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L526)
 
 Get the value for a key.
 
@@ -711,7 +711,7 @@ Time O(1), Space O(1)
 has(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:502](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L502)
+Defined in: [data-structures/hash/hash-map.ts:583](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L583)
 
 Check if a key exists.
 
@@ -757,7 +757,7 @@ Time O(1), Space O(1)
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -791,7 +791,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:205](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L205)
+Defined in: [data-structures/hash/hash-map.ts:216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L216)
 
 Check whether the map is empty.
 
@@ -827,7 +827,7 @@ Time O(1), Space O(1)
 isEntry(rawElement): rawElement is [K, V];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:256](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L256)
+Defined in: [data-structures/hash/hash-map.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L278)
 
 Type guard: check if a raw value is a [key, value] entry.
 
@@ -835,7 +835,7 @@ Type guard: check if a raw value is a [key, value] entry.
 
 ##### rawElement
 
-`any`
+`unknown`
 
 #### Returns
 
@@ -855,7 +855,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -878,10 +878,10 @@ Time O(n), Space O(1)
 ### map()
 
 ```ts
-map<VM>(callbackfn, thisArg?): any;
+map<VM>(callbackfn, thisArg?): HashMap<K, VM>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:661](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L661)
+Defined in: [data-structures/hash/hash-map.ts:775](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L775)
 
 Map values to a new map with the same keys.
 
@@ -901,13 +901,13 @@ Mapping function (key, value, index, map) → newValue.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Value for `this` inside the callback.
 
 #### Returns
 
-`any`
+`HashMap`\<`K`, `VM`\>
 
 A new map with transformed values.
 
@@ -940,7 +940,7 @@ Time O(N), Space O(N)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -964,7 +964,7 @@ Time O(n), Space O(n)
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -1007,10 +1007,10 @@ Time O(n), Space O(1)
 ### set()
 
 ```ts
-set(key, value): boolean;
+set(key, value): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:341](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L341)
+Defined in: [data-structures/hash/hash-map.ts:385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L385)
 
 Insert or replace a single entry.
 
@@ -1030,7 +1030,7 @@ Value.
 
 #### Returns
 
-`boolean`
+`this`
 
 True when the operation succeeds.
 
@@ -1070,7 +1070,7 @@ Time O(1), Space O(1)
 setHashFn(fn): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:569](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L569)
+Defined in: [data-structures/hash/hash-map.ts:661](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L661)
 
 Replace the hash function and rehash the non-object store.
 
@@ -1100,7 +1100,7 @@ Time O(N), Space O(N)
 setMany(entryOrRawElements): boolean[];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:390](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L390)
+Defined in: [data-structures/hash/hash-map.ts:445](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L445)
 
 Insert many entries from an iterable.
 
@@ -1141,7 +1141,7 @@ Time O(N), Space O(N)
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -1155,7 +1155,7 @@ Test whether any entry satisfies the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -1181,7 +1181,7 @@ Time O(n), Space O(1)
 toArray(): [K, V][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -1207,7 +1207,7 @@ Time O(n), Space O(n)
 toVisual(): string | [K, V][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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).
 
@@ -1233,7 +1233,7 @@ Time O(n), Space O(n)
 values(): IterableIterator<V>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/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.
 
@@ -1259,10 +1259,10 @@ Time O(n), Space O(1)
 ### \_createLike()
 
 ```ts
-protected _createLike<TK, TV, TR>(entries?, options?): any;
+protected _createLike<TK, TV, TR>(entries?, options?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:746](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L746)
+Defined in: [data-structures/hash/hash-map.ts:871](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L871)
 
 (Protected) Create a like-kind instance and seed it from an iterable.
 
@@ -1290,13 +1290,13 @@ Iterable used to seed the new map.
 
 ##### options?
 
-`any`
+`Record`\<`string`, `unknown`\>
 
 Options forwarded to the constructor.
 
 #### Returns
 
-`any`
+`this`
 
 A like-kind map instance.
 
@@ -1312,7 +1312,7 @@ Time O(N), Space O(N)
 protected _getIterator(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:760](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L760)
+Defined in: [data-structures/hash/hash-map.ts:885](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L885)
 
 Underlying iterator for the default iteration protocol.