data-structure-typed 2.6.0 → 2.6.1

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

@@ -6,7 +6,7 @@
 
 # Abstract Class: LinearLinkedBase\<E, R, NODE\>
 
-Defined in: [data-structures/base/linear-base.ts:402](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L402)
+Defined in: [data-structures/base/linear-base.ts:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L413)
 
 Linked-list specialized linear container.
 
@@ -169,7 +169,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 abstract addAfter(existingElementOrNode, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:609](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L609)
+Defined in: [data-structures/base/linear-base.ts:620](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L620)
 
 Insert new element/node after an existing node.
 
@@ -205,7 +205,7 @@ Time O(1)~O(n) depending on reference access, Space O(1)
 abstract addAt(index, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:377](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L377)
+Defined in: [data-structures/base/linear-base.ts:388](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L388)
 
 Insert an element/node at a position.
 
@@ -245,7 +245,7 @@ Time O(1)~O(n) depending on implementation, Space O(1)
 abstract addBefore(existingElementOrNode, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:600](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L600)
+Defined in: [data-structures/base/linear-base.ts:611](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L611)
 
 Insert new element/node before an existing node.
 
@@ -281,7 +281,7 @@ Time O(1)~O(n) depending on reference access, Space O(1)
 abstract at(index): E | undefined;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:360](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L360)
+Defined in: [data-structures/base/linear-base.ts:371](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L371)
 
 Get element at an index.
 
@@ -315,7 +315,7 @@ Time O(1)~O(n) depending on implementation, Space O(1)
 abstract clear(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:289](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L289)
+Defined in: [data-structures/base/iterable-element-base.ts:321](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L321)
 
 Removes all elements from the structure.
 
@@ -367,7 +367,7 @@ Time O(n), Space O(n)
 concat(...items): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:473](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L473)
+Defined in: [data-structures/base/linear-base.ts:484](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L484)
 
 Concatenate lists/elements preserving order.
 
@@ -403,7 +403,7 @@ Time O(sum(length)), Space O(sum(length))
 abstract delete(elementOrNode): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:591](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L591)
+Defined in: [data-structures/base/linear-base.ts:602](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L602)
 
 Delete by element or node in a linked list.
 
@@ -437,7 +437,7 @@ Time O(1)~O(n) depending on availability of links, Space O(1)
 abstract deleteAt(pos): E | undefined;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:368](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L368)
+Defined in: [data-structures/base/linear-base.ts:379](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L379)
 
 Remove element at a position.
 
@@ -465,6 +465,30 @@ Time O(1)~O(n) depending on implementation, Space O(1)
 
 ***
 
+### entries()
+
+```ts
+entries(): IterableIterator<[number, E]>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L208)
+
+Return an iterator of `[index, value]` pairs (Array-compatible).
+
+#### Returns
+
+`IterableIterator`\<\[`number`, `E`\]\>
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+
+#### Inherited from
+
+[`LinearBase`](LinearBase.md).[`entries`](LinearBase.md#entries)
+
+***
+
 ### every()
 
 ```ts
@@ -560,7 +584,7 @@ Time O(n), Space O(1)
 abstract filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:341](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L341)
+Defined in: [data-structures/base/iterable-element-base.ts:373](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L373)
 
 Filters elements using the provided predicate and returns the same concrete structure type.
 
@@ -770,7 +794,7 @@ Time O(n), Space O(1).
 abstract getNodeAt(index): NODE | undefined;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:617](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L617)
+Defined in: [data-structures/base/linear-base.ts:628](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L628)
 
 Node at index (for random-access emulation).
 
@@ -828,13 +852,47 @@ Time O(n) in the worst case. Space O(1).
 
 ***
 
+### includes()
+
+```ts
+includes(element): boolean;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L200)
+
+Check whether a value exists (Array-compatible alias for `has`).
+
+#### Parameters
+
+##### element
+
+`E`
+
+Element to search for (uses `===`).
+
+#### Returns
+
+`boolean`
+
+`true` if found.
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+
+#### Inherited from
+
+[`LinearBase`](LinearBase.md).[`includes`](LinearBase.md#includes)
+
+***
+
 ### indexOf()
 
 ```ts
 indexOf(searchElement, fromIndex?): number;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:422](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L422)
+Defined in: [data-structures/base/linear-base.ts:433](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L433)
 
 Linked-list optimized `indexOf` (forwards scan).
 
@@ -874,7 +932,7 @@ Time O(n), Space O(1)
 abstract isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:280](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L280)
+Defined in: [data-structures/base/iterable-element-base.ts:312](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L312)
 
 Indicates whether the structure currently contains no elements.
 
@@ -928,13 +986,37 @@ Time O(n), Space O(n)
 
 ***
 
+### keys()
+
+```ts
+keys(): IterableIterator<number>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L219)
+
+Return an iterator of numeric indices (Array-compatible).
+
+#### Returns
+
+`IterableIterator`\<`number`\>
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+
+#### Inherited from
+
+[`LinearBase`](LinearBase.md).[`keys`](LinearBase.md#keys)
+
+***
+
 ### lastIndexOf()
 
 ```ts
 lastIndexOf(searchElement, fromIndex?): number;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:448](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L448)
+Defined in: [data-structures/base/linear-base.ts:459](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L459)
 
 Linked-list optimized `lastIndexOf` (reverse scan).
 
@@ -977,7 +1059,7 @@ abstract map<EM, RM>(
 thisArg?): IterableElementBase<EM, RM>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:313](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L313)
+Defined in: [data-structures/base/iterable-element-base.ts:345](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L345)
 
 Maps each element to a new element and returns a new iterable structure.
 
@@ -1037,7 +1119,7 @@ Time O(n), Space O(n).
 abstract mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:329](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L329)
+Defined in: [data-structures/base/iterable-element-base.ts:361](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L361)
 
 Maps each element to the same element type and returns the same concrete structure type.
 
@@ -1077,7 +1159,7 @@ Time O(n), Space O(n).
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L269)
+Defined in: [data-structures/base/iterable-element-base.ts:301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L301)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1103,7 +1185,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
 abstract push(elementOrNode): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:336](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L336)
+Defined in: [data-structures/base/linear-base.ts:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L347)
 
 Append one element or node to the tail.
 
@@ -1137,7 +1219,7 @@ Time O(1) amortized typical, Space O(1)
 abstract pushMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/base/linear-base.ts:344](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L344)
+Defined in: [data-structures/base/linear-base.ts:355](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L355)
 
 Append many elements/nodes at once.
 
@@ -1205,7 +1287,7 @@ Time O(n), Space O(1). Throws if called on an empty structure without `initialVa
 reduce(callbackfn): E;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L194)
+Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1227,7 +1309,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.c
 reduce(callbackfn, initialValue): E;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L195)
+Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Parameters
 
@@ -1253,7 +1335,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L196)
+Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L228)
 
 ##### Type Parameters
 
@@ -1287,7 +1369,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.c
 reduceRight<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:574](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L574)
+Defined in: [data-structures/base/linear-base.ts:585](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L585)
 
 Right-to-left reduction using reverse iterator.
 
@@ -1399,7 +1481,7 @@ Time O(1) typical, Space O(1)
 slice(start?, end?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:494](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L494)
+Defined in: [data-structures/base/linear-base.ts:505](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L505)
 
 Slice via forward iteration (no random access required).
 
@@ -1516,7 +1598,7 @@ splice(
    items): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:522](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L522)
+Defined in: [data-structures/base/linear-base.ts:533](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L533)
 
 Splice by walking node iterators from the start index.
 
@@ -1562,7 +1644,7 @@ Time O(n + m), Space O(min(n, m)) where `m = items.length`
 toArray(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L246)
+Defined in: [data-structures/base/iterable-element-base.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
 
 Materializes the elements into a new array.
 
@@ -1582,6 +1664,32 @@ Time O(n), Space O(n).
 
 ***
 
+### toReversed()
+
+```ts
+toReversed(): this;
+```
+
+Defined in: [data-structures/base/linear-base.ts:335](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L335)
+
+Return a new instance of the same type with elements in reverse order (non-mutating).
+
+#### Returns
+
+`this`
+
+A new reversed instance.
+
+#### Remarks
+
+Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+
+#### Inherited from
+
+[`LinearBase`](LinearBase.md).[`toReversed`](LinearBase.md#toreversed)
+
+***
+
 ### toReversedArray()
 
 ```ts
@@ -1614,7 +1722,7 @@ Time O(n), Space O(n)
 toVisual(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L258)
+Defined in: [data-structures/base/iterable-element-base.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L290)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1700,7 +1808,7 @@ Time O(1), Space O(1).
 abstract protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:385](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L385)
+Defined in: [data-structures/base/linear-base.ts:396](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L396)
 
 Create an empty list of the same species.
 
@@ -1734,7 +1842,7 @@ Time O(1), Space O(1)
 abstract protected _getIterator(...args): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:352](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L352)
+Defined in: [data-structures/base/iterable-element-base.ts:384](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L384)
 
 Internal iterator factory used by the default iterator.
 
@@ -1768,7 +1876,7 @@ Implementations should yield in O(1) per element with O(1) extra space when poss
 abstract protected _getNodeIterator(...args): IterableIterator<NODE>;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:624](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L624)
+Defined in: [data-structures/base/linear-base.ts:635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L635)
 
 Iterate linked nodes from head to tail.
 
@@ -1796,7 +1904,7 @@ Time O(n), Space O(1)
 abstract protected _getPrevNode(node): NODE | undefined;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:632](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L632)
+Defined in: [data-structures/base/linear-base.ts:643](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L643)
 
 Get previous node of a given node.
 
@@ -1826,7 +1934,7 @@ Time O(1)~O(n) depending on list variant (singly vs doubly), Space O(1)
 abstract protected _getReverseIterator(...args): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:392](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L392)
+Defined in: [data-structures/base/linear-base.ts:403](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L403)
 
 Reverse-direction iterator over elements.
 

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

@@ -6,7 +6,7 @@
 
 # Class: LinkedHashMap\<K, V, R\>
 
-Defined in: [data-structures/hash/hash-map.ts:920](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L920)
+Defined in: [data-structures/hash/hash-map.ts:953](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L953)
 
 Hash-based map that preserves insertion order via a doubly-linked list.
 
@@ -46,7 +46,7 @@ examples will be generated by unit test
 new LinkedHashMap<K, V, R>(entryOrRawElements?, options?): LinkedHashMap<K, V, R>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:930](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L930)
+Defined in: [data-structures/hash/hash-map.ts:963](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L963)
 
 Create a LinkedHashMap and optionally bulk-insert entries.
 
@@ -90,7 +90,7 @@ IterableEntryBase<K, V>.constructor
 get first(): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1020](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1020)
+Defined in: [data-structures/hash/hash-map.ts:1053](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1053)
 
 Get the first [key, value] pair.
 
@@ -114,7 +114,7 @@ First entry or undefined when empty.
 get head(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:984](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L984)
+Defined in: [data-structures/hash/hash-map.ts:1017](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1017)
 
 Get the head node (first entry) sentinel link.
 
@@ -138,7 +138,7 @@ Head node or sentinel.
 get last(): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1030](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1030)
+Defined in: [data-structures/hash/hash-map.ts:1063](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1063)
 
 Get the last [key, value] pair.
 
@@ -162,7 +162,7 @@ Last entry or undefined when empty.
 get noObjMap(): Record<string, HashMapLinkedNode<K, V | undefined>>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:968](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L968)
+Defined in: [data-structures/hash/hash-map.ts:1001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1001)
 
 Get the internal record for non-object keys.
 
@@ -186,7 +186,7 @@ Record of hash→node.
 get objHashFn(): (key) => object;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:957](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L957)
+Defined in: [data-structures/hash/hash-map.ts:990](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L990)
 
 Get the hash function for object/weak keys.
 
@@ -210,7 +210,7 @@ Object-hash function.
 get size(): number;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1011](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1011)
+Defined in: [data-structures/hash/hash-map.ts:1044](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1044)
 
 Total number of entries.
 
@@ -238,7 +238,7 @@ Entry count.
 get tail(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:995](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L995)
+Defined in: [data-structures/hash/hash-map.ts:1028](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1028)
 
 Get the tail node (last entry) sentinel link.
 
@@ -292,7 +292,7 @@ Time O(n) to iterate, Space O(1)
 at(index): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1148](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1148)
+Defined in: [data-structures/hash/hash-map.ts:1181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1181)
 
 Get the value at a given index in insertion order.
 
@@ -322,7 +322,7 @@ Time O(N), Space O(1)
 begin(): Generator<(K | V | undefined)[], void, unknown>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1040](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1040)
+Defined in: [data-structures/hash/hash-map.ts:1073](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1073)
 
 Iterate from head → tail.
 
@@ -344,7 +344,7 @@ Time O(N), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1221](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1221)
+Defined in: [data-structures/hash/hash-map.ts:1254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1254)
 
 Remove all entries.
 
@@ -368,7 +368,7 @@ Time O(n) typical, Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1227)
+Defined in: [data-structures/hash/hash-map.ts:1260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1260)
 
 Deep clone preserving the concrete subtype.
 
@@ -394,7 +394,7 @@ Time O(n) typical, Space O(n)
 deleteAt(index): [K, V | undefined];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1204](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1204)
+Defined in: [data-structures/hash/hash-map.ts:1237](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1237)
 
 Delete the entry at a given index.
 
@@ -428,7 +428,7 @@ If index is out of bounds.
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1177)
+Defined in: [data-structures/hash/hash-map.ts:1210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1210)
 
 Delete the first entry that matches a predicate.
 
@@ -524,7 +524,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1232](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1232)
+Defined in: [data-structures/hash/hash-map.ts:1265](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1265)
 
 Filter entries and return the same-species structure.
 
@@ -638,7 +638,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1131)
+Defined in: [data-structures/hash/hash-map.ts:1164](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1164)
 
 Get the value under a key.
 
@@ -672,7 +672,7 @@ Time O(n) generic, Space O(1)
 has(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1122](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1122)
+Defined in: [data-structures/hash/hash-map.ts:1155](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1155)
 
 Whether the given key exists.
 
@@ -740,7 +740,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1213)
+Defined in: [data-structures/hash/hash-map.ts:1246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1246)
 
 Whether there are no entries.
 
@@ -792,7 +792,7 @@ Time O(n), Space O(1)
 map<MK, MV>(callback, thisArg?): LinkedHashMap<MK, MV>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1251](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1251)
+Defined in: [data-structures/hash/hash-map.ts:1284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1284)
 
 Map each entry to a new [key, value] pair and preserve order.
 
@@ -912,7 +912,7 @@ Time O(n), Space O(1)
 reverseBegin(): Generator<(K | V | undefined)[], void, unknown>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1053](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1053)
+Defined in: [data-structures/hash/hash-map.ts:1086](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1086)
 
 Iterate from tail → head.
 
@@ -934,7 +934,7 @@ Time O(N), Space O(1)
 set(key, value?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1068](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1068)
+Defined in: [data-structures/hash/hash-map.ts:1101](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1101)
 
 Insert or replace a single entry; preserves insertion order.
 
@@ -1091,7 +1091,7 @@ Time O(n), Space O(1)
 protected _getIterator(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1262](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1262)
+Defined in: [data-structures/hash/hash-map.ts:1295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1295)
 
 Underlying iterator for the default iteration protocol.