data-structure-typed 0.8.18 → 1.3.0

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

@@ -1,259 +1,526 @@
 "use strict";
-// 操作      常见名称       Ada           Java        JavaScript     C++          Python      Perl       PHP             Ruby
-// 尾部插入   inject, snoc Append         offerLast   push          push_back    append      push        array_push      push
-// 头部插入   push, cons   Prepend        offerFirst  unshift       push_front   appendleft  unshift     array_unshift   unshift
-// 尾部删除   eject        Delete_Last    pollLast    pop           pop_back     pop         pop         array_pop       pop
-// 头部删除   pop          Delete_First   pollFirst   shift         pop_front    popleft     shift       array_shift     shift
-// 查看尾部                Last_Element   peekLast    [length - 1]  back         [-1]        $array[-1]  end             last
-// 查看头部                First_Element  peekFirst   [0]           front        [0]         $array[0]   reset           first
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 class DoublyLinkedListNode {
-    constructor(nodeValue) {
-        this.val = nodeValue;
-        this.next = null;
-        this.prev = null;
+    /**
+     * The constructor function initializes the value, next, and previous properties of an object.
+     * @param {T} val - The "val" parameter is the value that will be stored in the node. It can be of any data type, as it
+     * is defined as a generic type "T".
+     */
+    constructor(val) {
+        this._val = val;
+        this._next = null;
+        this._prev = null;
+    }
+    get val() {
+        return this._val;
+    }
+    set val(value) {
+        this._val = value;
+    }
+    get next() {
+        return this._next;
+    }
+    set next(value) {
+        this._next = value;
+    }
+    get prev() {
+        return this._prev;
+    }
+    set prev(value) {
+        this._prev = value;
     }
 }
 exports.DoublyLinkedListNode = DoublyLinkedListNode;
 class DoublyLinkedList {
+    /**
+     * The constructor initializes the linked list with an empty head, tail, and length.
+     */
     constructor() {
-        this._first = null;
-        this._last = null;
-        this._size = 0;
-        // --- end extra methods ---
+        this._head = null;
+        this._tail = null;
+        this._length = 0;
+    }
+    get head() {
+        return this._head;
+    }
+    set head(value) {
+        this._head = value;
     }
-    get size() {
-        return this._size;
+    get tail() {
+        return this._tail;
     }
-    set size(v) {
-        this._size = v;
+    set tail(value) {
+        this._tail = value;
+    }
+    get length() {
+        return this._length;
     }
     /**
-     * Adds a node at the beginning of the linked list
-     * @param val Value to be stored at the beginning of the linked list
+     * The `fromArray` function creates a new instance of a DoublyLinkedList 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 DoublyLinkedList object.
      */
-    offerFirst(val) {
-        const newNode = new DoublyLinkedListNode(val);
-        if (this._size === 0) {
-            this._first = newNode;
-            this._last = newNode;
-        }
-        else {
-            if (this._first)
-                this._first.prev = newNode;
-            newNode.next = this._first;
-            this._first = newNode;
+    static fromArray(data) {
+        const doublyLinkedList = new DoublyLinkedList();
+        for (const item of data) {
+            doublyLinkedList.push(item);
         }
-        this._size++;
-        return true;
+        return doublyLinkedList;
     }
     /**
-     * Adds a node to the end of the linked list
-     * @param val Value to be stored in the Doubly linked list node
+     * The push function adds a new node with the given value to the end of the doubly linked list.
+     * @param {T} val - The value to be added to the linked list.
      */
-    offerLast(val) {
+    push(val) {
         const newNode = new DoublyLinkedListNode(val);
-        if (this._size === 0) {
-            this._first = newNode;
-            this._last = newNode;
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
         }
         else {
-            if (this._last)
-                this._last.next = newNode;
-            newNode.prev = this._last;
-            this._last = newNode;
-        }
-        this._size++;
-        return true;
-    }
-    peekFirst(by) {
-        var _a, _b, _c, _d, _e;
-        switch (by) {
-            case 'node':
-                return (_a = this._first) !== null && _a !== void 0 ? _a : null;
-            case 'val':
-                return (_c = (_b = this._first) === null || _b === void 0 ? void 0 : _b.val) !== null && _c !== void 0 ? _c : null;
-            default:
-                return (_e = (_d = this._first) === null || _d === void 0 ? void 0 : _d.val) !== null && _e !== void 0 ? _e : null;
-        }
-    }
-    peekLast(by = 'val') {
-        var _a, _b, _c, _d, _e;
-        switch (by) {
-            case 'node':
-                return (_a = this._last) !== null && _a !== void 0 ? _a : null;
-            case 'val':
-                return (_c = (_b = this._last) === null || _b === void 0 ? void 0 : _b.val) !== null && _c !== void 0 ? _c : null;
-            default:
-                return (_e = (_d = this._last) === null || _d === void 0 ? void 0 : _d.val) !== null && _e !== void 0 ? _e : null;
+            newNode.prev = this.tail;
+            this.tail.next = newNode;
+            this.tail = newNode;
         }
+        this._length++;
     }
     /**
-     * Removes a node form the beginning of the linked list and will return the node val
+     * The `pop()` function removes and returns the value of the last node in a doubly linked list.
+     * @returns The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the
+     * list is empty, it returns null.
      */
-    pollFirst(by = 'val') {
-        var _a, _b, _c;
-        if (this._size === 0)
+    pop() {
+        if (!this.tail)
             return null;
-        const oldHead = this._first;
-        if (this._size === 1) {
-            this._first = null;
-            this._last = null;
+        const removedNode = this.tail;
+        if (this.head === this.tail) {
+            this.head = null;
+            this.tail = null;
         }
         else {
-            this._first = (_a = oldHead === null || oldHead === void 0 ? void 0 : oldHead.next) !== null && _a !== void 0 ? _a : null;
-            if (this._first)
-                this._first.prev = null;
-            if (oldHead)
-                oldHead.next = null;
-        }
-        this._size--;
-        switch (by) {
-            case 'node':
-                return oldHead !== null && oldHead !== void 0 ? oldHead : null;
-            case 'val':
-                return (_b = oldHead === null || oldHead === void 0 ? void 0 : oldHead.val) !== null && _b !== void 0 ? _b : null;
-            default:
-                return (_c = oldHead === null || oldHead === void 0 ? void 0 : oldHead.val) !== null && _c !== void 0 ? _c : null;
+            this.tail = removedNode.prev;
+            this.tail.next = null;
         }
+        this._length--;
+        return removedNode.val;
     }
     /**
-     * Removes a node at the end of the linked list and will return the node value
+     * The `shift()` function removes and returns the value of the first node in a doubly linked list.
+     * @returns The method `shift()` returns the value of the node that is removed from the beginning of the doubly linked
+     * list.
      */
-    pollLast(by = 'val') {
-        var _a, _b, _c;
-        if (this._size === 0)
+    shift() {
+        if (!this.head)
             return null;
-        const polled = this._last;
-        if (this._size === 1) {
-            this._first = null;
-            this._last = null;
+        const removedNode = this.head;
+        if (this.head === this.tail) {
+            this.head = null;
+            this.tail = null;
         }
         else {
-            this._last = (_a = polled === null || polled === void 0 ? void 0 : polled.prev) !== null && _a !== void 0 ? _a : null;
-            if (this._last)
-                this._last.next = null;
-            if (polled)
-                polled.prev = null;
-        }
-        this._size--;
-        switch (by) {
-            case 'node':
-                return polled !== null && polled !== void 0 ? polled : null;
-            case 'val':
-                return (_b = polled === null || polled === void 0 ? void 0 : polled.val) !== null && _b !== void 0 ? _b : null;
-            default:
-                return (_c = polled === null || polled === void 0 ? void 0 : polled.val) !== null && _c !== void 0 ? _c : null;
+            this.head = removedNode.next;
+            this.head.prev = null;
         }
+        this._length--;
+        return removedNode.val;
     }
     /**
-     * Returns the node at the specified index of the linked list.
-     * If index = 0; first element in the list is returned.
-     * If index = 3; fourth element in the list is returned.
-     * @param index Index of the node to be retrieved
-     * @param by Return value type
+     * The unshift function adds a new node with the given value to the beginning of a doubly linked list.
+     * @param {T} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
+     * doubly linked list.
      */
-    get(index, by = 'val') {
-        var _a, _b;
-        if (index < 0 || index >= this._size)
-            return null;
-        let count, current;
-        if (index <= this._size / 2) {
-            count = 0;
-            current = this._first;
-            while (count !== index) {
-                current = current === null || current === void 0 ? void 0 : current.next;
-                count++;
-            }
+    unshift(val) {
+        const newNode = new DoublyLinkedListNode(val);
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
         }
         else {
-            count = this._size - 1;
-            current = this._last;
-            while (count !== index) {
-                current = current === null || current === void 0 ? void 0 : current.prev;
-                count--;
-            }
+            newNode.next = this.head;
+            this.head.prev = newNode;
+            this.head = newNode;
         }
-        switch (by) {
-            case 'node':
-                return current !== null && current !== void 0 ? current : null;
-            case 'val':
-                return (_a = current === null || current === void 0 ? void 0 : current.val) !== null && _a !== void 0 ? _a : null;
-            default:
-                return (_b = current === null || current === void 0 ? void 0 : current.val) !== null && _b !== void 0 ? _b : null;
+        this._length++;
+    }
+    /**
+     * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
+     * @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 is returning the value at the specified index in the linked list. If the index is out of bounds
+     * or the linked list is empty, it will return null.
+     */
+    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;
     }
     /**
-     * Updates the value of the node at the specified index.
-     * If index = 0; Value of the first element in the list is updated.
-     * If index = 3; Value of the fourth element in the list is updated.
-     * @param index Index of the node to be updated
-     * @param val New value of the node
+     * The function `getNodeAt` returns the node at a given index in a doubly 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 node we want to
+     * retrieve from the doubly linked list. It indicates the zero-based index of the node we want to access.
+     * @returns The method `getNodeAt(index: number)` returns a `DoublyLinkedListNode<T>` object if the index is within the
+     * valid range of the linked list, otherwise it returns `null`.
      */
-    set(index, val) {
-        const foundNode = this.get(index, 'node');
-        if (foundNode !== null) {
-            foundNode.val = val;
-            return true;
+    getNodeAt(index) {
+        if (index < 0 || index >= this.length)
+            return null;
+        let current = this.head;
+        for (let i = 0; i < index; i++) {
+            current = current.next;
         }
-        return false;
+        return current;
     }
-    isEmpty() {
-        return this._size === 0;
+    /**
+     * The function `findNodeByValue` searches for a node with a specific value in a doubly linked list and returns the
+     * node if found, otherwise it returns null.
+     * @param {T} val - The `val` parameter is the value that we want to search for in the doubly linked list.
+     * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<T>` if a node with the specified value `val`
+     * is found in the linked list. If no such node is found, it returns `null`.
+     */
+    findNode(val) {
+        let current = this.head;
+        while (current) {
+            if (current.val === val) {
+                return current;
+            }
+            current = current.next;
+        }
+        return null;
     }
-    // --- start extra methods ---
     /**
-     * Inserts a new node at the specified index.
-     * @param index Index at which the new node has to be inserted
-     * @param val Value of the new node to be inserted
+     * The `insert` function inserts a value at a specified index in a doubly linked list.
+     * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
+     * DoublyLinkedList. It is of type number.
+     * @param {T} val - The `val` parameter represents the value that you want to insert into the Doubly 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.
      */
-    insert(index, val) {
-        if (index < 0 || index > this._size)
+    insertAt(index, val) {
+        if (index < 0 || index > this.length)
             return false;
-        if (index === 0)
-            return !!this.offerFirst(val);
-        if (index === this._size)
-            return !!this.offerLast(val);
+        if (index === 0) {
+            this.unshift(val);
+            return true;
+        }
+        if (index === this.length) {
+            this.push(val);
+            return true;
+        }
         const newNode = new DoublyLinkedListNode(val);
-        const prevNode = this.get(index - 1, 'node');
-        const nextNode = prevNode === null || prevNode === void 0 ? void 0 : prevNode.next;
-        if (prevNode)
-            prevNode.next = newNode;
+        const prevNode = this.getNodeAt(index - 1);
+        const nextNode = prevNode.next;
         newNode.prev = prevNode;
-        newNode.next = nextNode !== null && nextNode !== void 0 ? nextNode : null;
-        if (nextNode)
-            nextNode.prev = newNode;
-        this._size++;
+        newNode.next = nextNode;
+        prevNode.next = newNode;
+        nextNode.prev = newNode;
+        this._length++;
         return true;
     }
     /**
-     * Removes a node at the specified index and returns its value.
-     * @param index Index at which the node has to be removed.
+     * 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.
      */
-    remove(index) {
-        var _a, _b, _c;
-        if (index < 0 || index > this._size - 1)
+    deleteAt(index) {
+        if (index < 0 || index >= this.length)
             return null;
-        else if (index === 0)
-            return this.pollFirst();
-        else if (index === this._size - 1)
-            return (_b = (_a = this.pollLast('node')) === null || _a === void 0 ? void 0 : _a.val) !== null && _b !== void 0 ? _b : null;
+        if (index === 0)
+            return this.shift();
+        if (index === this.length - 1)
+            return this.pop();
+        const removedNode = this.getNodeAt(index);
+        const prevNode = removedNode.prev;
+        const nextNode = removedNode.next;
+        prevNode.next = nextNode;
+        nextNode.prev = prevNode;
+        this._length--;
+        return removedNode.val;
+    }
+    /**
+     * The `delete` function removes a node from a doubly linked list based on either the node itself or its value.
+     * @param {T | DoublyLinkedListNode<T>} valOrNode - The `valOrNode` parameter can accept either a value of type `T` or
+     * a `DoublyLinkedListNode<T>` object.
+     * @returns The `delete` method returns a boolean value. It returns `true` if the value or node was successfully
+     * deleted from the doubly linked list, and `false` if the value or node was not found in the list.
+     */
+    delete(valOrNode) {
+        let node;
+        if (valOrNode instanceof DoublyLinkedListNode) {
+            node = valOrNode;
+        }
         else {
-            const prevNode = this.get(index - 1, 'node');
-            const removeNode = prevNode === null || prevNode === void 0 ? void 0 : prevNode.next;
-            const nextNode = removeNode === null || removeNode === void 0 ? void 0 : removeNode.next;
-            if (prevNode)
-                prevNode.next = nextNode !== null && nextNode !== void 0 ? nextNode : null;
-            if (nextNode)
+            node = this.findNode(valOrNode);
+        }
+        if (node) {
+            if (node === this.head) {
+                this.shift();
+            }
+            else if (node === this.tail) {
+                this.pop();
+            }
+            else {
+                const prevNode = node.prev;
+                const nextNode = node.next;
+                prevNode.next = nextNode;
                 nextNode.prev = prevNode;
-            if (removeNode)
-                removeNode.next = null;
-            if (removeNode)
-                removeNode.prev = null;
-            this._size--;
-            return (_c = removeNode === null || removeNode === void 0 ? void 0 : removeNode.val) !== null && _c !== void 0 ? _c : null;
+                this._length--;
+            }
+            return true;
+        }
+        return false;
+    }
+    /**
+     * The `toArray` function converts a linked list into an array.
+     * @returns The `toArray()` method is returning an array of type `T[]`.
+     */
+    toArray() {
+        const array = [];
+        let current = this.head;
+        while (current) {
+            array.push(current.val);
+            current = current.next;
+        }
+        return array;
+    }
+    /**
+     * 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._length = 0;
+    }
+    /**
+     * 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;
+        }
+        return null;
+    }
+    /**
+     * The function returns the index of the first occurrence of a given value in a linked list.
+     * @param {T} val - The parameter `val` is of type `T`, which means it can be any data type. It represents the value
+     * that we are searching for in the linked list.
+     * @returns The method `indexOf` returns the index of the first occurrence of the specified value `val` in the linked
+     * list. If the value is not found, it returns -1.
+     */
+    indexOf(val) {
+        let index = 0;
+        let current = this.head;
+        while (current) {
+            if (current.val === val) {
+                return index;
+            }
+            index++;
+            current = current.next;
+        }
+        return -1;
+    }
+    /**
+     * The `findLast` function iterates through a linked list from the last node to the first node and returns the last
+     * value that satisfies the given callback function, or null if no value satisfies the callback.
+     * @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 given value satisfies a certain condition.
+     * @returns The method `findLast` returns the last value in the linked list that satisfies the condition specified by
+     * the callback function. If no value satisfies the condition, it returns `null`.
+     */
+    findLast(callback) {
+        let current = this.tail;
+        while (current) {
+            if (callback(current.val)) {
+                return current.val;
+            }
+            current = current.prev;
         }
+        return null;
+    }
+    /**
+     * The `toArrayReverse` function converts a doubly linked list into an array in reverse order.
+     * @returns The `toArrayReverse()` function returns an array of type `T[]`.
+     */
+    toArrayReverse() {
+        const array = [];
+        let current = this.tail;
+        while (current) {
+            array.push(current.val);
+            current = current.prev;
+        }
+        return array;
+    }
+    /**
+     * The `reverse` function reverses the order of the elements in a doubly linked list.
+     */
+    reverse() {
+        let current = this.head;
+        [this.head, this.tail] = [this.tail, this.head];
+        while (current) {
+            const next = current.next;
+            [current.prev, current.next] = [current.next, current.prev];
+            current = next;
+        }
+    }
+    /**
+     * The `forEach` function iterates over each element in a linked list and applies a callback function to each element.
+     * @param callback - The callback parameter is a function that takes two arguments: val and index. The val argument
+     * represents the value of the current node in the linked list, and the index argument represents the index of the
+     * current node in the linked list.
+     */
+    forEach(callback) {
+        let current = this.head;
+        let index = 0;
+        while (current) {
+            callback(current.val, index);
+            current = current.next;
+            index++;
+        }
+    }
+    /**
+     * The `map` function takes a callback function and applies it to each element in the DoublyLinkedList, returning a new
+     * DoublyLinkedList with the transformed values.
+     * @param callback - The callback parameter is a function that takes a value of type T (the type of values stored in
+     * the original DoublyLinkedList) and returns a value of type U (the type of values that will be stored in the mapped
+     * DoublyLinkedList).
+     * @returns The `map` function is returning a new instance of `DoublyLinkedList<U>` that contains the mapped values.
+     */
+    map(callback) {
+        const mappedList = new DoublyLinkedList();
+        let current = this.head;
+        while (current) {
+            mappedList.push(callback(current.val));
+            current = current.next;
+        }
+        return mappedList;
+    }
+    /**
+     * The `filter` function iterates through a DoublyLinkedList and returns a new DoublyLinkedList containing only the
+     * elements that satisfy the given callback function.
+     * @param callback - The `callback` parameter is a function that takes a value of type `T` and returns a boolean value.
+     * It is used to determine whether a value should be included in the filtered list or not.
+     * @returns The filtered list, which is an instance of the DoublyLinkedList class.
+     */
+    filter(callback) {
+        const filteredList = new DoublyLinkedList();
+        let current = this.head;
+        while (current) {
+            if (callback(current.val)) {
+                filteredList.push(current.val);
+            }
+            current = current.next;
+        }
+        return filteredList;
+    }
+    /**
+     * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
+     * single value.
+     * @param callback - The `callback` parameter is a function that takes two arguments: `accumulator` and `val`. It is
+     * used to perform a specific operation on each element of the linked list.
+     * @param {U} initialValue - The `initialValue` parameter is the initial value of the accumulator. It is the starting
+     * point for the reduction operation.
+     * @returns The `reduce` method is returning the final value of the accumulator after iterating through all the
+     * elements in the linked list.
+     */
+    reduce(callback, initialValue) {
+        let accumulator = initialValue;
+        let current = this.head;
+        while (current) {
+            accumulator = callback(accumulator, current.val);
+            current = current.next;
+        }
+        return accumulator;
+    }
+    /**
+     * The `insertAfter` function inserts a new node with a given value after an existing node in a doubly linked list.
+     * @param {T | DoublyLinkedListNode<T>} existingValueOrNode - The existing value or node in the doubly 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 doubly linked list.
+     * @returns The method returns a boolean value. It returns true if the insertion is successful, and false if the
+     * existing value or node is not found in the doubly linked list.
+     */
+    insertAfter(existingValueOrNode, newValue) {
+        let existingNode;
+        if (existingValueOrNode instanceof DoublyLinkedListNode) {
+            existingNode = existingValueOrNode;
+        }
+        else {
+            existingNode = this.findNode(existingValueOrNode);
+        }
+        if (existingNode) {
+            const newNode = new DoublyLinkedListNode(newValue);
+            newNode.next = existingNode.next;
+            if (existingNode.next) {
+                existingNode.next.prev = newNode;
+            }
+            newNode.prev = existingNode;
+            existingNode.next = newNode;
+            if (existingNode === this.tail) {
+                this.tail = newNode;
+            }
+            this._length++;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * The `insertBefore` function inserts a new value before an existing value or node in a doubly linked list.
+     * @param {T | DoublyLinkedListNode<T>} existingValueOrNode - The existing value or node in the doubly linked list
+     * before 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 `newValue` parameter represents the value that you want to insert into the doubly linked
+     * list.
+     * @returns The method returns a boolean value. It returns `true` if the insertion is successful, and `false` if the
+     * insertion fails.
+     */
+    insertBefore(existingValueOrNode, newValue) {
+        let existingNode;
+        if (existingValueOrNode instanceof DoublyLinkedListNode) {
+            existingNode = existingValueOrNode;
+        }
+        else {
+            existingNode = this.findNode(existingValueOrNode);
+        }
+        if (existingNode) {
+            const newNode = new DoublyLinkedListNode(newValue);
+            newNode.prev = existingNode.prev;
+            if (existingNode.prev) {
+                existingNode.prev.next = newNode;
+            }
+            newNode.next = existingNode;
+            existingNode.prev = newNode;
+            if (existingNode === this.head) {
+                this.head = newNode;
+            }
+            this._length++;
+            return true;
+        }
+        return false;
     }
 }
 exports.DoublyLinkedList = DoublyLinkedList;