data-structure-typed 2.6.0 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: DoublyLinkedList\<E, R\>
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:150](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L150)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:144](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L144)
 
 Doubly linked list with O(1) push/pop/unshift/shift and linear scans.
 
@@ -112,7 +112,7 @@ Caution: Although our linked list classes provide methods such as at, setAt, add
 new DoublyLinkedList<E, R>(elements?, options?): DoublyLinkedList<E, R>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:161](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L161)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:152](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L152)
 
 Create a DoublyLinkedList and optionally bulk-insert elements.
 
@@ -158,7 +158,7 @@ LinearLinkedBase<E, R, DoublyLinkedListNode<E>>.constructor
 get first(): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L219)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:204](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L204)
 
 Get the first element value.
 
@@ -182,7 +182,7 @@ First element or undefined.
 get head(): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L185)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:173](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L173)
 
 Get the head node.
 
@@ -206,7 +206,7 @@ Head node or undefined.
 get last(): E | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L229)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L213)
 
 Get the last element value.
 
@@ -230,7 +230,7 @@ Last element or undefined.
 get length(): number;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:209](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L209)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L195)
 
 Get the number of elements.
 
@@ -286,7 +286,7 @@ Maximum allowed length.
 get tail(): DoublyLinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:197](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L197)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:184](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L184)
 
 Get the tail node.
 
@@ -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:526](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L526)
 
 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:479](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L479)
 
 Insert a new element/node at an index, shifting following nodes.
 
@@ -434,8 +434,6 @@ Element or node to insert.
 
 True if inserted.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -461,7 +459,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:501](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L501)
 
 Insert a new element/node before an existing one.
 
@@ -501,7 +499,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:409](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L409)
 
 Get the element at a given index.
 
@@ -519,8 +517,6 @@ Zero-based index.
 
 Element or undefined.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -546,7 +542,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:627](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L627)
 
 Remove all nodes and reset length.
 
@@ -556,8 +552,6 @@ Remove all nodes and reset length.
 
 void
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -583,7 +577,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:781](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L781)
 
 Deep clone this list (values are copied by reference).
 
@@ -593,8 +587,6 @@ Deep clone this list (values are copied by reference).
 
 A new list with the same element sequence.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -621,7 +613,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:462](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L462)
 
 Concatenate lists/elements preserving order.
 
@@ -657,7 +649,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:590](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L590)
 
 Delete the first match by value/node.
 
@@ -675,8 +667,6 @@ Element or node to remove.
 
 True if removed.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -702,7 +692,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:566](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L566)
 
 Delete the element at an index.
 
@@ -720,8 +710,6 @@ Zero-based index.
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -747,7 +735,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:745](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L745)
 
 Delete the first element that satisfies a predicate.
 
@@ -771,6 +759,30 @@ Time O(N), Space O(1)
 
 ***
 
+### entries()
+
+```ts
+entries(): IterableIterator<[number, E]>;
+```
+
+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).
+
+#### 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
@@ -820,7 +832,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.
 
@@ -866,7 +878,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:799](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L799)
 
 Filter values into a new list of the same class.
 
@@ -890,8 +902,6 @@ Value for `this` inside the callback.
 
 A new list with kept values.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1007,7 +1017,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.
 
@@ -1041,6 +1051,78 @@ Time O(n), Space O(1)
 
 ***
 
+### findLast()
+
+```ts
+findLast(elementNodeOrPredicate): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:689](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L689)
+
+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:707](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L707)
+
+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 +1163,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:671](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L671)
 
 #### Parameters
 
@@ -1099,29 +1179,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
+#### Deprecated
 
-Time O(N), Space O(1)
-
-#### Example
-
-```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 +1195,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:439](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L439)
 
 Find a node by value, reference, or predicate.
 
@@ -1163,7 +1227,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:426](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L426)
 
 Get the node reference at a given index.
 
@@ -1181,8 +1245,6 @@ Zero-based index.
 
 Node or undefined.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -1207,7 +1269,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.
 
@@ -1235,13 +1297,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: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`).
+
+#### 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:417](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L417)
 
 Linked-list optimized `indexOf` (forwards scan).
 
@@ -1281,7 +1377,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:613](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L613)
 
 Check whether the list is empty.
 
@@ -1291,8 +1387,6 @@ Check whether the list is empty.
 
 True if length is 0.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1316,7 +1410,7 @@ Time O(1), Space O(1)
 isNode(elementNodeOrPredicate): elementNodeOrPredicate is DoublyLinkedListNode<E>;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L260)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:242](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L242)
 
 Type guard: check whether the input is a DoublyLinkedListNode.
 
@@ -1348,7 +1442,7 @@ Time O(1), Space O(1)
 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.
 
@@ -1376,13 +1470,37 @@ Time O(n), Space O(n)
 
 ***
 
+### keys()
+
+```ts
+keys(): IterableIterator<number>;
+```
+
+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).
+
+#### 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:440](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L440)
 
 Linked-list optimized `lastIndexOf` (reverse scan).
 
@@ -1425,7 +1543,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:847](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L847)
 
 Map values into a new list (possibly different element type).
 
@@ -1465,8 +1583,6 @@ Value for `this` inside the callback.
 
 A new DoublyLinkedList with mapped values.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1501,7 +1617,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:813](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L813)
 
 Map values into a new list of the same class.
 
@@ -1541,7 +1657,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:304](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L304)
 
 Remove and return the tail element.
 
@@ -1551,8 +1667,6 @@ Remove and return the tail element.
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1584,7 +1698,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: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.
 
@@ -1610,7 +1724,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:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L269)
 
 Append an element/node to the tail.
 
@@ -1628,8 +1742,6 @@ Element or node to append.
 
 True when appended.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1665,7 +1777,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:374](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L374)
 
 Append a sequence of elements/nodes.
 
@@ -1733,7 +1845,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:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
 
 ##### Parameters
 
@@ -1755,7 +1867,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:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1781,7 +1893,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:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Type Parameters
 
@@ -1815,7 +1927,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: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.
 
@@ -1861,7 +1973,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:728](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L728)
 
 Reverse the list in place.
 
@@ -1871,8 +1983,6 @@ Reverse the list in place.
 
 This list.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -1898,7 +2008,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:644](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L644)
 
 Find the first value matching a predicate scanning forward.
 
@@ -1918,8 +2028,6 @@ Element, node, or predicate to match.
 
 Matched value or undefined.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -1941,7 +2049,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:548](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L548)
 
 Set the element value at an index.
 
@@ -1981,7 +2089,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:765](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L765)
 
 Set the equality comparator used to compare values.
 
@@ -2011,7 +2119,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:328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L328)
 
 Remove and return the head element.
 
@@ -2021,8 +2129,6 @@ Remove and return the head element.
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -2044,7 +2150,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: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).
 
@@ -2124,7 +2230,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.
 
@@ -2161,7 +2267,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: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.
 
@@ -2207,7 +2313,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: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.
 
@@ -2227,13 +2333,39 @@ Time O(n), Space O(n).
 
 ***
 
+### toReversed()
+
+```ts
+toReversed(): this;
+```
+
+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).
+
+#### 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
 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.
 
@@ -2259,7 +2391,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: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.
@@ -2286,7 +2418,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:353](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L353)
 
 Prepend an element/node to the head.
 
@@ -2304,8 +2436,6 @@ Element or node to prepend.
 
 True when prepended.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -2327,7 +2457,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:389](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L389)
 
 Prepend a sequence of elements/nodes.
 
@@ -2385,7 +2515,7 @@ Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
 static fromArray<E, R>(this, data): any;
 ```
 
-Defined in: [data-structures/linked-list/doubly-linked-list.ts:243](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L243)
+Defined in: [data-structures/linked-list/doubly-linked-list.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L226)
 
 Create a new list from an array of elements.
 
@@ -2464,7 +2594,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:907](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L907)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -2498,7 +2628,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:924](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L924)
 
 (Protected) Create a like-kind instance and seed it from an iterable.
 
@@ -2546,7 +2676,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:866](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L866)
 
 (Protected) Create or return a node for the given input (node or raw element).
 
@@ -2576,7 +2706,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:877](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L877)
 
 (Protected) Normalize input into a predicate over nodes.
 
@@ -2608,7 +2738,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:935](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L935)
 
 Internal iterator factory used by the default iterator.
 
@@ -2634,7 +2764,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:951](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L951)
 
 Iterate linked nodes from head to tail.
 
@@ -2660,7 +2790,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:897](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L897)
 
 (Protected) Get the previous node of a given node.
 
@@ -2694,7 +2824,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:943](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/doubly-linked-list.ts#L943)
 
 Reverse-direction iterator over elements.