data-structure-typed 2.5.0 → 2.5.1

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

@@ -0,0 +1,2824 @@
+[**data-structure-typed**](../README.md)
+
+***
+
+[data-structure-typed](../README.md) / LinkedListQueue
+
+# Class: LinkedListQueue\<E, R\>
+
+Defined in: [data-structures/queue/queue.ts:953](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/queue/queue.ts#L953)
+
+Queue implemented over a singly linked list; preserves head/tail operations with linear scans for queries.
+
+## Remarks
+
+Time O(1), Space O(1)
+
+## Example
+
+```ts
+examples will be generated by unit test
+```
+
+## Extends
+
+- [`SinglyLinkedList`](SinglyLinkedList.md)\<`E`, `R`\>
+
+## Type Parameters
+
+### E
+
+`E` = `any`
+
+### R
+
+`R` = `any`
+
+## Constructors
+
+### Constructor
+
+```ts
+new LinkedListQueue<E, R>(elements?, options?): LinkedListQueue<E, R>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:205](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L205)
+
+Create a SinglyLinkedList and optionally bulk-insert elements.
+
+#### Parameters
+
+##### elements?
+
+  \| `Iterable`\<`E`, `any`, `any`\>
+  \| `Iterable`\<`R`, `any`, `any`\>
+  \| `Iterable`\<[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>, `any`, `any`\>
+
+Iterable of elements or nodes (or raw records if toElementFn is provided).
+
+##### options?
+
+`SinglyLinkedListOptions`\<`E`, `R`\>
+
+Options such as maxLen and toElementFn.
+
+#### Returns
+
+`LinkedListQueue`\<`E`, `R`\>
+
+New SinglyLinkedList instance.
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`constructor`](SinglyLinkedList.md#constructor)
+
+## Properties
+
+### first
+
+#### Get Signature
+
+```ts
+get first(): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:255](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L255)
+
+Get the first element value.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+`E` \| `undefined`
+
+First element or undefined.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`first`](SinglyLinkedList.md#first)
+
+***
+
+### head
+
+#### Get Signature
+
+```ts
+get head(): SinglyLinkedListNode<E> | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:221](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L221)
+
+Get the head node.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\> \| `undefined`
+
+Head node or undefined.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`head`](SinglyLinkedList.md#head)
+
+***
+
+### last
+
+#### Get Signature
+
+```ts
+get last(): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:265](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L265)
+
+Get the last element value.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+`E` \| `undefined`
+
+Last element or undefined.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`last`](SinglyLinkedList.md#last)
+
+***
+
+### length
+
+#### Get Signature
+
+```ts
+get length(): number;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:245](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L245)
+
+Get the number of elements.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+`number`
+
+Current length.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`length`](SinglyLinkedList.md#length)
+
+***
+
+### maxLen
+
+#### Get Signature
+
+```ts
+get maxLen(): number;
+```
+
+Defined in: [data-structures/base/linear-base.ts:100](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L100)
+
+Upper bound for length (if positive), or `-1` when unbounded.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+`number`
+
+Maximum allowed length.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`maxLen`](SinglyLinkedList.md#maxlen)
+
+***
+
+### tail
+
+#### Get Signature
+
+```ts
+get tail(): SinglyLinkedListNode<E> | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:233](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L233)
+
+Get the tail node.
+
+##### Remarks
+
+Time O(1), Space O(1)
+
+##### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\> \| `undefined`
+
+Tail node or undefined.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`tail`](SinglyLinkedList.md#tail)
+
+***
+
+### toElementFn
+
+#### Get Signature
+
+```ts
+get toElementFn(): ((rawElement) => E) | undefined;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:47](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L47)
+
+Exposes the current `toElementFn`, if configured.
+
+##### Remarks
+
+Time O(1), Space O(1).
+
+##### Returns
+
+((`rawElement`) => `E`) \| `undefined`
+
+The converter function or `undefined` when not set.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`toElementFn`](SinglyLinkedList.md#toelementfn)
+
+## Methods
+
+### \[iterator\]()
+
+```ts
+iterator: IterableIterator<E>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:60](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L60)
+
+Returns an iterator over the structure's elements.
+
+#### Parameters
+
+##### args
+
+...`unknown`[]
+
+Optional iterator arguments forwarded to the internal iterator.
+
+#### Returns
+
+`IterableIterator`\<`E`\>
+
+An `IterableIterator<E>` that yields the elements in traversal order.
+
+#### Remarks
+
+Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`[iterator]`](SinglyLinkedList.md#iterator)
+
+***
+
+### addAfter()
+
+```ts
+addAfter(existingElementOrNode, newElementOrNode): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1057](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1057)
+
+Insert a new element/node after an existing one.
+
+#### Parameters
+
+##### existingElementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Existing element or node.
+
+##### newElementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to insert.
+
+#### Returns
+
+`boolean`
+
+True if inserted.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`addAfter`](SinglyLinkedList.md#addafter)
+
+***
+
+### addAt()
+
+```ts
+addAt(index, newElementOrNode): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:835](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L835)
+
+Insert a new element/node at an index, shifting following nodes.
+
+#### Parameters
+
+##### index
+
+`number`
+
+Zero-based index.
+
+##### newElementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to insert.
+
+#### Returns
+
+`boolean`
+
+True if inserted.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Insert at index
+ const list = new SinglyLinkedList<number>([1, 3]);
+    list.addAt(1, 2);
+    console.log(list.toArray()); // [1, 2, 3];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`addAt`](SinglyLinkedList.md#addat)
+
+***
+
+### addBefore()
+
+```ts
+addBefore(existingElementOrNode, newElementOrNode): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1027](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1027)
+
+Insert a new element/node before an existing one.
+
+#### Parameters
+
+##### existingElementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Existing element or node.
+
+##### newElementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to insert.
+
+#### Returns
+
+`boolean`
+
+True if inserted.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`addBefore`](SinglyLinkedList.md#addbefore)
+
+***
+
+### at()
+
+```ts
+at(index): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:631](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L631)
+
+Get the element at a given index.
+
+#### Parameters
+
+##### index
+
+`number`
+
+Zero-based index.
+
+#### Returns
+
+`E` \| `undefined`
+
+Element or undefined.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Access element by index
+ const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
+    console.log(list.at(0)); // 'a';
+    console.log(list.at(2)); // 'c';
+    console.log(list.at(3)); // 'd';
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`at`](SinglyLinkedList.md#at)
+
+***
+
+### clear()
+
+```ts
+clear(): void;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:938](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L938)
+
+Remove all nodes and reset length.
+
+#### Returns
+
+`void`
+
+void
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Remove all
+ const list = new SinglyLinkedList<number>([1, 2, 3]);
+    list.clear();
+    console.log(list.isEmpty()); // true;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`clear`](SinglyLinkedList.md#clear)
+
+***
+
+### clone()
+
+```ts
+clone(): this;
+```
+
+Defined in: [data-structures/queue/queue.ts:960](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/queue/queue.ts#L960)
+
+Deep clone this linked-list-based queue.
+
+#### Returns
+
+`this`
+
+A new queue with the same sequence of elements.
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Overrides
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`clone`](SinglyLinkedList.md#clone)
+
+***
+
+### concat()
+
+```ts
+concat(...items): this;
+```
+
+Defined in: [data-structures/base/linear-base.ts:473](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L473)
+
+Concatenate lists/elements preserving order.
+
+#### Parameters
+
+##### items
+
+...(
+  \| `E`
+  \| [`LinearBase`](LinearBase.md)\<`E`, `R`, [`LinkedListNode`](LinkedListNode.md)\<`E`\>\>)[]
+
+Elements or `LinearBase` instances.
+
+#### Returns
+
+`this`
+
+New list with combined elements (`this` type).
+
+#### Remarks
+
+Time O(sum(length)), Space O(sum(length))
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`concat`](SinglyLinkedList.md#concat)
+
+***
+
+### countOccurrences()
+
+```ts
+countOccurrences(elementOrNode): number;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1133](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1133)
+
+Count how many nodes match a value/node/predicate.
+
+#### Parameters
+
+##### elementOrNode
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or node predicate to match.
+
+#### Returns
+
+`number`
+
+Number of matches in the list.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`countOccurrences`](SinglyLinkedList.md#countoccurrences)
+
+***
+
+### delete()
+
+```ts
+delete(elementOrNode?): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:780](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L780)
+
+Delete the first match by value/node.
+
+#### Parameters
+
+##### elementOrNode?
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to remove; if omitted/undefined, nothing happens.
+
+#### Returns
+
+`boolean`
+
+True if removed.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Remove first occurrence
+ const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
+    list.delete(2);
+    console.log(list.toArray()); // [1, 3, 2];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`delete`](SinglyLinkedList.md#delete)
+
+***
+
+### deleteAt()
+
+```ts
+deleteAt(index): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:731](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L731)
+
+Delete the element at an index.
+
+#### Parameters
+
+##### index
+
+`number`
+
+Zero-based index.
+
+#### Returns
+
+`E` \| `undefined`
+
+Removed element or undefined.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Remove by index
+ const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+    list.deleteAt(1);
+    console.log(list.toArray()); // ['a', 'c'];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`deleteAt`](SinglyLinkedList.md#deleteat)
+
+***
+
+### deleteWhere()
+
+```ts
+deleteWhere(predicate): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1163](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1163)
+
+Delete the first node whose value matches a predicate.
+
+#### Parameters
+
+##### predicate
+
+(`value`, `index`, `list`) => `boolean`
+
+Predicate (value, index, list) → boolean to decide deletion.
+
+#### Returns
+
+`boolean`
+
+True if a node was removed.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`deleteWhere`](SinglyLinkedList.md#deletewhere)
+
+***
+
+### every()
+
+```ts
+every(predicate, thisArg?): boolean;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:86](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L86)
+
+Tests whether all elements satisfy the predicate.
+
+#### Parameters
+
+##### predicate
+
+`ElementCallback`\<`E`, `R`, `boolean`\>
+
+Function invoked for each element with signature `(value, index, self)`.
+
+##### thisArg?
+
+`unknown`
+
+Optional `this` binding for the predicate.
+
+#### Returns
+
+`boolean`
+
+`true` if every element passes; otherwise `false`.
+
+#### Remarks
+
+Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`every`](SinglyLinkedList.md#every)
+
+***
+
+### fill()
+
+```ts
+fill(
+   value, 
+   start?, 
+   end?): this;
+```
+
+Defined in: [data-structures/base/linear-base.ts:292](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L292)
+
+Fill a range with a value.
+
+#### Parameters
+
+##### value
+
+`E`
+
+Value to set.
+
+##### start?
+
+`number` = `0`
+
+Inclusive start.
+
+##### end?
+
+`number` = `...`
+
+Exclusive end.
+
+#### Returns
+
+`this`
+
+This list.
+
+#### Remarks
+
+Time O(n), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`fill`](SinglyLinkedList.md#fill)
+
+***
+
+### filter()
+
+```ts
+filter(callback, thisArg?): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1281](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1281)
+
+Filter values into a new list of the same class.
+
+#### Parameters
+
+##### callback
+
+`ElementCallback`\<`E`, `R`, `boolean`\>
+
+Predicate (value, index, list) → boolean to keep value.
+
+##### thisArg?
+
+`any`
+
+Value for `this` inside the callback.
+
+#### Returns
+
+`this`
+
+A new list with kept values.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Example
+
+```ts
+// SinglyLinkedList filter and map operations
+ const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
+
+    // Filter even numbers
+    const filtered = list.filter(value => value % 2 === 0);
+    console.log(filtered.length); // 2;
+
+    // Map to double values
+    const doubled = list.map(value => value * 2);
+    console.log(doubled.length); // 5;
+
+    // Use reduce to sum
+    const sum = list.reduce((acc, value) => acc + value, 0);
+    console.log(sum); // 15;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`filter`](SinglyLinkedList.md#filter)
+
+***
+
+### find()
+
+#### Call Signature
+
+```ts
+find<S>(predicate, thisArg?): S | undefined;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:162](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L162)
+
+Finds the first element that satisfies the predicate and returns it.
+
+Finds the first element of type `S` (a subtype of `E`) that satisfies the predicate and returns it.
+
+##### Type Parameters
+
+###### S
+
+`S`
+
+##### Parameters
+
+###### predicate
+
+`ElementCallback`\<`E`, `R`, `S`\>
+
+Type-guard predicate: `(value, index, self) => value is S`.
+
+###### thisArg?
+
+`unknown`
+
+Optional `this` binding for the predicate.
+
+##### Returns
+
+`S` \| `undefined`
+
+The matched element typed as `S`, or `undefined` if not found.
+
+##### Remarks
+
+Time O(n) in the worst case; may exit early on the first match. Space O(1).
+
+##### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`find`](SinglyLinkedList.md#find)
+
+#### Call Signature
+
+```ts
+find(predicate, thisArg?): E | undefined;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:163](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L163)
+
+Finds the first element that satisfies the predicate and returns it.
+
+Finds the first element of type `S` (a subtype of `E`) that satisfies the predicate and returns it.
+
+##### Parameters
+
+###### predicate
+
+`ElementCallback`\<`E`, `R`, `unknown`\>
+
+Type-guard predicate: `(value, index, self) => value is S`.
+
+###### thisArg?
+
+`unknown`
+
+Optional `this` binding for the predicate.
+
+##### Returns
+
+`E` \| `undefined`
+
+The matched element typed as `S`, or `undefined` if not found.
+
+##### Remarks
+
+Time O(n) in the worst case; may exit early on the first match. Space O(1).
+
+##### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`find`](SinglyLinkedList.md#find)
+
+***
+
+### findIndex()
+
+```ts
+findIndex(predicate, thisArg?): number;
+```
+
+Defined in: [data-structures/base/linear-base.ts:151](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L151)
+
+Find the first index matching a predicate.
+
+#### Parameters
+
+##### predicate
+
+`ElementCallback`\<`E`, `R`, `boolean`\>
+
+`(element, index, self) => boolean`.
+
+##### thisArg?
+
+`any`
+
+Optional `this` for callback.
+
+#### Returns
+
+`number`
+
+Index or `-1`.
+
+#### Remarks
+
+Time O(n), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`findIndex`](SinglyLinkedList.md#findindex)
+
+***
+
+### forEach()
+
+```ts
+forEach(callbackfn, thisArg?): void;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:132](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L132)
+
+Invokes a callback for each element in iteration order.
+
+#### Parameters
+
+##### callbackfn
+
+`ElementCallback`\<`E`, `R`, `void`\>
+
+Function invoked per element with signature `(value, index, self)`.
+
+##### thisArg?
+
+`unknown`
+
+Optional `this` binding for the callback.
+
+#### Returns
+
+`void`
+
+`void`.
+
+#### Remarks
+
+Time O(n), Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`forEach`](SinglyLinkedList.md#foreach)
+
+***
+
+### getNode()
+
+```ts
+getNode(elementNodeOrPredicate?): SinglyLinkedListNode<E> | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1005](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1005)
+
+Find a node by value, reference, or predicate.
+
+#### Parameters
+
+##### elementNodeOrPredicate?
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or node predicate to match.
+
+#### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\> \| `undefined`
+
+Matching node or undefined.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`getNode`](SinglyLinkedList.md#getnode)
+
+***
+
+### getNodeAt()
+
+```ts
+getNodeAt(index): SinglyLinkedListNode<E> | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:687](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L687)
+
+Get the node reference at a given index.
+
+#### Parameters
+
+##### index
+
+`number`
+
+Zero-based index.
+
+#### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\> \| `undefined`
+
+Node or undefined.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Get node at index
+ const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+    console.log(list.getNodeAt(1)?.value); // 'b';
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`getNodeAt`](SinglyLinkedList.md#getnodeat)
+
+***
+
+### has()
+
+```ts
+has(element): boolean;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:188](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L188)
+
+Checks whether a strictly-equal element exists in the structure.
+
+#### Parameters
+
+##### element
+
+`E`
+
+The element to test with `===` equality.
+
+#### Returns
+
+`boolean`
+
+`true` if an equal element is found; otherwise `false`.
+
+#### Remarks
+
+Time O(n) in the worst case. Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`has`](SinglyLinkedList.md#has)
+
+***
+
+### indexOf()
+
+```ts
+indexOf(searchElement, fromIndex?): number;
+```
+
+Defined in: [data-structures/base/linear-base.ts:422](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L422)
+
+Linked-list optimized `indexOf` (forwards scan).
+
+#### Parameters
+
+##### searchElement
+
+`E`
+
+Value to match.
+
+##### fromIndex?
+
+`number` = `0`
+
+Start position.
+
+#### Returns
+
+`number`
+
+Index or `-1`.
+
+#### Remarks
+
+Time O(n), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`indexOf`](SinglyLinkedList.md#indexof)
+
+***
+
+### isEmpty()
+
+```ts
+isEmpty(): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:897](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L897)
+
+Check whether the list is empty.
+
+#### Returns
+
+`boolean`
+
+True if length is 0.
+
+ *
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Example
+
+```ts
+// Check empty
+ console.log(new SinglyLinkedList().isEmpty()); // true;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`isEmpty`](SinglyLinkedList.md#isempty)
+
+***
+
+### isNode()
+
+```ts
+isNode(elementNodeOrPredicate): elementNodeOrPredicate is SinglyLinkedListNode<E>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:645](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L645)
+
+Type guard: check whether the input is a SinglyLinkedListNode.
+
+#### Parameters
+
+##### elementNodeOrPredicate
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or predicate.
+
+#### Returns
+
+`elementNodeOrPredicate is SinglyLinkedListNode<E>`
+
+True if the value is a SinglyLinkedListNode.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`isNode`](SinglyLinkedList.md#isnode)
+
+***
+
+### join()
+
+```ts
+join(separator?): string;
+```
+
+Defined in: [data-structures/base/linear-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L228)
+
+Join all elements into a string.
+
+#### Parameters
+
+##### separator?
+
+`string` = `','`
+
+Separator string.
+
+#### Returns
+
+`string`
+
+Concatenated string.
+
+#### Remarks
+
+Time O(n), Space O(n)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`join`](SinglyLinkedList.md#join)
+
+***
+
+### lastIndexOf()
+
+```ts
+lastIndexOf(searchElement, fromIndex?): number;
+```
+
+Defined in: [data-structures/base/linear-base.ts:448](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L448)
+
+Linked-list optimized `lastIndexOf` (reverse scan).
+
+#### Parameters
+
+##### searchElement
+
+`E`
+
+Value to match.
+
+##### fromIndex?
+
+`number` = `...`
+
+Start position.
+
+#### Returns
+
+`number`
+
+Index or `-1`.
+
+#### Remarks
+
+Time O(n), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`lastIndexOf`](SinglyLinkedList.md#lastindexof)
+
+***
+
+### map()
+
+```ts
+map<EM, RM>(
+   callback, 
+   options?, 
+thisArg?): SinglyLinkedList<EM, RM>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1350](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1350)
+
+Map values into a new list (possibly different element type).
+
+#### Type Parameters
+
+##### EM
+
+`EM`
+
+##### RM
+
+`RM` = `any`
+
+#### Parameters
+
+##### callback
+
+`ElementCallback`\<`E`, `R`, `EM`\>
+
+Mapping function (value, index, list) → newElement.
+
+##### options?
+
+`SinglyLinkedListOptions`\<`EM`, `RM`\>
+
+Options for the output list (e.g., maxLen, toElementFn).
+
+##### thisArg?
+
+`any`
+
+Value for `this` inside the callback.
+
+#### Returns
+
+[`SinglyLinkedList`](SinglyLinkedList.md)\<`EM`, `RM`\>
+
+A new SinglyLinkedList with mapped values.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Example
+
+```ts
+// Transform elements
+ const list = new SinglyLinkedList<number>([1, 2, 3]);
+    const doubled = list.map(n => n * 2);
+    console.log([...doubled]); // [2, 4, 6];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`map`](SinglyLinkedList.md#map)
+
+***
+
+### mapSame()
+
+```ts
+mapSame(callback, thisArg?): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1296](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1296)
+
+Map values into a new list of the same class.
+
+#### Parameters
+
+##### callback
+
+`ElementCallback`\<`E`, `R`, `E`\>
+
+Mapping function (value, index, list) → newValue.
+
+##### thisArg?
+
+`any`
+
+Value for `this` inside the callback.
+
+#### Returns
+
+`this`
+
+A new list with mapped values.
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`mapSame`](SinglyLinkedList.md#mapsame)
+
+***
+
+### pop()
+
+```ts
+pop(): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:406](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L406)
+
+Remove and return the tail element.
+
+#### Returns
+
+`E` \| `undefined`
+
+Removed element or undefined.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// SinglyLinkedList pop and shift operations
+ const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
+
+    // Pop removes from the end
+    const last = list.pop();
+    console.log(last); // 50;
+
+    // Shift removes from the beginning
+    const first = list.shift();
+    console.log(first); // 10;
+
+    // Verify remaining elements
+    console.log([...list]); // [20, 30, 40];
+    console.log(list.length); // 3;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`pop`](SinglyLinkedList.md#pop)
+
+***
+
+### print()
+
+```ts
+print(): void;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:268](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L268)
+
+Prints `toVisual()` to the console. Intended for quick debugging.
+
+#### Returns
+
+`void`
+
+`void`.
+
+#### Remarks
+
+Time O(n) due to materialization, Space O(n) for the intermediate representation.
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`print`](SinglyLinkedList.md#print)
+
+***
+
+### push()
+
+```ts
+push(elementOrNode): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:344](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L344)
+
+Append an element/node to the tail.
+
+#### Parameters
+
+##### elementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to append.
+
+#### Returns
+
+`boolean`
+
+True when appended.
+
+ *
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Example
+
+```ts
+// basic SinglyLinkedList creation and push operation
+ // Create a simple SinglyLinkedList with initial values
+    const list = new SinglyLinkedList([1, 2, 3, 4, 5]);
+
+    // Verify the list maintains insertion order
+    console.log([...list]); // [1, 2, 3, 4, 5];
+
+    // Check length
+    console.log(list.length); // 5;
+
+    // Push a new element to the end
+    list.push(6);
+    console.log(list.length); // 6;
+    console.log([...list]); // [1, 2, 3, 4, 5, 6];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`push`](SinglyLinkedList.md#push)
+
+***
+
+### pushMany()
+
+```ts
+pushMany(elements): boolean[];
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:546](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L546)
+
+Append a sequence of elements/nodes.
+
+#### Parameters
+
+##### elements
+
+  \| `Iterable`\<`E`, `any`, `any`\>
+  \| `Iterable`\<`R`, `any`, `any`\>
+  \| `Iterable`\<[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>, `any`, `any`\>
+
+Iterable of elements or nodes (or raw records if toElementFn is provided).
+
+#### Returns
+
+`boolean`[]
+
+Array of per-element success flags.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`pushMany`](SinglyLinkedList.md#pushmany)
+
+***
+
+### reduce()
+
+Reduces all elements to a single accumulated value.
+
+#### Param
+
+Reducer of signature `(acc, value, index, self) => nextAcc`. The first element is used as the initial accumulator.
+
+#### Param
+
+Reducer of signature `(acc, value, index, self) => nextAcc`.
+
+#### Param
+
+The initial accumulator value of type `E`.
+
+#### Template
+
+The accumulator type when it differs from `E`.
+
+#### Param
+
+Reducer of signature `(acc: U, value, index, self) => U`.
+
+#### Param
+
+The initial accumulator value of type `U`.
+
+#### Remarks
+
+Time O(n), Space O(1). Throws if called on an empty structure without `initialValue`.
+
+#### Call Signature
+
+```ts
+reduce(callbackfn): E;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:193](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L193)
+
+##### Parameters
+
+###### callbackfn
+
+`ReduceElementCallback`\<`E`, `R`\>
+
+##### Returns
+
+`E`
+
+##### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`reduce`](SinglyLinkedList.md#reduce)
+
+#### Call Signature
+
+```ts
+reduce(callbackfn, initialValue): E;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L194)
+
+##### Parameters
+
+###### callbackfn
+
+`ReduceElementCallback`\<`E`, `R`\>
+
+###### initialValue
+
+`E`
+
+##### Returns
+
+`E`
+
+##### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`reduce`](SinglyLinkedList.md#reduce)
+
+#### Call Signature
+
+```ts
+reduce<U>(callbackfn, initialValue): U;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L195)
+
+##### Type Parameters
+
+###### U
+
+`U`
+
+##### Parameters
+
+###### callbackfn
+
+`ReduceElementCallback`\<`E`, `R`, `U`\>
+
+###### initialValue
+
+`U`
+
+##### Returns
+
+`U`
+
+##### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`reduce`](SinglyLinkedList.md#reduce)
+
+***
+
+### reduceRight()
+
+```ts
+reduceRight<U>(callbackfn, initialValue): U;
+```
+
+Defined in: [data-structures/base/linear-base.ts:574](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L574)
+
+Right-to-left reduction using reverse iterator.
+
+#### Type Parameters
+
+##### U
+
+`U`
+
+#### Parameters
+
+##### callbackfn
+
+`ReduceLinearCallback`\<`E`, `U`\>
+
+`(acc, element, index, self) => acc`.
+
+##### initialValue
+
+`U`
+
+Initial accumulator.
+
+#### Returns
+
+`U`
+
+Final accumulator.
+
+#### Remarks
+
+Time O(n), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`reduceRight`](SinglyLinkedList.md#reduceright)
+
+***
+
+### reverse()
+
+```ts
+reverse(): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:983](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L983)
+
+Reverse the list in place.
+
+#### Returns
+
+`this`
+
+This list.
+
+ *
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Example
+
+```ts
+// Reverse the list in-place
+ const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
+    list.reverse();
+    console.log([...list]); // [4, 3, 2, 1];
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`reverse`](SinglyLinkedList.md#reverse)
+
+***
+
+### search()
+
+```ts
+search(elementNodeOrPredicate): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:578](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L578)
+
+Find the first value matching a predicate (by node).
+
+#### Parameters
+
+##### elementNodeOrPredicate
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or node predicate to match.
+
+#### Returns
+
+`E` \| `undefined`
+
+Matched value or undefined.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`search`](SinglyLinkedList.md#search)
+
+***
+
+### setAt()
+
+```ts
+setAt(index, value): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:855](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L855)
+
+Set the element value at an index.
+
+#### Parameters
+
+##### index
+
+`number`
+
+Zero-based index.
+
+##### value
+
+`E`
+
+New value.
+
+#### Returns
+
+`boolean`
+
+True if updated.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`setAt`](SinglyLinkedList.md#setat)
+
+***
+
+### setEquality()
+
+```ts
+setEquality(equals): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1151](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1151)
+
+Set the equality comparator used to compare values.
+
+#### Parameters
+
+##### equals
+
+(`a`, `b`) => `boolean`
+
+Equality predicate (a, b) → boolean.
+
+#### Returns
+
+`this`
+
+This list.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`setEquality`](SinglyLinkedList.md#setequality)
+
+***
+
+### shift()
+
+```ts
+shift(): E | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:463](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L463)
+
+Remove and return the head element.
+
+#### Returns
+
+`E` \| `undefined`
+
+Removed element or undefined.
+
+ *
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Example
+
+```ts
+// Remove from the front
+ const list = new SinglyLinkedList<number>([10, 20, 30]);
+    console.log(list.shift()); // 10;
+    console.log(list.length); // 2;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`shift`](SinglyLinkedList.md#shift)
+
+***
+
+### slice()
+
+```ts
+slice(start?, end?): this;
+```
+
+Defined in: [data-structures/base/linear-base.ts:494](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L494)
+
+Slice via forward iteration (no random access required).
+
+#### Parameters
+
+##### start?
+
+`number` = `0`
+
+Inclusive start (supports negative index).
+
+##### end?
+
+`number` = `...`
+
+Exclusive end (supports negative index).
+
+#### Returns
+
+`this`
+
+New list (`this` type).
+
+#### Remarks
+
+Time O(n), Space O(n)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`slice`](SinglyLinkedList.md#slice)
+
+***
+
+### some()
+
+```ts
+some(predicate, thisArg?): boolean;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:109](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L109)
+
+Tests whether at least one element satisfies the predicate.
+
+#### Parameters
+
+##### predicate
+
+`ElementCallback`\<`E`, `R`, `boolean`\>
+
+Function invoked for each element with signature `(value, index, self)`.
+
+##### thisArg?
+
+`unknown`
+
+Optional `this` binding for the predicate.
+
+#### Returns
+
+`boolean`
+
+`true` if any element passes; otherwise `false`.
+
+#### Remarks
+
+Time O(n) in the worst case; may exit early on first success. Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`some`](SinglyLinkedList.md#some)
+
+***
+
+### sort()
+
+```ts
+sort(compareFn?): this;
+```
+
+Defined in: [data-structures/base/linear-base.ts:185](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L185)
+
+In-place stable order via array sort semantics.
+
+#### Parameters
+
+##### compareFn?
+
+(`a`, `b`) => `number`
+
+Comparator `(a, b) => number`.
+
+#### Returns
+
+`this`
+
+This container.
+
+#### Remarks
+
+Time O(n log n), Space O(n) (materializes to array temporarily)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`sort`](SinglyLinkedList.md#sort)
+
+***
+
+### splice()
+
+```ts
+splice(
+   start, 
+   deleteCount?, ...
+   items?): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1077](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1077)
+
+Remove and/or insert elements at a position (array-like behavior).
+
+#### Parameters
+
+##### start
+
+`number`
+
+Start index (clamped to [0, length]).
+
+##### deleteCount?
+
+`number` = `0`
+
+Number of elements to remove (default 0).
+
+##### items?
+
+...`E`[]
+
+Elements to insert after `start`.
+
+#### Returns
+
+`this`
+
+A new list containing the removed elements (typed as `this`).
+
+#### Remarks
+
+Time O(N + M), Space O(M)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`splice`](SinglyLinkedList.md#splice)
+
+***
+
+### toArray()
+
+```ts
+toArray(): E[];
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:245](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L245)
+
+Materializes the elements into a new array.
+
+#### Returns
+
+`E`[]
+
+A shallow array copy of the iteration order.
+
+#### Remarks
+
+Time O(n), Space O(n).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`toArray`](SinglyLinkedList.md#toarray)
+
+***
+
+### toReversedArray()
+
+```ts
+toReversedArray(): E[];
+```
+
+Defined in: [data-structures/base/linear-base.ts:237](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L237)
+
+Snapshot elements into a reversed array.
+
+#### Returns
+
+`E`[]
+
+New reversed array.
+
+#### Remarks
+
+Time O(n), Space O(n)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`toReversedArray`](SinglyLinkedList.md#toreversedarray)
+
+***
+
+### toVisual()
+
+```ts
+toVisual(): E[];
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:257](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L257)
+
+Returns a representation of the structure suitable for quick visualization.
+Defaults to an array of elements; subclasses may override to provide richer visuals.
+
+#### Returns
+
+`E`[]
+
+A visual representation (array by default).
+
+#### Remarks
+
+Time O(n), Space O(n).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`toVisual`](SinglyLinkedList.md#tovisual)
+
+***
+
+### unshift()
+
+```ts
+unshift(elementOrNode): boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:527](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L527)
+
+Prepend an element/node to the head.
+
+#### Parameters
+
+##### elementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node to prepend.
+
+#### Returns
+
+`boolean`
+
+True when prepended.
+
+ *
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Example
+
+```ts
+// SinglyLinkedList unshift and forward traversal
+ const list = new SinglyLinkedList<number>([20, 30, 40]);
+
+    // Unshift adds to the beginning
+    list.unshift(10);
+    console.log([...list]); // [10, 20, 30, 40];
+
+    // Access elements (forward traversal only for singly linked)
+    const second = list.at(1);
+    console.log(second); // 20;
+
+    // SinglyLinkedList allows forward iteration only
+    const elements: number[] = [];
+    for (const item of list) {
+      elements.push(item);
+    }
+    console.log(elements); // [10, 20, 30, 40];
+
+    console.log(list.length); // 4;
+```
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`unshift`](SinglyLinkedList.md#unshift)
+
+***
+
+### unshiftMany()
+
+```ts
+unshiftMany(elements): boolean[];
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:562](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L562)
+
+Prepend a sequence of elements/nodes.
+
+#### Parameters
+
+##### elements
+
+  \| `Iterable`\<`E`, `any`, `any`\>
+  \| `Iterable`\<`R`, `any`, `any`\>
+  \| `Iterable`\<[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>, `any`, `any`\>
+
+Iterable of elements or nodes (or raw records if toElementFn is provided).
+
+#### Returns
+
+`boolean`[]
+
+Array of per-element success flags.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`unshiftMany`](SinglyLinkedList.md#unshiftmany)
+
+***
+
+### values()
+
+```ts
+values(): IterableIterator<E>;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:71](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L71)
+
+Returns an iterator over the values (alias of the default iterator).
+
+#### Returns
+
+`IterableIterator`\<`E`\>
+
+An `IterableIterator<E>` over all elements.
+
+#### Remarks
+
+Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`values`](SinglyLinkedList.md#values)
+
+***
+
+### from()
+
+```ts
+static from<E, R, S>(
+   this, 
+   data, 
+   options?): S;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:281](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L281)
+
+Create a new list from an iterable of elements.
+
+#### Type Parameters
+
+##### E
+
+`E`
+
+##### R
+
+`R` = `any`
+
+##### S
+
+`S` *extends* [`SinglyLinkedList`](SinglyLinkedList.md)\<`E`, `R`\> = [`SinglyLinkedList`](SinglyLinkedList.md)\<`E`, `R`\>
+
+#### Parameters
+
+##### this
+
+`Object`
+
+The constructor (subclass) to instantiate.
+
+##### data
+
+`Iterable`\<`E`\>
+
+Iterable of elements to insert.
+
+##### options?
+
+`SinglyLinkedListOptions`\<`E`, `R`\>
+
+Options forwarded to the constructor.
+
+#### Returns
+
+`S`
+
+A new list populated with the iterable's elements.
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`from`](SinglyLinkedList.md#from)
+
+
+---
+
+## Protected Members
+
+### \_toElementFn?
+
+```ts
+protected optional _toElementFn?: (rawElement) => E;
+```
+
+Defined in: [data-structures/base/iterable-element-base.ts:38](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-element-base.ts#L38)
+
+The converter used to transform a raw element (`R`) into a public element (`E`).
+
+#### Parameters
+
+##### rawElement
+
+`R`
+
+#### Returns
+
+`E`
+
+#### Remarks
+
+Time O(1), Space O(1).
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_toElementFn`](SinglyLinkedList.md#_toelementfn)
+
+## Accessors
+
+### \_createInstance()
+
+```ts
+protected _createInstance(options?): this;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1473](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1473)
+
+(Protected) Create an empty instance of the same concrete class.
+
+#### Parameters
+
+##### options?
+
+`SinglyLinkedListOptions`\<`E`, `R`\>
+
+Options forwarded to the constructor.
+
+#### Returns
+
+`this`
+
+An empty like-kind list instance.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_createInstance`](SinglyLinkedList.md#_createinstance)
+
+***
+
+### \_createLike()
+
+```ts
+protected _createLike<EM, RM>(elements?, options?): SinglyLinkedList<EM, RM>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1491](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1491)
+
+(Protected) Create a like-kind instance and seed it from an iterable.
+
+#### Type Parameters
+
+##### EM
+
+`EM`
+
+##### RM
+
+`RM`
+
+#### Parameters
+
+##### elements?
+
+  \| `Iterable`\<`EM`, `any`, `any`\>
+  \| `Iterable`\<`RM`, `any`, `any`\>
+  \| `Iterable`\<[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`EM`\>, `any`, `any`\>
+
+Iterable used to seed the new list.
+
+##### options?
+
+`SinglyLinkedListOptions`\<`EM`, `RM`\>
+
+Options forwarded to the constructor.
+
+#### Returns
+
+[`SinglyLinkedList`](SinglyLinkedList.md)\<`EM`, `RM`\>
+
+A like-kind SinglyLinkedList instance.
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_createLike`](SinglyLinkedList.md#_createlike)
+
+***
+
+### \_ensureNode()
+
+```ts
+protected _ensureNode(elementOrNode): SinglyLinkedListNode<E>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1392](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1392)
+
+(Protected) Normalize input into a node instance.
+
+#### Parameters
+
+##### elementOrNode
+
+`E` \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+Element or node.
+
+#### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+A SinglyLinkedListNode for the provided input.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_ensureNode`](SinglyLinkedList.md#_ensurenode)
+
+***
+
+### \_ensurePredicate()
+
+```ts
+protected _ensurePredicate(elementNodeOrPredicate): (node) => boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1404](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1404)
+
+(Protected) Normalize input into a node predicate.
+
+#### Parameters
+
+##### elementNodeOrPredicate
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or predicate.
+
+#### Returns
+
+A predicate taking a node and returning true/false.
+
+(`node`) => `boolean`
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_ensurePredicate`](SinglyLinkedList.md#_ensurepredicate)
+
+***
+
+### \_getIterator()
+
+```ts
+protected _getIterator(): IterableIterator<E>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1433](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1433)
+
+(Protected) Iterate values from head to tail.
+
+#### Returns
+
+`IterableIterator`\<`E`\>
+
+Iterator of values (E).
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_getIterator`](SinglyLinkedList.md#_getiterator)
+
+***
+
+### \_getNodeIterator()
+
+```ts
+protected _getNodeIterator(): IterableIterator<SinglyLinkedListNode<E>>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1458](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1458)
+
+(Protected) Iterate nodes from head to tail.
+
+#### Returns
+
+`IterableIterator`\<[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>\>
+
+Iterator of nodes.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_getNodeIterator`](SinglyLinkedList.md#_getnodeiterator)
+
+***
+
+### \_getPrevNode()
+
+```ts
+protected _getPrevNode(node): SinglyLinkedListNode<E> | undefined;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1420](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1420)
+
+(Protected) Get the previous node of a given node.
+
+#### Parameters
+
+##### node
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+A node in the list.
+
+#### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\> \| `undefined`
+
+Previous node or undefined.
+
+#### Remarks
+
+Time O(N), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_getPrevNode`](SinglyLinkedList.md#_getprevnode)
+
+***
+
+### \_getReverseIterator()
+
+```ts
+protected _getReverseIterator(): IterableIterator<E>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1447](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1447)
+
+(Protected) Iterate values from tail to head.
+
+#### Returns
+
+`IterableIterator`\<`E`\>
+
+Iterator of values (E).
+
+#### Remarks
+
+Time O(N), Space O(N)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_getReverseIterator`](SinglyLinkedList.md#_getreverseiterator)
+
+***
+
+### \_isPredicate()
+
+```ts
+protected _isPredicate(elementNodeOrPredicate): elementNodeOrPredicate is (node: SinglyLinkedListNode<E>) => boolean;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1379](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1379)
+
+(Protected) Check if input is a node predicate function.
+
+#### Parameters
+
+##### elementNodeOrPredicate
+
+  \| `E`
+  \| [`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+  \| ((`node`) => `boolean`)
+
+Element, node, or node predicate.
+
+#### Returns
+
+`elementNodeOrPredicate is (node: SinglyLinkedListNode<E>) => boolean`
+
+True if input is a predicate function.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_isPredicate`](SinglyLinkedList.md#_ispredicate)
+
+***
+
+### \_spawnLike()
+
+```ts
+protected _spawnLike<EM, RM>(options?): SinglyLinkedList<EM, RM>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1511](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1511)
+
+(Protected) Spawn an empty like-kind list instance.
+
+#### Type Parameters
+
+##### EM
+
+`EM`
+
+##### RM
+
+`RM`
+
+#### Parameters
+
+##### options?
+
+`SinglyLinkedListOptions`\<`EM`, `RM`\>
+
+Options forwarded to the constructor.
+
+#### Returns
+
+[`SinglyLinkedList`](SinglyLinkedList.md)\<`EM`, `RM`\>
+
+An empty like-kind SinglyLinkedList instance.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`_spawnLike`](SinglyLinkedList.md#_spawnlike)
+
+***
+
+### createNode()
+
+```ts
+protected createNode(value): SinglyLinkedListNode<E>;
+```
+
+Defined in: [data-structures/linked-list/singly-linked-list.ts:1368](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/linked-list/singly-linked-list.ts#L1368)
+
+(Protected) Create a node from a value.
+
+#### Parameters
+
+##### value
+
+`E`
+
+Value to wrap in a node.
+
+#### Returns
+
+[`SinglyLinkedListNode`](SinglyLinkedListNode.md)\<`E`\>
+
+A new SinglyLinkedListNode instance.
+
+#### Remarks
+
+Time O(1), Space O(1)
+
+#### Inherited from
+
+[`SinglyLinkedList`](SinglyLinkedList.md).[`createNode`](SinglyLinkedList.md#createnode)
+
+***