data-structure-typed 0.8.18 → 1.3.0

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -2,659 +2,440 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
- * The class which represents one link or node in a linked list
- * ```ts
- * const node = new SinglyLinkedListNode(1, null, null, null);
- * ```
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 class SinglyLinkedListNode {
-    constructor(
-    /** Data stored on the node */
-    val, 
-    /** The previous node in the list */
-    prev, 
-    /** The next link in the list */
-    next, 
-    /** The list this node belongs to */
-    list) {
-        this.val = val;
-        this.prev = prev;
-        this.next = next;
-        this.list = list;
-    }
     /**
-     * Alias to .val
-     * ```ts
-     * new LinkedList(1, 2, 3).head.value; // 1
-     * ```
+     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
+     * @param {T} val - The "val" parameter is of type T, which means it can be any data type. It represents the value that
+     * will be stored in the node of a linked list.
      */
-    get value() {
-        return this.val;
+    constructor(val) {
+        this._val = val;
+        this._next = null;
     }
-    /**
-     * Get the index of this node
-     * ```ts
-     * new LinkedList(1, 2, 3).head.index; // 0
-     * ```
-     */
-    get index() {
-        if (!this.list) {
-            return undefined;
-        }
-        return this.list.findIndex((value) => value === this.value);
+    get val() {
+        return this._val;
     }
-    /**
-     * Insert a new node before this one
-     * ```ts
-     * new LinkedList(2, 3).head.insertBefore(1); // 1 <=> 2 <=> 3
-     * ```
-     * @param val Data to save in the node
-     */
-    insertBefore(val) {
-        return this.list !== null
-            ? this.list.insertBefore(this, val)
-            : new SinglyLinkedList(val, this.val);
+    set val(value) {
+        this._val = value;
     }
-    /**
-     * Insert new val after this node
-     * ```ts
-     * new LinkedList(1, 2).tail.insertAfter(3); // 1 <=> 2 <=> 3
-     * ```
-     * @param val Data to be saved in the node
-     */
-    insertAfter(val) {
-        return this.list !== null
-            ? this.list.insertAfter(this, val)
-            : new SinglyLinkedList(this.val, val);
+    get next() {
+        return this._next;
     }
-    /**
-     * Remove this node
-     * ```ts
-     * new LinkedList(1, 2, 3, 4).tail.remove(); // 1 <=> 2 <=> 3
-     * ```
-     */
-    remove() {
-        if (this.list === null) {
-            throw new ReferenceError('Node does not belong to any list');
-        }
-        return this.list.removeNode(this);
+    set next(value) {
+        this._next = value;
     }
 }
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
-/**
- * A doubly linked list
- * ```ts
- * const list = new LinkedList(1, 2, 3);
- * const listFromArray = LinkedList.from([1, 2, 3]);
- * ```
- */
 class SinglyLinkedList {
     /**
-     * The length of the list
+     * The constructor initializes the linked list with an empty head, tail, and length.
      */
-    get length() {
-        return this.size;
+    constructor() {
+        this._head = null;
+        this._tail = null;
+        this._length = 0;
     }
-    /**
-     * Convert any iterable to a new linked list
-     * ```javascript
-     * const array = [1, 2, 3];
-     * const list = LinkedList.from(array);
-     * ```
-     * @param iterable Any iterable datatype like Array or Map
-     */
-    static from(iterable) {
-        return new SinglyLinkedList(...iterable);
-    }
-    constructor(...args) {
-        this.head = null;
-        this.tail = null;
-        this.size = 0;
-        for (let i = 0; i < arguments.length; i++) {
-            this.append(args[i]);
-        }
+    get head() {
+        return this._head;
     }
-    /**
-     * Get the node val at a specified index, zero based
-     * ```ts
-     * new LinkedList(1, 2, 3).get(0); // 1
-     * ```
-     * @param index to retrieve val at
-     */
-    get(index) {
-        const node = this.getNode(index);
-        return node !== undefined ? node.val : undefined;
+    set head(value) {
+        this._head = value;
     }
-    /**
-     * Get the node at index, zero based
-     * ```ts
-     * new LinkedList(1, 2, 3).getNode(0);
-     * // { prev: null, val: 1, next: SinglyLinkedListNode }
-     * ```
-     */
-    getNode(index) {
-        if (this.head === null || index < 0 || index >= this.length) {
-            return undefined;
-        }
-        const asc = index < this.length / 2;
-        const stopAt = asc ? index : this.length - index - 1;
-        const nextNode = asc ? 'next' : 'prev';
-        let currentNode = asc ? this.head : this.tail;
-        // TODO after no-non-null-assertion not ensure the logic
-        for (let currentIndex = 0; currentIndex < stopAt; currentIndex++) {
-            if (currentNode) {
-                currentNode = currentNode[nextNode];
-            }
-        }
-        return currentNode || undefined;
+    get tail() {
+        return this._tail;
     }
-    /**
-     * Return the first node and its index in the list that
-     * satisfies the testing function
-     * ```ts
-     * new LinkedList(1, 2, 3).findNodeIndex(val => val === 1);
-     * // { node: SinglyLinkedListNode, index: 0 }
-     * ```
-     * @param f A function to be applied to the val of each node
-     */
-    findNodeIndex(f) {
-        let currentIndex = 0;
-        let currentNode = this.head;
-        while (currentNode) {
-            if (f(currentNode.val, currentIndex, this)) {
-                return {
-                    index: currentIndex,
-                    node: currentNode,
-                };
-            }
-            currentNode = currentNode.next;
-            currentIndex += 1;
-        }
-        return undefined;
+    set tail(value) {
+        this._tail = value;
     }
-    /**
-     * Returns the first node in the list that
-     * satisfies the provided testing function. Otherwise undefined is returned.
-     * ```ts
-     * new LinkedList(1, 2, 3).findNode(val => val === 1);
-     * // { prev: null, val: 1, next: SinglyLinkedListNode }
-     * ```
-     * @param f Function to test val against
-     */
-    findNode(f) {
-        const nodeIndex = this.findNodeIndex(f);
-        return nodeIndex !== undefined ? nodeIndex.node : undefined;
+    get length() {
+        return this._length;
     }
     /**
-     * Returns the value of the first element in the list that
-     * satisfies the provided testing function. Otherwise undefined is returned.
-     * ```ts
-     * new LinkedList(1, 2, 3).find(val => val === 1); // 1
-     * ```
-     * @param f Function to test val against
+     * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
+     * array.
+     * @param {T[]} data - The `data` parameter is an array of elements of type `T`.
+     * @returns The `fromArray` function returns a `SinglyLinkedList` object.
      */
-    find(f) {
-        const nodeIndex = this.findNodeIndex(f);
-        return nodeIndex !== undefined ? nodeIndex.node.val : undefined;
+    static fromArray(data) {
+        const singlyLinkedList = new SinglyLinkedList();
+        for (const item of data) {
+            singlyLinkedList.push(item);
+        }
+        return singlyLinkedList;
     }
-    /**
-     * Returns the index of the first node in the list that
-     * satisfies the provided testing function. Ohterwise -1 is returned.
-     * ```ts
-     * new LinkedList(1, 2, 3).findIndex(val => val === 3); // 2
-     * ```
-     * @param f Function to test val against
-     */
-    findIndex(f) {
-        const nodeIndex = this.findNodeIndex(f);
-        return nodeIndex !== undefined ? nodeIndex.index : -1;
+    getLength() {
+        return this._length;
     }
     /**
-     * Append one or any number of nodes to the end of the list.
-     * This modifies the list in place and returns the list itself
-     * to make this method chainable.
-     * ```ts
-     * new LinkedList(1).append(2).append(3, 4); // 1 <=> 2 <=> 3 <=> 4
-     * ```
-     * @param args Data to be stored in the node, takes any number of arguments
+     * The `push` function adds a new node with the given data to the end of a singly linked list.
+     * @param {T} data - The "data" parameter represents the value that you want to add to the linked list. It can be of
+     * any type (T) as specified in the generic type declaration of the class or function.
      */
-    append(...args) {
-        for (const val of args) {
-            const node = new SinglyLinkedListNode(val, this.tail, null, this);
-            if (this.head === null) {
-                this.head = node;
-            }
-            if (this.tail !== null) {
-                this.tail.next = node;
-            }
-            this.tail = node;
-            this.size += 1;
+    push(data) {
+        const newNode = new SinglyLinkedListNode(data);
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
         }
-        return this;
-    }
-    /**
-     * Synonym for append
-     * ```ts
-     * new LinkedList(1).push(2).push(3, 4); // 1 <=> 2 <=> 3 <=> 4
-     * ```
-     * @param args Data to be stored, takes any number of arguments
-     */
-    push(...args) {
-        this.append(...args);
-        return this.length;
+        else {
+            this.tail.next = newNode;
+            this.tail = newNode;
+        }
+        this._length++;
     }
     /**
-     * Prepend any number of val arguments to the list. The
-     * argument list is prepended as a block to reduce confusion:
-     * ```javascript
-     * new LinkedList(3, 4).prepend(0, 1, 2); // [0, 1, 2, 3, 4]
-     * ```
-     * @param args Data to be stored in the node, accepts any number of arguments
+     * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
+     * pointers accordingly.
+     * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
+     * the linked list is empty, it returns `null`.
      */
-    prepend(...args) {
-        const reverseArgs = Array.from(args).reverse();
-        for (const val of reverseArgs) {
-            const node = new SinglyLinkedListNode(val, null, this.head, this);
-            if (this.tail === null) {
-                this.tail = node;
-            }
-            if (this.head !== null) {
-                this.head.prev = node;
-            }
-            this.head = node;
-            this.size += 1;
+    pop() {
+        if (!this.head)
+            return undefined;
+        if (this.head === this.tail) {
+            const val = this.head.val;
+            this.head = null;
+            this.tail = null;
+            this._length--;
+            return val;
+        }
+        let current = this.head;
+        while (current.next !== this.tail) {
+            current = current.next;
         }
-        return this;
+        const val = this.tail.val;
+        current.next = null;
+        this.tail = current;
+        this._length--;
+        return val;
     }
     /**
-     * Insert a new node at a given index position. If index is
-     * out of bounds, the node is appended, if index is negative
-     * or 0, it will be prepended.
-     * ```ts
-     * new LinkedList(1, 3).insertAt(1, 2); // 1 <=> 2 <=> 3
-     * ```
-     * @param index The index to insert the new node at
-     * @param val Data to be stored on the new node
+     * The `shift()` function removes and returns the value of the first node in a linked list.
+     * @returns The value of the node that is being removed from the beginning of the linked list.
      */
-    insertAt(index, val) {
-        if (this.head === null) {
-            return this.append(val);
-        }
-        if (index <= 0) {
-            return this.prepend(val);
-        }
-        let currentNode = this.head;
-        let currentIndex = 0;
-        while (currentIndex < index - 1 && currentNode.next !== null) {
-            currentIndex += 1;
-            currentNode = currentNode.next;
-        }
-        currentNode.insertAfter(val);
-        return this;
+    shift() {
+        if (!this.head)
+            return undefined;
+        const removedNode = this.head;
+        this.head = this.head.next;
+        this._length--;
+        return removedNode.val;
     }
     /**
-     * Remove the specified node from the list and return the removed
-     * node afterwards.
-     * ```ts
-     * const list = new LinkedList(1, 2, 3);
-     * list.removeNode(list.tail); // { prev: null, val: 3, next: null, list: null }
-     * ```
-     * @param node The node to be removed
+     * The unshift function adds a new node with the given value to the beginning of a singly linked list.
+     * @param {T} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
+     * linked list.
      */
-    removeNode(node) {
-        if (node.list !== this) {
-            throw new ReferenceError('Node does not belong to this list');
-        }
-        if (node.prev !== null) {
-            node.prev.next = node.next;
+    unshift(val) {
+        const newNode = new SinglyLinkedListNode(val);
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
         }
-        if (node.next !== null) {
-            node.next.prev = node.prev;
-        }
-        if (this.head === node) {
-            this.head = node.next;
-        }
-        if (this.tail === node) {
-            this.tail = node.prev;
+        else {
+            newNode.next = this.head;
+            this.head = newNode;
         }
-        this.size -= 1;
-        node.next = null;
-        node.prev = null;
-        node.list = null;
-        return node;
+        this._length++;
     }
     /**
-     * Remove the node at the specified index
-     * ```ts
-     * new LinkedList(1, 2, 3).removeAt(2); // { prev: null, val: 3, next: null, list: null }
-     * ```
-     * @param index Index at which to remove
+     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
+     * @param {number} index - The index parameter is a number that represents the position of the element we want to
+     * retrieve from the list.
+     * @returns The method `getAt(index: number): T | null` returns the value at the specified index in the linked list, or
+     * `null` if the index is out of bounds.
      */
-    removeAt(index) {
-        const node = this.getNode(index);
-        return node !== undefined ? this.removeNode(node) : undefined;
+    getAt(index) {
+        if (index < 0 || index >= this.length)
+            return null;
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
+            current = current.next;
+        }
+        return current.val;
     }
     /**
-     * Insert a new node before the reference node
-     * ```ts
-     * const list = new LinkedList(1, 3);
-     * list.insertBefore(list.tail, 2); // 1 <=> 2 <=> 3
-     * ```
-     * @param referenceNode The node reference
-     * @param val Data to save in the node
+     * The function `getNodeAt` returns the node at a given index in a singly linked list.
+     * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
+     * retrieve from the linked list. It indicates the zero-based index of the node we want to access.
+     * @returns The method `getNodeAt(index: number)` returns a `SinglyLinkedListNode<T>` object if the node at the
+     * specified index exists, or `null` if the index is out of bounds.
      */
-    insertBefore(referenceNode, val) {
-        const node = new SinglyLinkedListNode(val, referenceNode.prev, referenceNode, this);
-        if (referenceNode.prev === null) {
-            this.head = node;
-        }
-        if (referenceNode.prev !== null) {
-            referenceNode.prev.next = node;
+    getNodeAt(index) {
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
+            current = current.next;
         }
-        referenceNode.prev = node;
-        this.size += 1;
-        return this;
+        return current;
     }
     /**
-     * Sorts the linked list using the provided compare function
-     * @param compare A function used to compare the val of two nodes. It should return
-     *                a boolean. True will insert a before b, false will insert b before a.
-     *                (a, b) => a < b or (1, 2) => 1 < 2 === true, 2 will be inserted after 1,
-     *                the sort order will be ascending.
+     * The `deleteAt` function removes an element at a specified index from a linked list and returns the removed element.
+     * @param {number} index - The index parameter represents the position of the element that needs to be deleted in the
+     * data structure. It is of type number.
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
+     * bounds.
      */
-    sort(compare) {
-        if (this.head === null || this.tail === null) {
-            return this;
-        }
-        if (this.length < 2) {
-            return this;
+    deleteAt(index) {
+        if (index < 0 || index >= this.length)
+            return undefined;
+        if (index === 0)
+            return this.shift();
+        if (index === this.length - 1)
+            return this.pop();
+        const prevNode = this.getNodeAt(index - 1);
+        const removedNode = prevNode.next;
+        prevNode.next = removedNode.next;
+        this._length--;
+        return removedNode.val;
+    }
+    /**
+     * The delete function removes a node with a specific value from a singly linked list.
+     * @param {T | SinglyLinkedListNode<T>} valueOrNode - The `valueOrNode` parameter can accept either a value of type `T`
+     * or a `SinglyLinkedListNode<T>` object.
+     * @returns The `delete` method returns a boolean value. It returns `true` if the value or node is found and
+     * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
+     */
+    delete(valueOrNode) {
+        let value;
+        if (valueOrNode instanceof SinglyLinkedListNode) {
+            value = valueOrNode.val;
         }
-        const quicksort = (start, end) => {
-            if (start === end) {
-                return;
-            }
-            const pivotData = end.val;
-            let current = start;
-            let split = start;
-            while (current && current !== end) {
-                const sort = compare(current.val, pivotData);
-                if (sort) {
-                    if (current !== split) {
-                        const temp = split.val;
-                        split.val = current.val;
-                        current.val = temp;
+        else {
+            value = valueOrNode;
+        }
+        let current = this.head, prev = null;
+        while (current) {
+            if (current.val === value) {
+                if (prev === null) {
+                    this.head = current.next;
+                    if (current === this.tail) {
+                        this.tail = null;
                     }
-                    // TODO after no-non-null-assertion not ensure the logic
-                    if (split.next) {
-                        split = split.next;
+                }
+                else {
+                    prev.next = current.next;
+                    if (current === this.tail) {
+                        this.tail = prev;
                     }
                 }
-                current = current.next;
-            }
-            end.val = split.val;
-            split.val = pivotData;
-            if (start.next === end.prev) {
-                return;
-            }
-            if (split.prev && split !== start) {
-                quicksort(start, split.prev);
-            }
-            if (split.next && split !== end) {
-                quicksort(split.next, end);
+                this._length--;
+                return true;
             }
-        };
-        quicksort(this.head, this.tail);
-        return this;
+            prev = current;
+            current = current.next;
+        }
+        return false;
     }
     /**
-     * Insert a new node after this one
-     * ```ts
-     * const list = new LinkedList(2, 3);
-     * list.insertAfter(list.head, 1); // 1 <=> 2 <=> 3
-     * ```
-     * @param referenceNode The reference node
-     * @param val Data to be saved in the node
+     * The `insertAt` function inserts a value at a specified index in a singly linked list.
+     * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
+     * linked list. It is of type number.
+     * @param {T} val - The `val` parameter represents the value that you want to insert into the linked list at the
+     * specified index.
+     * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
+     * if the index is out of bounds.
      */
-    insertAfter(referenceNode, val) {
-        const node = new SinglyLinkedListNode(val, referenceNode, referenceNode.next, this);
-        if (referenceNode.next === null) {
-            this.tail = node;
+    insertAt(index, val) {
+        if (index < 0 || index > this.length)
+            return false;
+        if (index === 0) {
+            this.unshift(val);
+            return true;
         }
-        if (referenceNode.next !== null) {
-            referenceNode.next.prev = node;
+        if (index === this.length) {
+            this.push(val);
+            return true;
         }
-        referenceNode.next = node;
-        this.size += 1;
-        return this;
+        const newNode = new SinglyLinkedListNode(val);
+        const prevNode = this.getNodeAt(index - 1);
+        newNode.next = prevNode.next;
+        prevNode.next = newNode;
+        this._length++;
+        return true;
     }
     /**
-     * Remove the first node from the list and return the val of the removed node
-     * or undefined
-     * ```ts
-     * new LinkedList(1, 2, 3).shift(); // 1
-     * ```
+     * The function checks if the length of a data structure is equal to zero and returns a boolean value indicating
+     * whether it is empty or not.
+     * @returns A boolean value indicating whether the length of the object is equal to 0.
      */
-    shift() {
-        return this.removeFromAnyEnd(this.head);
+    isEmpty() {
+        return this.length === 0;
     }
     /**
-     * Remove the last node from the list and return the val of the removed node
-     * or undefined if the list was empty
-     * ```ts
-     * new LinkedList(1, 2, 3).pop(); // 3
-     * ```
-     */
-    pop() {
-        return this.removeFromAnyEnd(this.tail);
-    }
-    /**
-     * Merge the current list with another. Both lists will be
-     * equal after merging.
-     * ```ts
-     * const list = new LinkedList(1, 2);
-     * const otherList = new LinkedList(3);
-     * list.merge(otherList);
-     * (list === otherList); // true
-     * ```
-     * @param list The list to be merged
-     */
-    merge(list) {
-        if (this.tail !== null) {
-            this.tail.next = list.head;
-        }
-        if (list.head !== null) {
-            list.head.prev = this.tail;
-        }
-        this.head = this.head || list.head;
-        this.tail = list.tail || this.tail;
-        this.size += list.size;
-        list.size = this.size;
-        list.head = this.head;
-        list.tail = this.tail;
-    }
-    /**
-     * Removes all nodes from a list
-     *
-     * ```ts
-     * list.clear();
-     * ```
+     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
      */
     clear() {
-        this.head = null;
-        this.tail = null;
-        this.size = 0;
-        return this;
+        this._head = null;
+        this._tail = null;
+        this._length = 0;
     }
     /**
-     * The slice() method returns a shallow copy of a
-     * portion of a list into a new list object selected
-     * from start to end (end not included).
-     * The original list will not be modified.
-     * ```ts
-     * const list = new LinkedList(1, 2, 3, 4, 5);
-     * const newList = list.slice(0, 3); // 1 <=> 2 <=> 3
-     * ```
-     * @param start Start index
-     * @param end End index, optional
+     * The `toArray` function converts a linked list into an array.
+     * @returns The `toArray()` method is returning an array of type `T[]`.
      */
-    // eslint-disable-next-line @typescript-eslint/ban-types
-    slice(start, end) {
-        const list = new SinglyLinkedList();
-        let finish = end;
-        if (this.head === null || this.tail === null) {
-            return list;
-        }
-        if (finish === undefined || finish < start) {
-            finish = this.length;
-        }
-        let head = this.getNode(start);
-        for (let i = 0; i < finish - start && head !== null && head !== undefined; i++) {
-            list.append(head.val);
-            head = head.next;
+    toArray() {
+        const array = [];
+        let current = this.head;
+        while (current) {
+            array.push(current.val);
+            current = current.next;
         }
-        return list;
+        return array;
     }
     /**
-     * The reverse() function reverses the list in place and returns the list
-     * itself.
-     * ```ts
-     * new LinkedList(1, 2, 3).reverse(); // 3 <=> 2 <=> 1
-     * ```
+     * The `reverse` function reverses the order of the nodes in a singly linked list.
+     * @returns The reverse() method does not return anything. It has a return type of void.
      */
     reverse() {
-        let currentNode = this.head;
-        while (currentNode) {
-            const next = currentNode.next;
-            currentNode.next = currentNode.prev;
-            currentNode.prev = next;
-            currentNode = currentNode.prev;
+        if (!this.head || this.head === this.tail)
+            return;
+        let prev = null;
+        let current = this.head;
+        let next = null;
+        while (current) {
+            next = current.next;
+            current.next = prev;
+            prev = current;
+            current = next;
+        }
+        [this.head, this.tail] = [this.tail, this.head];
+    }
+    /**
+     * The `find` function iterates through a linked list and returns the first element that satisfies a given condition.
+     * @param callback - A function that takes a value of type T as its parameter and returns a boolean value. This
+     * function is used to determine whether a particular value in the linked list satisfies a certain condition.
+     * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
+     * the callback function. If no element satisfies the condition, it returns `null`.
+     */
+    find(callback) {
+        let current = this.head;
+        while (current) {
+            if (callback(current.val)) {
+                return current.val;
+            }
+            current = current.next;
         }
-        const tail = this.tail;
-        this.tail = this.head;
-        this.head = tail;
-        return this;
+        return null;
     }
     /**
-     * The forEach() method executes a provided function once for each list node.
-     * ```ts
-     * new LinkedList(1, 2, 3).forEach(val => log(val)); // 1 2 3
-     * ```
-     * @param f Function to execute for each element, taking up to three arguments.
-     * @param reverse Indicates if the list should be walked in reverse order, default is false
+     * The `indexOf` function returns the index of the first occurrence of a given value in a linked list.
+     * @param {T} value - The value parameter is the value that you want to find the index of in the linked list.
+     * @returns The method is returning the index of the first occurrence of the specified value in the linked list. If the
+     * value is not found, it returns -1.
      */
-    forEach(f, reverse = false) {
-        let currentIndex = reverse ? this.length - 1 : 0;
-        let currentNode = reverse ? this.tail : this.head;
-        const modifier = reverse ? -1 : 1;
-        const nextNode = reverse ? 'prev' : 'next';
-        while (currentNode) {
-            f(currentNode.val, currentIndex, this);
-            currentNode = currentNode[nextNode];
-            currentIndex += modifier;
+    indexOf(value) {
+        let index = 0;
+        let current = this.head;
+        while (current) {
+            if (current.val === value) {
+                return index;
+            }
+            index++;
+            current = current.next;
         }
+        return -1;
     }
     /**
-     * The map() method creates a new list with the results of
-     * calling a provided function on every node in the calling list.
-     * ```ts
-     * new LinkedList(1, 2, 3).map(val => val + 10); // 11 <=> 12 <=> 13
-     * ```
-     * @param f Function that produces an node of the new list, taking up to three arguments
-     * @param reverse Indicates if the list should be mapped in reverse order, default is false
-     */
-    // eslint-disable-next-line @typescript-eslint/ban-types
-    map(f, reverse = false) {
-        const list = new SinglyLinkedList();
-        this.forEach((val, index) => list.append(f(val, index, this)), reverse);
-        return list;
-    }
-    /**
-     * The filter() method creates a new list with all nodes
-     * that pass the test implemented by the provided function.
-     * ```ts
-     * new LinkedList(1, 2, 3, 4, 5).filter(val => val < 4); // 1 <=> 2 <=> 3
-     * ```
-     * @param f Function to test each node val in the list. Return true to keep the node
-     * @param reverse Indicates if the list should be filtered in reverse order, default is false
+     * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
+     * null.
+     * @param {T} value - The value parameter is the value that we want to search for in the linked list.
+     * @returns a `SinglyLinkedListNode<T>` if a node with the specified value is found in the linked list. If no node with
+     * the specified value is found, the function returns `null`.
      */
-    // eslint-disable-next-line @typescript-eslint/ban-types
-    filter(f, reverse = false) {
-        const list = new SinglyLinkedList();
-        this.forEach((val, index) => {
-            if (f(val, index, this)) {
-                list.append(val);
+    findNode(value) {
+        let current = this.head;
+        while (current) {
+            if (current.val === value) {
+                return current;
             }
-        }, reverse);
-        return list;
+            current = current.next;
+        }
+        return null;
     }
     /**
-     * Reduce over each node in the list
-     * ```ts
-     * new LinkedList(1, 2, 3).reduce(n => n += 1, 0); // 3
-     * ```
-     * @param f A reducer function
-     * @param start An initial value
-     * @returns The final state of the accumulator
+     * The `insertBefore` function inserts a new value before an existing value in a singly linked list.
+     * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node that you want to insert the
+     * new value before. It can be either the value itself or a node containing the value in the linked list.
+     * @param {T} newValue - The `newValue` parameter represents the value that you want to insert into the linked list.
+     * @returns The method `insertBefore` returns a boolean value. It returns `true` if the new value was successfully
+     * inserted before the existing value, and `false` otherwise.
      */
-    reduce(f, start, reverse = false) {
-        let currentIndex = reverse ? this.length - 1 : 0;
-        const modifier = reverse ? -1 : 1;
-        const nextNode = reverse ? 'prev' : 'next';
-        let currentElement = reverse ? this.tail : this.head;
-        let result;
-        if (start !== undefined) {
-            result = start;
-        }
-        else if (currentElement) {
-            result = currentElement.val;
-            currentElement = currentElement[nextNode];
+    insertBefore(existingValueOrNode, newValue) {
+        if (!this.head)
+            return false;
+        let existingValue;
+        if (existingValueOrNode instanceof SinglyLinkedListNode) {
+            existingValue = existingValueOrNode.val;
         }
         else {
-            throw new TypeError('Reduce of empty LinkedList with no initial value');
-        }
-        while (currentElement) {
-            result = f(result, currentElement.val, currentIndex, this);
-            currentIndex += modifier;
-            currentElement = currentElement[nextNode];
+            existingValue = existingValueOrNode;
+        }
+        if (this.head.val === existingValue) {
+            this.unshift(newValue);
+            return true;
+        }
+        let current = this.head;
+        while (current.next) {
+            if (current.next.val === existingValue) {
+                const newNode = new SinglyLinkedListNode(newValue);
+                newNode.next = current.next;
+                current.next = newNode;
+                this._length++;
+                return true;
+            }
+            current = current.next;
         }
-        return result;
-    }
-    /**
-     * Convert the linked list to an array
-     * ```ts
-     * new LinkedList(1, 2, 3).toArray(); // [1, 2, 3]
-     * ```
-     */
-    toArray() {
-        return [...this];
+        return false;
     }
     /**
-     * Convert a linked list to string
-     * ```ts
-     * new LinkedList('one', 'two', 'three').toString(' <=> ') === 'one <=> two <=> three';
-     * ```
-     * @param separator Optional string to be placed in between val nodes, default is one space
+     * The `insertAfter` function inserts a new node with a given value after an existing node in a singly linked list.
+     * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node in the linked list after which
+     * the new value will be inserted. It can be either the value of the existing node or the existing node itself.
+     * @param {T} newValue - The value that you want to insert into the linked list after the existing value or node.
+     * @returns The method returns a boolean value. It returns true if the new value was successfully inserted after the
+     * existing value or node, and false if the existing value or node was not found in the linked list.
      */
-    toString(separator = ' ') {
-        return this.reduce((s, val) => `${s}${separator}${val}`);
+    insertAfter(existingValueOrNode, newValue) {
+        let existingNode;
+        if (existingValueOrNode instanceof SinglyLinkedListNode) {
+            existingNode = existingValueOrNode;
+        }
+        else {
+            existingNode = this.findNode(existingValueOrNode);
+        }
+        if (existingNode) {
+            const newNode = new SinglyLinkedListNode(newValue);
+            newNode.next = existingNode.next;
+            existingNode.next = newNode;
+            if (existingNode === this.tail) {
+                this.tail = newNode;
+            }
+            this._length++;
+            return true;
+        }
+        return false;
     }
     /**
-     * The iterator implementation
-     * ```ts
-     * const list = new LinkedList(1, 2, 3);
-     * for (const val of list) { log(val); } // 1 2 3
-     * ```
+     * The function counts the number of occurrences of a given value in a linked list.
+     * @param {T} value - The value parameter is the value that you want to count the occurrences of in the linked list.
+     * @returns The count of occurrences of the given value in the linked list.
      */
-    *[Symbol.iterator]() {
-        let element = this.head;
-        while (element !== null) {
-            yield element.val;
-            element = element.next;
+    countOccurrences(value) {
+        let count = 0;
+        let current = this.head;
+        while (current) {
+            if (current.val === value) {
+                count++;
+            }
+            current = current.next;
         }
-    }
-    /** Private helper function to reduce duplication of pop() and shift() methods */
-    removeFromAnyEnd(node) {
-        return node !== null ? this.removeNode(node).val : undefined;
+        return count;
     }
 }
 exports.SinglyLinkedList = SinglyLinkedList;