data-structure-typed 2.6.1 → 2.6.2

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:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L413)
+Defined in: [data-structures/base/linear-base.ts:397](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L397)
 
 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:620](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L620)
+Defined in: [data-structures/base/linear-base.ts:586](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L586)
 
 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:388](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L388)
+Defined in: [data-structures/base/linear-base.ts:372](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L372)
 
 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:611](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L611)
+Defined in: [data-structures/base/linear-base.ts:577](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L577)
 
 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:371](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L371)
+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)
 
 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:321](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L321)
+Defined in: [data-structures/base/iterable-element-base.ts:318](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L318)
 
 Removes all elements from the structure.
 
@@ -341,7 +341,7 @@ Expected Time O(1) or O(n) depending on the implementation; Space O(1).
 abstract clone(): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:321](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L321)
+Defined in: [data-structures/base/linear-base.ts:305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L305)
 
 Deep clone while preserving concrete subtype.
 
@@ -367,7 +367,7 @@ Time O(n), Space O(n)
 concat(...items): this;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:462](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L462)
 
 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:602](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L602)
+Defined in: [data-structures/base/linear-base.ts:568](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L568)
 
 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:379](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L379)
+Defined in: [data-structures/base/linear-base.ts:363](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L363)
 
 Remove element at a position.
 
@@ -471,7 +471,7 @@ Time O(1)~O(n) depending on implementation, Space O(1)
 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)
+Defined in: [data-structures/base/iterable-element-base.ts:207](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L207)
 
 Return an iterator of `[index, value]` pairs (Array-compatible).
 
@@ -538,7 +538,7 @@ fill(
    end?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:292](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L292)
+Defined in: [data-structures/base/linear-base.ts:279](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L279)
 
 Fill a range with a value.
 
@@ -584,7 +584,7 @@ Time O(n), Space O(1)
 abstract filter(predicate, thisArg?): this;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:370](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L370)
 
 Filters elements using the provided predicate and returns the same concrete structure type.
 
@@ -714,7 +714,7 @@ Time O(n) in the worst case; may exit early on the first match. Space O(1).
 findIndex(predicate, thisArg?): number;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:151](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L151)
+Defined in: [data-structures/base/linear-base.ts:147](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L147)
 
 Find the first index matching a predicate.
 
@@ -794,7 +794,7 @@ Time O(n), Space O(1).
 abstract getNodeAt(index): NODE | undefined;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:594](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L594)
 
 Node at index (for random-access emulation).
 
@@ -824,7 +824,7 @@ Time O(n), Space O(1)
 has(element): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:189](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L189)
+Defined in: [data-structures/base/iterable-element-base.ts:188](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L188)
 
 Checks whether a strictly-equal element exists in the structure.
 
@@ -858,7 +858,7 @@ Time O(n) in the worst case. Space O(1).
 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)
+Defined in: [data-structures/base/iterable-element-base.ts:199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L199)
 
 Check whether a value exists (Array-compatible alias for `has`).
 
@@ -892,7 +892,7 @@ Provided for familiarity when migrating from Array. Time O(n), Space O(1).
 indexOf(searchElement, fromIndex?): number;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:417](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L417)
 
 Linked-list optimized `indexOf` (forwards scan).
 
@@ -932,7 +932,7 @@ Time O(n), Space O(1)
 abstract isEmpty(): boolean;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:309](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L309)
 
 Indicates whether the structure currently contains no elements.
 
@@ -958,7 +958,7 @@ Expected Time O(1), Space O(1) for most implementations.
 join(separator?): string;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L228)
+Defined in: [data-structures/base/linear-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L218)
 
 Join all elements into a string.
 
@@ -992,7 +992,7 @@ Time O(n), Space O(n)
 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)
+Defined in: [data-structures/base/iterable-element-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L218)
 
 Return an iterator of numeric indices (Array-compatible).
 
@@ -1016,7 +1016,7 @@ Provided for familiarity when migrating from Array. Time O(n), Space O(1) per st
 lastIndexOf(searchElement, fromIndex?): number;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:440](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L440)
 
 Linked-list optimized `lastIndexOf` (reverse scan).
 
@@ -1059,7 +1059,7 @@ abstract map<EM, RM>(
 thisArg?): IterableElementBase<EM, RM>;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:342](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L342)
 
 Maps each element to a new element and returns a new iterable structure.
 
@@ -1119,7 +1119,7 @@ Time O(n), Space O(n).
 abstract mapSame(callback, thisArg?): this;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:358](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L358)
 
 Maps each element to the same element type and returns the same concrete structure type.
 
@@ -1159,7 +1159,7 @@ Time O(n), Space O(n).
 print(): void;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L298)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1185,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:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L347)
+Defined in: [data-structures/base/linear-base.ts:331](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L331)
 
 Append one element or node to the tail.
 
@@ -1219,7 +1219,7 @@ Time O(1) amortized typical, Space O(1)
 abstract pushMany(elements): boolean[];
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:339](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L339)
 
 Append many elements/nodes at once.
 
@@ -1287,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:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
+Defined in: [data-structures/base/iterable-element-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
 
 ##### Parameters
 
@@ -1309,7 +1309,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.c
 reduce(callbackfn, initialValue): E;
 ```
 
-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)
+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
 
@@ -1335,7 +1335,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-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)
+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)
 
 ##### Type Parameters
 
@@ -1369,7 +1369,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.c
 reduceRight<U>(callbackfn, initialValue): U;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:552](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L552)
 
 Right-to-left reduction using reverse iterator.
 
@@ -1415,7 +1415,7 @@ Time O(n), Space O(1)
 abstract reverse(): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L328)
+Defined in: [data-structures/base/linear-base.ts:312](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L312)
 
 Reverse the order of elements in-place (or equivalent).
 
@@ -1441,7 +1441,7 @@ Time O(n), Space O(1)
 abstract setAt(index, value): boolean;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:314](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L314)
+Defined in: [data-structures/base/linear-base.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L298)
 
 Set the value at an index.
 
@@ -1481,7 +1481,7 @@ Time O(1) typical, Space O(1)
 slice(start?, end?): this;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:481](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L481)
 
 Slice via forward iteration (no random access required).
 
@@ -1561,7 +1561,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
 sort(compareFn?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L185)
+Defined in: [data-structures/base/linear-base.ts:179](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L179)
 
 In-place stable order via array sort semantics.
 
@@ -1598,7 +1598,7 @@ splice(
    items): this;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:507](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L507)
 
 Splice by walking node iterators from the start index.
 
@@ -1644,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:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
+Defined in: [data-structures/base/iterable-element-base.ts:275](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L275)
 
 Materializes the elements into a new array.
 
@@ -1670,7 +1670,7 @@ Time O(n), Space O(n).
 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)
+Defined in: [data-structures/base/linear-base.ts:319](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L319)
 
 Return a new instance of the same type with elements in reverse order (non-mutating).
 
@@ -1696,7 +1696,7 @@ Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O
 toReversedArray(): E[];
 ```
 
-Defined in: [data-structures/base/linear-base.ts:237](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L237)
+Defined in: [data-structures/base/linear-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L227)
 
 Snapshot elements into a reversed array.
 
@@ -1722,7 +1722,7 @@ Time O(n), Space O(n)
 toVisual(): E[];
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:287](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L287)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1808,7 +1808,7 @@ Time O(1), Space O(1).
 abstract protected _createInstance(options?): this;
 ```
 
-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)
+Defined in: [data-structures/base/linear-base.ts:380](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L380)
 
 Create an empty list of the same species.
 
@@ -1842,7 +1842,7 @@ Time O(1), Space O(1)
 abstract protected _getIterator(...args): IterableIterator<E>;
 ```
 
-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)
+Defined in: [data-structures/base/iterable-element-base.ts:381](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L381)
 
 Internal iterator factory used by the default iterator.
 
@@ -1876,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:635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L635)
+Defined in: [data-structures/base/linear-base.ts:601](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L601)
 
 Iterate linked nodes from head to tail.
 
@@ -1904,7 +1904,7 @@ Time O(n), Space O(1)
 abstract protected _getPrevNode(node): NODE | undefined;
 ```
 
-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)
+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)
 
 Get previous node of a given node.
 
@@ -1934,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:403](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L403)
+Defined in: [data-structures/base/linear-base.ts:387](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L387)
 
 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:953](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L953)
+Defined in: [data-structures/hash/hash-map.ts:523](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L523)
 
 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:963](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L963)
+Defined in: [data-structures/hash/hash-map.ts:533](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L533)
 
 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: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:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L615)
 
 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:1017](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1017)
+Defined in: [data-structures/hash/hash-map.ts:585](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L585)
 
 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:1063](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1063)
+Defined in: [data-structures/hash/hash-map.ts:625](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L625)
 
 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:1001](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1001)
+Defined in: [data-structures/hash/hash-map.ts:569](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L569)
 
 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:990](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L990)
+Defined in: [data-structures/hash/hash-map.ts:558](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L558)
 
 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:1044](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1044)
+Defined in: [data-structures/hash/hash-map.ts:606](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L606)
 
 Total number of entries.
 
@@ -238,7 +238,7 @@ Entry count.
 get tail(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:596](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L596)
 
 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:1181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1181)
+Defined in: [data-structures/hash/hash-map.ts:740](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L740)
 
 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:1073](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1073)
+Defined in: [data-structures/hash/hash-map.ts:635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L635)
 
 Iterate from head → tail.
 
@@ -344,7 +344,7 @@ Time O(N), Space O(1)
 clear(): void;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:813](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L813)
 
 Remove all entries.
 
@@ -368,7 +368,7 @@ Time O(n) typical, Space O(1)
 clone(): this;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:819](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L819)
 
 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:1237](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1237)
+Defined in: [data-structures/hash/hash-map.ts:796](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L796)
 
 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:1210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1210)
+Defined in: [data-structures/hash/hash-map.ts:769](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L769)
 
 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:1265](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1265)
+Defined in: [data-structures/hash/hash-map.ts:824](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L824)
 
 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:1164](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1164)
+Defined in: [data-structures/hash/hash-map.ts:723](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L723)
 
 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:1155](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1155)
+Defined in: [data-structures/hash/hash-map.ts:714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L714)
 
 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:1246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1246)
+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)
 
 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:1284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1284)
+Defined in: [data-structures/hash/hash-map.ts:843](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L843)
 
 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:1086](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1086)
+Defined in: [data-structures/hash/hash-map.ts:648](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L648)
 
 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:1101](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1101)
+Defined in: [data-structures/hash/hash-map.ts:663](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L663)
 
 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:1295](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1295)
+Defined in: [data-structures/hash/hash-map.ts:867](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L867)
 
 Underlying iterator for the default iteration protocol.