data-structure-typed 2.5.3 → 2.6.1

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -5,7 +5,6 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-
 import type { ElementCallback, SinglyLinkedListOptions } from '../../types';
 import { LinearLinkedBase, LinkedListNode } from '../base/linear-base';
 
@@ -21,7 +20,6 @@ export class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
    * @param value - Element value to store.
    * @returns New node instance.
    */
-
   constructor(value: E) {
     super(value);
     this._value = value;
@@ -35,7 +33,6 @@ export class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
    * @remarks Time O(1), Space O(1)
    * @returns Next node or undefined.
    */
-
   override get next(): SinglyLinkedListNode<E> | undefined {
     return this._next;
   }
@@ -46,7 +43,6 @@ export class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
    * @param value - Next node or undefined.
    * @returns void
    */
-
   override set next(value: SinglyLinkedListNode<E> | undefined) {
     this._next = value;
   }
@@ -192,8 +188,6 @@ export class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
  *     console.log(result); // [10, 20, 30];
  */
 export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, SinglyLinkedListNode<E>> {
-  protected _equals: (a: E, b: E) => boolean = (a, b) => Object.is(a, b);
-
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -201,7 +195,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options such as maxLen and toElementFn.
    * @returns New SinglyLinkedList instance.
    */
-
   constructor(
     elements: Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>> = [],
     options?: SinglyLinkedListOptions<E, R>
@@ -217,7 +210,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @returns Head node or undefined.
    */
-
   get head(): SinglyLinkedListNode<E> | undefined {
     return this._head;
   }
@@ -229,7 +221,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @returns Tail node or undefined.
    */
-
   get tail(): SinglyLinkedListNode<E> | undefined {
     return this._tail;
   }
@@ -241,7 +232,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @returns Current length.
    */
-
   get length(): number {
     return this._length;
   }
@@ -251,7 +241,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @returns First element or undefined.
    */
-
   get first(): E | undefined {
     return this.head?.value;
   }
@@ -261,7 +250,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @returns Last element or undefined.
    */
-
   get last(): E | undefined {
     return this.tail?.value;
   }
@@ -277,7 +265,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options forwarded to the constructor.
    * @returns A new list populated with the iterable's elements.
    */
-
   static from<E, R = any, S extends SinglyLinkedList<E, R> = SinglyLinkedList<E, R>>(
     this: new (
       elements?: Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>,
@@ -296,62 +283,22 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @param elementOrNode - Element or node to append.
    * @returns True when appended.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // 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];
+   * @example
+   * // 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];
    */
-
   push(elementOrNode: E | SinglyLinkedListNode<E>): boolean {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -369,62 +316,22 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Remove and return the tail element.
    * @remarks Time O(N), Space O(1)
    * @returns Removed element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // 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;
+   * @example
+   * // 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;
    */
-
   pop(): E | undefined {
     if (!this.head) return undefined;
     if (this.head === this.tail) {
@@ -447,52 +354,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Remove and return the head element.
    * @remarks Time O(1), Space O(1)
    * @returns Removed element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove from the front
- *  const list = new SinglyLinkedList<number>([10, 20, 30]);
- *     console.log(list.shift()); // 10;
- *     console.log(list.length); // 2;
+   * @example
+   * // Remove from the front
+   *  const list = new SinglyLinkedList<number>([10, 20, 30]);
+   *     console.log(list.shift()); // 10;
+   *     console.log(list.length); // 2;
    */
-
   shift(): E | undefined {
     if (!this.head) return undefined;
     const removed = this.head;
@@ -507,67 +374,27 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(1), Space O(1)
    * @param elementOrNode - Element or node to prepend.
    * @returns True when prepended.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // 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;
+   * @example
+   * // 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;
    */
-
   unshift(elementOrNode: E | SinglyLinkedListNode<E>): boolean {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -586,7 +413,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elements - Iterable of elements or nodes (or raw records if toElementFn is provided).
    * @returns Array of per-element success flags.
    */
-
   pushMany(elements: Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>): boolean[] {
     const ans: boolean[] = [];
     for (const el of elements) {
@@ -602,7 +428,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elements - Iterable of elements or nodes (or raw records if toElementFn is provided).
    * @returns Array of per-element success flags.
    */
-
   unshiftMany(elements: Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>): boolean[] {
     const ans: boolean[] = [];
     for (const el of elements) {
@@ -618,7 +443,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementNodeOrPredicate - Element, node, or node predicate to match.
    * @returns Matched value or undefined.
    */
-
   search(
     elementNodeOrPredicate: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean)
   ): E | undefined {
@@ -636,53 +460,13 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index.
    * @returns Element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // 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';
+   * @example
+   * // 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';
    */
-
   at(index: number): E | undefined {
     if (index < 0 || index >= this._length) return undefined;
     let current = this.head;
@@ -696,7 +480,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementNodeOrPredicate - Element, node, or predicate.
    * @returns True if the value is a SinglyLinkedListNode.
    */
-
   isNode(
     elementNodeOrPredicate: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean)
   ): elementNodeOrPredicate is SinglyLinkedListNode<E> {
@@ -708,48 +491,11 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index.
    * @returns Node or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Get node at index
- *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
- *     console.log(list.getNodeAt(1)?.value); // 'b';
+   * @example
+   * // Get node at index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     console.log(list.getNodeAt(1)?.value); // 'b';
    */
-
   getNodeAt(index: number): SinglyLinkedListNode<E> | undefined {
     if (index < 0 || index >= this._length) return undefined;
     let current = this.head;
@@ -762,49 +508,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index.
    * @returns Removed element or undefined.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove by index
- *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
- *     list.deleteAt(1);
- *     console.log(list.toArray()); // ['a', 'c'];
+   * @example
+   * // Remove by index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     list.deleteAt(1);
+   *     console.log(list.toArray()); // ['a', 'c'];
    */
-
   deleteAt(index: number): E | undefined {
     if (index < 0 || index >= this._length) return undefined;
     if (index === 0) return this.shift();
@@ -822,55 +531,17 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @param [elementOrNode] - Element or node to remove; if omitted/undefined, nothing happens.
    * @returns True if removed.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove first occurrence
- *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
- *     list.delete(2);
- *     console.log(list.toArray()); // [1, 3, 2];
+   * @example
+   * // Remove first occurrence
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
+   *     list.delete(2);
+   *     console.log(list.toArray()); // [1, 3, 2];
    */
-
   delete(elementOrNode: E | SinglyLinkedListNode<E> | undefined): boolean {
     if (elementOrNode === undefined || !this.head) return false;
     const node = this.isNode(elementOrNode) ? elementOrNode : this.getNode(elementOrNode);
     if (!node) return false;
     const prevNode = this._getPrevNode(node);
-
     if (!prevNode) {
       this._head = node.next;
       if (node === this.tail) this._tail = undefined;
@@ -888,49 +559,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param index - Zero-based index.
    * @param newElementOrNode - Element or node to insert.
    * @returns True if inserted.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Insert at index
- *  const list = new SinglyLinkedList<number>([1, 3]);
- *     list.addAt(1, 2);
- *     console.log(list.toArray()); // [1, 2, 3];
+   * @example
+   * // Insert at index
+   *  const list = new SinglyLinkedList<number>([1, 3]);
+   *     list.addAt(1, 2);
+   *     console.log(list.toArray()); // [1, 2, 3];
    */
-
   addAt(index: number, newElementOrNode: E | SinglyLinkedListNode<E>): boolean {
     if (index < 0 || index > this._length) return false;
     if (index === 0) return this.unshift(newElementOrNode);
@@ -950,7 +584,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param value - New value.
    * @returns True if updated.
    */
-
   setAt(index: number, value: E): boolean {
     const node = this.getNodeAt(index);
     if (!node) return false;
@@ -962,48 +595,10 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Check whether the list is empty.
    * @remarks Time O(1), Space O(1)
    * @returns True if length is 0.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Check empty
- *  console.log(new SinglyLinkedList().isEmpty()); // true;
+   * @example
+   * // Check empty
+   *  console.log(new SinglyLinkedList().isEmpty()); // true;
    */
-
   isEmpty(): boolean {
     return this._length === 0;
   }
@@ -1012,50 +607,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Remove all nodes and reset length.
    * @remarks Time O(N), Space O(1)
    * @returns void
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Remove all
- *  const list = new SinglyLinkedList<number>([1, 2, 3]);
- *     list.clear();
- *     console.log(list.isEmpty()); // true;
+   * @example
+   * // Remove all
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     list.clear();
+   *     console.log(list.isEmpty()); // true;
    */
-
   clear(): void {
     this._head = undefined;
     this._tail = undefined;
@@ -1066,52 +623,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Reverse the list in place.
    * @remarks Time O(N), Space O(1)
    * @returns This list.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Reverse the list in-place
- *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
- *     list.reverse();
- *     console.log([...list]); // [4, 3, 2, 1];
+   * @example
+   * // Reverse the list in-place
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
+   *     list.reverse();
+   *     console.log([...list]); // [4, 3, 2, 1];
    */
-
   reverse(): this {
     if (!this.head || this.head === this.tail) return this;
     let prev: SinglyLinkedListNode<E> | undefined;
@@ -1133,7 +650,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [elementNodeOrPredicate] - Element, node, or node predicate to match.
    * @returns Matching node or undefined.
    */
-
   getNode(
     elementNodeOrPredicate: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean) | undefined
   ): SinglyLinkedListNode<E> | undefined {
@@ -1155,7 +671,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param newElementOrNode - Element or node to insert.
    * @returns True if inserted.
    */
-
   addBefore(
     existingElementOrNode: E | SinglyLinkedListNode<E>,
     newElementOrNode: E | SinglyLinkedListNode<E>
@@ -1164,7 +679,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
     if (!existingNode) return false;
     const prevNode = this._getPrevNode(existingNode);
     const newNode = this._ensureNode(newElementOrNode);
-
     if (!prevNode) {
       newNode.next = this._head;
       this._head = newNode;
@@ -1185,7 +699,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param newElementOrNode - Element or node to insert.
    * @returns True if inserted.
    */
-
   addAfter(existingElementOrNode: E | SinglyLinkedListNode<E>, newElementOrNode: E | SinglyLinkedListNode<E>): boolean {
     const existingNode = this.getNode(existingElementOrNode);
     if (!existingNode) return false;
@@ -1205,16 +718,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [items] - Elements to insert after `start`.
    * @returns A new list containing the removed elements (typed as `this`).
    */
-
   override splice(start: number, deleteCount = 0, ...items: E[]): this {
     start = Math.max(0, Math.min(start, this.length));
     deleteCount = Math.max(0, deleteCount);
-
     const removedList = this._createInstance();
-
     const prevNode = start === 0 ? undefined : this.getNodeAt(start - 1);
     let cur = prevNode ? prevNode.next : this.head;
-
     let removedCount = 0;
     while (removedCount < deleteCount && cur) {
       removedList.push(cur.value);
@@ -1222,14 +731,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
       removedCount++;
     }
     const afterNode = cur;
-
     if (prevNode) {
       prevNode.next = afterNode;
     } else {
       this._head = afterNode;
     }
     if (!afterNode) this._tail = prevNode;
-
     if (items.length > 0) {
       let firstInserted: SinglyLinkedListNode<E> | undefined;
       let lastInserted: SinglyLinkedListNode<E> | undefined;
@@ -1241,17 +748,14 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
       }
       if (prevNode) prevNode.next = firstInserted!;
       else this._head = firstInserted!;
-
       lastInserted!.next = afterNode;
       if (!afterNode) this._tail = lastInserted!;
     }
-
     this._length += items.length - removedCount;
     if (this._length === 0) {
       this._head = undefined;
       this._tail = undefined;
     }
-
     return removedList as unknown as this;
   }
 
@@ -1261,7 +765,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementOrNode - Element, node, or node predicate to match.
    * @returns Number of matches in the list.
    */
-
   countOccurrences(elementOrNode: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean)): number {
     const predicate = elementOrPredicate(elementOrNode, this._equals);
     let count = 0;
@@ -1279,7 +782,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param equals - Equality predicate (a, b) → boolean.
    * @returns This list.
    */
-
   setEquality(equals: (a: E, b: E) => boolean): this {
     this._equals = equals;
     return this;
@@ -1291,7 +793,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param predicate - Predicate (value, index, list) → boolean to decide deletion.
    * @returns True if a node was removed.
    */
-
   deleteWhere(predicate: (value: E, index: number, list: this) => boolean): boolean {
     let prev: SinglyLinkedListNode<E> | undefined;
     let current = this.head;
@@ -1318,52 +819,14 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * Deep clone this list (values are copied by reference).
    * @remarks Time O(N), Space O(N)
    * @returns A new list with the same element sequence.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Deep copy
- *  const list = new SinglyLinkedList<number>([1, 2, 3]);
- *     const copy = list.clone();
- *     copy.pop();
- *     console.log(list.length); // 3;
- *     console.log(copy.length); // 2;
+   * @example
+   * // Deep copy
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const copy = list.clone();
+   *     copy.pop();
+   *     console.log(list.length); // 3;
+   *     console.log(copy.length); // 2;
    */
-
   clone(): this {
     const out = this._createInstance();
     for (const v of this) out.push(v);
@@ -1376,62 +839,22 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param callback - Predicate (value, index, list) → boolean to keep value.
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new list with kept values.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // 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;
+   * @example
+   * // 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;
    */
-
   filter(callback: ElementCallback<E, R, boolean>, thisArg?: unknown): this {
     const out = this._createInstance();
     let index = 0;
@@ -1446,7 +869,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new list with mapped values.
    */
-
   mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this {
     const out = this._createInstance();
     let index = 0;
@@ -1466,52 +888,12 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new SinglyLinkedList with mapped values.
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-   
-    * @example
- * // Transform elements
- *  const list = new SinglyLinkedList<number>([1, 2, 3]);
- *     const doubled = list.map(n => n * 2);
- *     console.log([...doubled]); // [2, 4, 6];
+   * @example
+   * // Transform elements
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const doubled = list.map(n => n * 2);
+   *     console.log([...doubled]); // [2, 4, 6];
    */
-
   map<EM, RM = any>(
     callback: ElementCallback<E, R, EM>,
     options?: SinglyLinkedListOptions<EM, RM>,
@@ -1523,13 +905,14 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
     return out;
   }
 
+  protected _equals: (a: E, b: E) => boolean = (a, b) => Object.is(a, b);
+
   /**
    * (Protected) Create a node from a value.
    * @remarks Time O(1), Space O(1)
    * @param value - Value to wrap in a node.
    * @returns A new SinglyLinkedListNode instance.
    */
-
   protected createNode(value: E): SinglyLinkedListNode<E> {
     return new SinglyLinkedListNode<E>(value);
   }
@@ -1540,7 +923,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementNodeOrPredicate - Element, node, or node predicate.
    * @returns True if input is a predicate function.
    */
-
   protected _isPredicate(
     elementNodeOrPredicate: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean)
   ): elementNodeOrPredicate is (node: SinglyLinkedListNode<E>) => boolean {
@@ -1553,7 +935,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementOrNode - Element or node.
    * @returns A SinglyLinkedListNode for the provided input.
    */
-
   protected _ensureNode(elementOrNode: E | SinglyLinkedListNode<E>) {
     if (this.isNode(elementOrNode)) return elementOrNode;
     return this.createNode(elementOrNode);
@@ -1565,7 +946,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param elementNodeOrPredicate - Element, node, or predicate.
    * @returns A predicate taking a node and returning true/false.
    */
-
   protected _ensurePredicate(
     elementNodeOrPredicate: E | SinglyLinkedListNode<E> | ((node: SinglyLinkedListNode<E>) => boolean)
   ) {
@@ -1581,7 +961,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param node - A node in the list.
    * @returns Previous node or undefined.
    */
-
   protected _getPrevNode(node: SinglyLinkedListNode<E>): SinglyLinkedListNode<E> | undefined {
     if (!this.head || this.head === node) return undefined;
     let current = this.head;
@@ -1594,7 +973,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @returns Iterator of values (E).
    */
-
   protected *_getIterator(): IterableIterator<E> {
     let current = this.head;
     while (current) {
@@ -1608,7 +986,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(N)
    * @returns Iterator of values (E).
    */
-
   protected *_getReverseIterator(): IterableIterator<E> {
     const reversedArr = [...this].reverse();
     for (const item of reversedArr) yield item;
@@ -1619,7 +996,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @remarks Time O(N), Space O(1)
    * @returns Iterator of nodes.
    */
-
   protected *_getNodeIterator(): IterableIterator<SinglyLinkedListNode<E>> {
     let current = this.head;
     while (current) {
@@ -1634,7 +1010,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options forwarded to the constructor.
    * @returns An empty like-kind list instance.
    */
-
   protected _createInstance(options?: SinglyLinkedListOptions<E, R>): this {
     const Ctor = this.constructor as new (
       elements?: Iterable<E> | Iterable<R> | Iterable<SinglyLinkedListNode<E>>,
@@ -1652,7 +1027,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options forwarded to the constructor.
    * @returns A like-kind SinglyLinkedList instance.
    */
-
   protected _createLike<EM, RM>(
     elements: Iterable<EM> | Iterable<RM> | Iterable<SinglyLinkedListNode<EM>> = [],
     options?: SinglyLinkedListOptions<EM, RM>
@@ -1672,7 +1046,6 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @param [options] - Options forwarded to the constructor.
    * @returns An empty like-kind SinglyLinkedList instance.
    */
-
   protected _spawnLike<EM, RM>(options?: SinglyLinkedListOptions<EM, RM>): SinglyLinkedList<EM, RM> {
     return this._createLike<EM, RM>([], options);
   }