data-structure-typed 2.5.3 → 2.6.1

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

@@ -370,7 +370,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 addAfter(existingElementOrNode, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:829](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L829)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:850](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L850)
 
 Insert a new element/node after an existing one.
 
@@ -410,7 +410,7 @@ Time O(N), Space O(1)
 addAt(index, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:778](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L778)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:799](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L799)
 
 Insert a new element/node at an index, shifting following nodes.
 
@@ -461,7 +461,7 @@ Time O(N), Space O(1)
 addBefore(existingElementOrNode, newElementOrNode): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:802](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L802)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:823](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L823)
 
 Insert a new element/node before an existing one.
 
@@ -501,7 +501,7 @@ Time O(N), Space O(1)
 at(index): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:629](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L629)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:644](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L644)
 
 Get the element at a given index.
 
@@ -546,7 +546,7 @@ Time O(N), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1084](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1084)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1117](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1117)
 
 Remove all nodes and reset length.
 
@@ -583,7 +583,7 @@ Time O(N), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1353](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1353)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1435)
 
 Deep clone this list (values are copied by reference).
 
@@ -621,7 +621,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.
 
@@ -657,7 +657,7 @@ Time O(sum(length)), Space O(sum(length))
 delete(elementOrNode?): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:970](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L970)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:997](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L997)
 
 Delete the first match by value/node.
 
@@ -702,7 +702,7 @@ Time O(N), Space O(1)
 deleteAt(index): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:908](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L908)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:932](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L932)
 
 Delete the element at an index.
 
@@ -747,7 +747,7 @@ Time O(N), Space O(1)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1278)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1357](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1357)
 
 Delete the first element that satisfies a predicate.
 
@@ -771,6 +771,30 @@ Time O(N), 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
+
+[`LinearLinkedBase`](LinearLinkedBase.md).[`entries`](LinearLinkedBase.md#entries)
+
+***
+
 ### every()
 
 ```ts
@@ -866,7 +890,7 @@ Time O(n), Space O(1)
 filter(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1411](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1411)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1496](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1496)
 
 Filter values into a new list of the same class.
 
@@ -1041,6 +1065,80 @@ Time O(n), Space O(1)
 
 ***
 
+### findLast()
+
+```ts
+findLast(elementNodeOrPredicate): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1258)
+
+Find the first value matching a predicate scanning backward (tail → head).
+
+#### Parameters
+
+##### elementNodeOrPredicate
+
+  \| `E`
+  \| [`DoublyLinkedListNode`](DoublyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or predicate to match.
+
+#### Returns
+
+`E` \| `undefined`
+
+Matching value or undefined.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Find value scanning from tail
+ const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
+    // findLast scans from tail to head, returns first match
+    const found = list.findLast(node => node.value < 4);
+    console.log(found); // 3;
+```
+
+***
+
+### findLastIndex()
+
+```ts
+findLastIndex(predicate): number;
+```
+
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1276](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1276)
+
+Find the index of the last value matching a predicate (scans tail → head).
+
+#### Parameters
+
+##### predicate
+
+(`value`, `index`, `list`) => `boolean`
+
+Function called with (value, index, list).
+
+#### Returns
+
+`number`
+
+Matching index, or -1 if not found.
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+
+***
+
 ### forEach()
 
 ```ts
@@ -1081,15 +1179,13 @@ Time O(n), Space O(1).
 
 ***
 
-### getBackward()
+### ~~getBackward()~~
 
 ```ts
 getBackward(elementNodeOrPredicate): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1199)
-
-Find the first value matching a predicate scanning backward.
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1238](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1238)
 
 #### Parameters
 
@@ -1099,29 +1195,13 @@ Find the first value matching a predicate scanning backward.
   \| [`DoublyLinkedListNode`](DoublyLinkedListNode.md)\<`E`\>
   \| ((`node`) => `boolean`)
 
-Element, node, or predicate to match.
-
 #### Returns
 
 `E` \| `undefined`
 
-Matched value or undefined.
-
- *
-
-#### Remarks
-
-Time O(N), Space O(1)
-
-#### Example
+#### Deprecated
 
-```ts
-// Find value scanning from tail
- const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
-    // getBackward scans from tail to head, returns first match
-    const found = list.getBackward(node => node.value < 4);
-    console.log(found); // 3;
-```
+Use `findLast` instead. Will be removed in a future major version.
 
 ***
 
@@ -1131,7 +1211,7 @@ Time O(N), Space O(1)
 getNode(elementNodeOrPredicate?): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:697](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L697)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:715](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L715)
 
 Find a node by value, reference, or predicate.
 
@@ -1163,7 +1243,7 @@ Time O(N), Space O(1)
 getNodeAt(index): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:683](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L683)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:701](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L701)
 
 Get the node reference at a given index.
 
@@ -1235,13 +1315,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
+
+[`LinearLinkedBase`](LinearLinkedBase.md).[`includes`](LinearLinkedBase.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).
 
@@ -1281,7 +1395,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1032](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1032)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1062](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1062)
 
 Check whether the list is empty.
 
@@ -1376,13 +1490,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
+
+[`LinearLinkedBase`](LinearLinkedBase.md).[`keys`](LinearLinkedBase.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).
 
@@ -1425,7 +1563,7 @@ map<EM, RM>(
 thisArg?): DoublyLinkedList<EM, RM>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1500](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1500)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1588](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1588)
 
 Map values into a new list (possibly different element type).
 
@@ -1501,7 +1639,7 @@ Time O(N), Space O(N)
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1426](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1426)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1511](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1511)
 
 Map values into a new list of the same class.
 
@@ -1541,7 +1679,7 @@ Time O(N), Space O(N)
 pop(): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:402](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L402)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:408](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L408)
 
 Remove and return the tail element.
 
@@ -1584,7 +1722,7 @@ Time O(1), Space O(1)
 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.
 
@@ -1610,7 +1748,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
 push(elementOrNode): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:327](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L327)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:330](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L330)
 
 Append an element/node to the tail.
 
@@ -1665,7 +1803,7 @@ Time O(1), Space O(1)
 pushMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:553](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L553)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:565](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L565)
 
 Append a sequence of elements/nodes.
 
@@ -1733,7 +1871,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
 
@@ -1755,7 +1893,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
 
@@ -1781,7 +1919,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
 
@@ -1815,7 +1953,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.
 
@@ -1861,7 +1999,7 @@ Time O(n), Space O(1)
 reverse(): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1261](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1261)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1340](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1340)
 
 Reverse the list in place.
 
@@ -1898,7 +2036,7 @@ Time O(N), Space O(1)
 search(elementNodeOrPredicate): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1138](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1138)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1174](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1174)
 
 Find the first value matching a predicate scanning forward.
 
@@ -1941,7 +2079,7 @@ Time O(N), Space O(1)
 setAt(index, value): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:853](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L853)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:874](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L874)
 
 Set the element value at an index.
 
@@ -1981,7 +2119,7 @@ Time O(N), Space O(1)
 setEquality(equals): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1299](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1299)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1378](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1378)
 
 Set the equality comparator used to compare values.
 
@@ -2011,7 +2149,7 @@ Time O(1), Space O(1)
 shift(): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:466](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L466)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:475](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L475)
 
 Remove and return the head element.
 
@@ -2044,7 +2182,7 @@ Time O(1), 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).
 
@@ -2161,7 +2299,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.
 
@@ -2207,7 +2345,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.
 
@@ -2227,6 +2365,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
+
+[`LinearLinkedBase`](LinearLinkedBase.md).[`toReversed`](LinearLinkedBase.md#toreversed)
+
+***
+
 ### toReversedArray()
 
 ```ts
@@ -2259,7 +2423,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.
@@ -2286,7 +2450,7 @@ Time O(n), Space O(n).
 unshift(elementOrNode): boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L531)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:543](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L543)
 
 Prepend an element/node to the head.
 
@@ -2327,7 +2491,7 @@ Time O(1), Space O(1)
 unshiftMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:569](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L569)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:581](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L581)
 
 Prepend a sequence of elements/nodes.
 
@@ -2464,7 +2628,7 @@ Time O(1), Space O(1).
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1562](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1562)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1650](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1650)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -2498,7 +2662,7 @@ Time O(1), Space O(1)
 protected _createLike<EM, RM>(elements?, options?): DoublyLinkedList<EM, RM>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1580](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1580)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1668](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1668)
 
 (Protected) Create a like-kind instance and seed it from an iterable.
 
@@ -2546,7 +2710,7 @@ Time O(N), Space O(N)
 protected _ensureNode(elementOrNode): DoublyLinkedListNode<E>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1518](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1518)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1606](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1606)
 
 (Protected) Create or return a node for the given input (node or raw element).
 
@@ -2576,7 +2740,7 @@ Time O(1), Space O(1)
 protected _ensurePredicate(elementNodeOrPredicate): (node) => boolean;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1530](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1530)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1618](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1618)
 
 (Protected) Normalize input into a predicate over nodes.
 
@@ -2608,7 +2772,7 @@ Time O(1), Space O(1)
 protected _getIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1591](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1591)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1679](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1679)
 
 Internal iterator factory used by the default iterator.
 
@@ -2634,7 +2798,7 @@ Implementations should yield in O(1) per element with O(1) extra space when poss
 protected _getNodeIterator(): IterableIterator<DoublyLinkedListNode<E>>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1607](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1607)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1695](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1695)
 
 Iterate linked nodes from head to tail.
 
@@ -2660,7 +2824,7 @@ Time O(n), Space O(1)
 protected _getPrevNode(node): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1551](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1551)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1639](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1639)
 
 (Protected) Get the previous node of a given node.
 
@@ -2694,7 +2858,7 @@ Time O(1), Space O(1)
 protected _getReverseIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:1599](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1599)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:1687](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L1687)
 
 Reverse-direction iterator over elements.