data-structure-typed 1.33.0 → 1.33.5

package/lib/data-structures/linked-list/doubly-linked-list.d.ts

@@ -5,66 +5,100 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-export declare class DoublyLinkedListNode<T = number> {
+export declare class DoublyLinkedListNode<E = any> {
     /**
      * 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".
+     * @param {E} 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 "E".
      */
-    constructor(val: T);
+    constructor(val: E);
     private _val;
-    get val(): T;
-    set val(value: T);
+    get val(): E;
+    set val(value: E);
     private _next;
-    get next(): DoublyLinkedListNode<T> | null;
-    set next(value: DoublyLinkedListNode<T> | null);
+    get next(): DoublyLinkedListNode<E> | null;
+    set next(value: DoublyLinkedListNode<E> | null);
     private _prev;
-    get prev(): DoublyLinkedListNode<T> | null;
-    set prev(value: DoublyLinkedListNode<T> | null);
+    get prev(): DoublyLinkedListNode<E> | null;
+    set prev(value: DoublyLinkedListNode<E> | null);
 }
-export declare class DoublyLinkedList<T = any> {
+export declare class DoublyLinkedList<E = any> {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor();
     private _head;
-    get head(): DoublyLinkedListNode<T> | null;
-    set head(value: DoublyLinkedListNode<T> | null);
+    get head(): DoublyLinkedListNode<E> | null;
+    set head(value: DoublyLinkedListNode<E> | null);
     private _tail;
-    get tail(): DoublyLinkedListNode<T> | null;
-    set tail(value: DoublyLinkedListNode<T> | null);
+    get tail(): DoublyLinkedListNode<E> | null;
+    set tail(value: DoublyLinkedListNode<E> | null);
     private _length;
     get length(): number;
     /**
      * 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`.
+     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
      * @returns The `fromArray` function returns a DoublyLinkedList object.
      */
-    static fromArray<T>(data: T[]): DoublyLinkedList<T>;
+    static fromArray<E>(data: E[]): DoublyLinkedList<E>;
     /**
      * 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.
+     * @param {E} val - The value to be added to the linked list.
      */
-    push(val: T): void;
+    push(val: E): void;
+    /**
+     * The addLast function adds a new node with the given value to the end of the doubly linked list.
+     * @param {E} val - The value to be added to the linked list.
+     */
+    addLast(val: E): void;
     /**
      * 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.
      */
-    pop(): T | undefined;
+    pop(): E | undefined;
+    /**
+     * The `pollLast()` 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.
+     */
+    pollLast(): E | undefined;
     /**
      * 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.
      */
-    shift(): T | undefined;
+    shift(): E | undefined;
+    /**
+     * The `pollFirst()` 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.
+     */
+    pollFirst(): E | undefined;
     /**
      * 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
+     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
      * doubly linked list.
      */
-    unshift(val: T): void;
+    unshift(val: E): void;
+    /**
+     * The addFirst function adds a new node with the given value to the beginning of a doubly linked list.
+     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
+     * doubly linked list.
+     */
+    addFirst(val: E): void;
+    /**
+     * The `peekFirst` function returns the first node in a doubly linked list, or null if the list is empty.
+     * @returns The method `peekFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
+     */
+    peekFirst(): E | undefined;
+    /**
+     * The `peekLast` function returns the last node in a doubly linked list, or null if the list is empty.
+     * @returns The method `peekLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
+     */
+    peekLast(): E | undefined;
+    get size(): number;
     /**
      * 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
@@ -72,34 +106,34 @@ export declare class DoublyLinkedList<T = any> {
      * @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: number): T | undefined;
+    getAt(index: number): E | undefined;
     /**
      * 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
+     * @returns The method `getNodeAt(index: number)` returns a `DoublyLinkedListNode<E>` object if the index is within the
      * valid range of the linked list, otherwise it returns `null`.
      */
-    getNodeAt(index: number): DoublyLinkedListNode<T> | null;
+    getNodeAt(index: number): DoublyLinkedListNode<E> | null;
     /**
      * 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`
+     * @param {E} 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<E>` 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: T): DoublyLinkedListNode<T> | null;
+    findNode(val: E): DoublyLinkedListNode<E> | null;
     /**
      * 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
+     * @param {E} 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.
      */
-    insertAt(index: number, val: T): boolean;
+    insertAt(index: number, val: E): boolean;
     /**
      * 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
@@ -107,48 +141,53 @@ export declare class DoublyLinkedList<T = any> {
      * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
      * bounds.
      */
-    deleteAt(index: number): T | undefined;
-    delete(valOrNode: T): boolean;
-    delete(valOrNode: DoublyLinkedListNode<T>): boolean;
+    deleteAt(index: number): E | undefined;
+    delete(valOrNode: E): boolean;
+    delete(valOrNode: DoublyLinkedListNode<E>): boolean;
     /**
      * The `toArray` function converts a linked list into an array.
-     * @returns The `toArray()` method is returning an array of type `T[]`.
+     * @returns The `toArray()` method is returning an array of type `E[]`.
+     */
+    toArray(): E[];
+    /**
+     * The function checks if a variable has a length greater than zero and returns a boolean value.
+     * @returns A boolean value is being returned.
      */
-    toArray(): T[];
+    isEmpty(): boolean;
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
      */
     clear(): void;
     /**
      * 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
+     * @param callback - A function that takes a value of type E 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: (val: T) => boolean): T | null;
+    find(callback: (val: E) => boolean): E | 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
+     * @param {E} val - The parameter `val` is of type `E`, 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: T): number;
+    indexOf(val: E): number;
     /**
      * 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
+     * @param callback - A function that takes a value of type E 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: (val: T) => boolean): T | null;
+    findLast(callback: (val: E) => boolean): E | 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[]`.
+     * @returns The `toArrayReverse()` function returns an array of type `E[]`.
      */
-    toArrayReverse(): T[];
+    toArrayReverse(): E[];
     /**
      * The `reverse` function reverses the order of the elements in a doubly linked list.
      */
@@ -159,24 +198,24 @@ export declare class DoublyLinkedList<T = any> {
      * 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: (val: T, index: number) => void): void;
+    forEach(callback: (val: E, index: number) => void): void;
     /**
      * 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
+     * @param callback - The callback parameter is a function that takes a value of type E (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<U>(callback: (val: T) => U): DoublyLinkedList<U>;
+    map<U>(callback: (val: E) => U): DoublyLinkedList<U>;
     /**
      * 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.
+     * @param callback - The `callback` parameter is a function that takes a value of type `E` 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: (val: T) => boolean): DoublyLinkedList<T>;
+    filter(callback: (val: E) => boolean): DoublyLinkedList<E>;
     /**
      * The `reduce` function iterates over a linked list and applies a callback function to each element, accumulating a
      * single value.
@@ -187,9 +226,9 @@ export declare class DoublyLinkedList<T = any> {
      * @returns The `reduce` method is returning the final value of the accumulator after iterating through all the
      * elements in the linked list.
      */
-    reduce<U>(callback: (accumulator: U, val: T) => U, initialValue: U): U;
-    insertAfter(existingValueOrNode: T, newValue: T): boolean;
-    insertAfter(existingValueOrNode: DoublyLinkedListNode<T>, newValue: T): boolean;
-    insertBefore(existingValueOrNode: T, newValue: T): boolean;
-    insertBefore(existingValueOrNode: DoublyLinkedListNode<T>, newValue: T): boolean;
+    reduce<U>(callback: (accumulator: U, val: E) => U, initialValue: U): U;
+    insertAfter(existingValueOrNode: E, newValue: E): boolean;
+    insertAfter(existingValueOrNode: DoublyLinkedListNode<E>, newValue: E): boolean;
+    insertBefore(existingValueOrNode: E, newValue: E): boolean;
+    insertBefore(existingValueOrNode: DoublyLinkedListNode<E>, newValue: E): boolean;
 }

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

@@ -8,8 +8,8 @@
 export class DoublyLinkedListNode {
     /**
      * 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".
+     * @param {E} 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 "E".
      */
     constructor(val) {
         this._val = val;
@@ -62,7 +62,7 @@ export class DoublyLinkedList {
     /**
      * 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`.
+     * @param {E[]} data - The `data` parameter is an array of elements of type `E`.
      * @returns The `fromArray` function returns a DoublyLinkedList object.
      */
     static fromArray(data) {
@@ -74,7 +74,7 @@ export class DoublyLinkedList {
     }
     /**
      * 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.
+     * @param {E} val - The value to be added to the linked list.
      */
     push(val) {
         const newNode = new DoublyLinkedListNode(val);
@@ -89,6 +89,13 @@ export class DoublyLinkedList {
         }
         this._length++;
     }
+    /**
+     * The addLast function adds a new node with the given value to the end of the doubly linked list.
+     * @param {E} val - The value to be added to the linked list.
+     */
+    addLast(val) {
+        this.push(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
@@ -109,6 +116,14 @@ export class DoublyLinkedList {
         this._length--;
         return removedNode.val;
     }
+    /**
+     * The `pollLast()` 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.
+     */
+    pollLast() {
+        return this.pop();
+    }
     /**
      * 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
@@ -129,9 +144,17 @@ export class DoublyLinkedList {
         this._length--;
         return removedNode.val;
     }
+    /**
+     * The `pollFirst()` 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.
+     */
+    pollFirst() {
+        return this.shift();
+    }
     /**
      * 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
+     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
      * doubly linked list.
      */
     unshift(val) {
@@ -147,6 +170,33 @@ export class DoublyLinkedList {
         }
         this._length++;
     }
+    /**
+     * The addFirst function adds a new node with the given value to the beginning of a doubly linked list.
+     * @param {E} val - The `val` parameter represents the value of the new node that will be added to the beginning of the
+     * doubly linked list.
+     */
+    addFirst(val) {
+        this.unshift(val);
+    }
+    /**
+     * The `peekFirst` function returns the first node in a doubly linked list, or null if the list is empty.
+     * @returns The method `peekFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
+     */
+    peekFirst() {
+        var _a;
+        return (_a = this.head) === null || _a === void 0 ? void 0 : _a.val;
+    }
+    /**
+     * The `peekLast` function returns the last node in a doubly linked list, or null if the list is empty.
+     * @returns The method `peekLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
+     */
+    peekLast() {
+        var _a;
+        return (_a = this.tail) === null || _a === void 0 ? void 0 : _a.val;
+    }
+    get size() {
+        return 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
@@ -168,7 +218,7 @@ export class DoublyLinkedList {
      * 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
+     * @returns The method `getNodeAt(index: number)` returns a `DoublyLinkedListNode<E>` object if the index is within the
      * valid range of the linked list, otherwise it returns `null`.
      */
     getNodeAt(index) {
@@ -183,8 +233,8 @@ export class DoublyLinkedList {
     /**
      * 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`
+     * @param {E} 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<E>` 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) {
@@ -201,7 +251,7 @@ export class DoublyLinkedList {
      * 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
+     * @param {E} 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.
@@ -251,8 +301,8 @@ export class DoublyLinkedList {
     }
     /**
      * 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.
+     * @param {E | DoublyLinkedListNode<E>} valOrNode - The `valOrNode` parameter can accept either a value of type `E` or
+     * a `DoublyLinkedListNode<E>` 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.
      */
@@ -284,7 +334,7 @@ export class DoublyLinkedList {
     }
     /**
      * The `toArray` function converts a linked list into an array.
-     * @returns The `toArray()` method is returning an array of type `T[]`.
+     * @returns The `toArray()` method is returning an array of type `E[]`.
      */
     toArray() {
         const array = [];
@@ -295,6 +345,13 @@ export class DoublyLinkedList {
         }
         return array;
     }
+    /**
+     * The function checks if a variable has a length greater than zero and returns a boolean value.
+     * @returns A boolean value is being returned.
+     */
+    isEmpty() {
+        return this.length === 0;
+    }
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
      */
@@ -305,7 +362,7 @@ export class DoublyLinkedList {
     }
     /**
      * 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
+     * @param callback - A function that takes a value of type E 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`.
@@ -322,7 +379,7 @@ export class DoublyLinkedList {
     }
     /**
      * 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
+     * @param {E} val - The parameter `val` is of type `E`, 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.
@@ -342,7 +399,7 @@ export class DoublyLinkedList {
     /**
      * 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
+     * @param callback - A function that takes a value of type E 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`.
@@ -359,7 +416,7 @@ export class DoublyLinkedList {
     }
     /**
      * The `toArrayReverse` function converts a doubly linked list into an array in reverse order.
-     * @returns The `toArrayReverse()` function returns an array of type `T[]`.
+     * @returns The `toArrayReverse()` function returns an array of type `E[]`.
      */
     toArrayReverse() {
         const array = [];
@@ -400,7 +457,7 @@ export class DoublyLinkedList {
     /**
      * 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
+     * @param callback - The callback parameter is a function that takes a value of type E (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.
@@ -417,7 +474,7 @@ export class DoublyLinkedList {
     /**
      * 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.
+     * @param callback - The `callback` parameter is a function that takes a value of type `E` 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.
      */
@@ -453,10 +510,10 @@ export class DoublyLinkedList {
     }
     /**
      * 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
+     * @param {E | DoublyLinkedListNode<E>} 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.
+     * @param {E} 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.
      */
@@ -486,10 +543,10 @@ export class DoublyLinkedList {
     }
     /**
      * 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
+     * @param {E | DoublyLinkedListNode<E>} 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
+     * @param {E} 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.