queue-typed 1.47.7 → 1.47.8

package/dist/data-structures/graph/directed-graph.js

@@ -99,15 +99,15 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Space Complexity: O(1)
      *
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
-     * @param {VO | VertexKey | null} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {VO | VertexKey | null} destOrKey - The `destOrKey` parameter in the `getEdge` function represents the
-     * destination vertex of the edge. It can be either a vertex object (`VO`), a vertex ID (`VertexKey`), or `null` if the
+     * @param {VO | VertexKey | undefined} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
+     * @param {VO | VertexKey | undefined} destOrKey - The `destOrKey` parameter in the `getEdge` function represents the
+     * destination vertex of the edge. It can be either a vertex object (`VO`), a vertex ID (`VertexKey`), or `undefined` if the
      * destination is not specified.
-     * @returns the first edge found between the source and destination vertices, or null if no such edge is found.
+     * @returns the first edge found between the source and destination vertices, or undefined if no such edge is found.
      */
     getEdge(srcOrKey, destOrKey) {
         let edges = [];
-        if (srcOrKey !== null && destOrKey !== null) {
+        if (srcOrKey !== undefined && destOrKey !== undefined) {
             const src = this._getVertex(srcOrKey);
             const dest = this._getVertex(destOrKey);
             if (src && dest) {
@@ -117,7 +117,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
                 }
             }
         }
-        return edges[0] || null;
+        return edges[0] || undefined;
     }
     /**
      * Time Complexity: O(|E|) where |E| is the number of edges
@@ -130,14 +130,14 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * The function removes an edge between two vertices in a graph and returns the removed edge.
      * @param {VO | VertexKey} srcOrKey - The source vertex or its ID.
      * @param {VO | VertexKey} destOrKey - The `destOrKey` parameter represents the destination vertex or its ID.
-     * @returns the removed edge (EO) if it exists, or null if either the source or destination vertex does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either the source or destination vertex does not exist.
      */
     deleteEdgeSrcToDest(srcOrKey, destOrKey) {
         const src = this._getVertex(srcOrKey);
         const dest = this._getVertex(destOrKey);
-        let removed = null;
+        let removed = undefined;
         if (!src || !dest) {
-            return null;
+            return undefined;
         }
         const srcOutEdges = this._outEdgeMap.get(src);
         if (srcOutEdges) {
@@ -145,7 +145,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         const destInEdges = this._inEdgeMap.get(dest);
         if (destInEdges) {
-            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key)[0] || null;
+            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key)[0] || undefined;
         }
         return removed;
     }
@@ -157,13 +157,13 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(|E|) where |E| is the number of edges
      * Space Complexity: O(1)
      *
-     * The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.
+     * The function removes an edge from a graph and returns the removed edge, or undefined if the edge was not found.
      * @param {EO} edge - The `edge` parameter is an object that represents an edge in a graph. It has two properties: `src`
      * and `dest`, which represent the source and destination vertices of the edge, respectively.
-     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `null` if the edge does not exist.
+     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `undefined` if the edge does not exist.
      */
     deleteEdge(edge) {
-        let removed = null;
+        let removed = undefined;
         const src = this._getVertex(edge.src);
         const dest = this._getVertex(edge.dest);
         if (src && dest) {
@@ -311,9 +311,9 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.
+     * The function "getEdgeSrc" returns the source vertex of an edge, or undefined if the edge does not exist.
      * @param {EO} e - The parameter "e" is of type EO, which represents an edge in a graph.
-     * @returns either a vertex object (VO) or null.
+     * @returns either a vertex object (VO) or undefined.
      */
     getEdgeSrc(e) {
         return this._getVertex(e.src);
@@ -328,7 +328,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      *
      * The function "getEdgeDest" returns the destination vertex of an edge.
      * @param {EO} e - The parameter "e" is of type "EO", which represents an edge in a graph.
-     * @returns either a vertex object of type VO or null.
+     * @returns either a vertex object of type VO or undefined.
      */
     getEdgeDest(e) {
         return this._getVertex(e.dest);
@@ -342,12 +342,12 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Space Complexity: O(1)
      *
      * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
-     * @param {VO | VertexKey | null} vertex - The `vertex` parameter represents the starting vertex from which we want to
-     * find the destinations. It can be either a `VO` object, a `VertexKey` value, or `null`.
+     * @param {VO | VertexKey | undefined} vertex - The `vertex` parameter represents the starting vertex from which we want to
+     * find the destinations. It can be either a `VO` object, a `VertexKey` value, or `undefined`.
      * @returns an array of vertices (VO[]).
      */
     getDestinations(vertex) {
-        if (vertex === null) {
+        if (vertex === undefined) {
             return [];
         }
         const destinations = [];
@@ -369,11 +369,11 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Space Complexity: O(|V|)
      *
      * The `topologicalSort` function performs a topological sort on a graph and returns an array of vertices or vertex IDs
-     * in the sorted order, or null if the graph contains a cycle.
+     * in the sorted order, or undefined if the graph contains a cycle.
      * @param {'vertex' | 'key'} [propertyName] - The `propertyName` parameter is an optional parameter that specifies the
      * property to use for sorting the vertices. It can have two possible values: 'vertex' or 'key'. If 'vertex' is
      * specified, the vertices themselves will be used for sorting. If 'key' is specified, the ids of
-     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.
+     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns undefined.
      */
     topologicalSort(propertyName) {
         propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'key';
@@ -406,7 +406,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             }
         }
         if (hasCycle)
-            return null;
+            return undefined;
         if (propertyName === 'key')
             sorted = sorted.map(vertex => (vertex instanceof DirectedVertex ? vertex.key : vertex));
         return sorted.reverse();
@@ -449,7 +449,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             const outEdges = this.outgoingEdgesOf(vertex);
             for (const outEdge of outEdges) {
                 const neighbor = this._getVertex(outEdge.dest);
-                // TODO after no-non-null-assertion not ensure the logic
+                // TODO after no-non-undefined-assertion not ensure the logic
                 if (neighbor) {
                     neighbors.push(neighbor);
                 }
@@ -466,14 +466,14 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Space Complexity: O(1)
      *
      * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
-     * otherwise it returns null.
+     * otherwise it returns undefined.
      * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph.
      * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
-     * graph. If the edge does not exist, it returns `null`.
+     * graph. If the edge does not exist, it returns `undefined`.
      */
     getEndsOfEdge(edge) {
         if (!this.hasEdge(edge.src, edge.dest)) {
-            return null;
+            return undefined;
         }
         const v1 = this._getVertex(edge.src);
         const v2 = this._getVertex(edge.dest);
@@ -481,7 +481,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             return [v1, v2];
         }
         else {
-            return null;
+            return undefined;
         }
     }
     /**
@@ -504,7 +504,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         const srcVertex = this._getVertex(edge.src);
         const destVertex = this._getVertex(edge.dest);
-        // TODO after no-non-null-assertion not ensure the logic
+        // TODO after no-non-undefined-assertion not ensure the logic
         if (srcVertex && destVertex) {
             const srcOutEdges = this._outEdgeMap.get(srcVertex);
             if (srcOutEdges) {

package/dist/data-structures/graph/undirected-graph.d.ts

@@ -61,14 +61,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-     * @param {VO | VertexKey | null} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (a string or number representing the ID of a vertex).
-     * @param {VO | VertexKey | null} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (vertex ID).
-     * @returns an edge (EO) or null.
+     * The function `getEdge` returns the first edge that connects two vertices, or undefined if no such edge exists.
+     * @param {VO | VertexKey | undefined} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * object), `undefined`, or `VertexKey` (a string or number representing the ID of a vertex).
+     * @param {VO | VertexKey | undefined} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * object), `undefined`, or `VertexKey` (vertex ID).
+     * @returns an edge (EO) or undefined.
      */
-    getEdge(v1: VO | VertexKey | null, v2: VO | VertexKey | null): EO | null;
+    getEdge(v1: VO | VertexKey | undefined, v2: VO | VertexKey | undefined): EO | undefined;
     /**
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
      * Space Complexity: O(1)
@@ -81,9 +81,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * @param {VO | VertexKey} v2 - VO | VertexKey - This parameter can be either a vertex object (VO) or a vertex ID
      * (VertexKey). It represents the second vertex of the edge that needs to be removed.
-     * @returns the removed edge (EO) if it exists, or null if either of the vertices (VO) does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either of the vertices (VO) does not exist.
      */
-    deleteEdgeBetween(v1: VO | VertexKey, v2: VO | VertexKey): EO | null;
+    deleteEdgeBetween(v1: VO | VertexKey, v2: VO | VertexKey): EO | undefined;
     /**
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
      * Space Complexity: O(1)
@@ -94,9 +94,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      *
      * The deleteEdge function removes an edge between two vertices in a graph.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type EO) or null if the edge was not found.
+     * @returns The method is returning either the removed edge (of type EO) or undefined if the edge was not found.
      */
-    deleteEdge(edge: EO): EO | null;
+    deleteEdge(edge: EO): EO | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -161,12 +161,12 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Space Complexity: O(1)
      *
      * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
-     * it returns null.
+     * it returns undefined.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
      * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
-     * graph. If the edge does not exist, it returns `null`.
+     * graph. If the edge does not exist, it returns `undefined`.
      */
-    getEndsOfEdge(edge: EO): [VO, VO] | null;
+    getEndsOfEdge(edge: EO): [VO, VO] | undefined;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/data-structures/graph/undirected-graph.js

@@ -84,24 +84,24 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-     * @param {VO | VertexKey | null} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (a string or number representing the ID of a vertex).
-     * @param {VO | VertexKey | null} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (vertex ID).
-     * @returns an edge (EO) or null.
+     * The function `getEdge` returns the first edge that connects two vertices, or undefined if no such edge exists.
+     * @param {VO | VertexKey | undefined} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * object), `undefined`, or `VertexKey` (a string or number representing the ID of a vertex).
+     * @param {VO | VertexKey | undefined} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
+     * object), `undefined`, or `VertexKey` (vertex ID).
+     * @returns an edge (EO) or undefined.
      */
     getEdge(v1, v2) {
         var _a;
         let edges = [];
-        if (v1 !== null && v2 !== null) {
+        if (v1 !== undefined && v2 !== undefined) {
             const vertex1 = this._getVertex(v1);
             const vertex2 = this._getVertex(v2);
             if (vertex1 && vertex2) {
                 edges = (_a = this._edges.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(e => e.vertices.includes(vertex2.key));
             }
         }
-        return edges ? edges[0] || null : null;
+        return edges ? edges[0] || undefined : undefined;
     }
     /**
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
@@ -115,18 +115,18 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * @param {VO | VertexKey} v2 - VO | VertexKey - This parameter can be either a vertex object (VO) or a vertex ID
      * (VertexKey). It represents the second vertex of the edge that needs to be removed.
-     * @returns the removed edge (EO) if it exists, or null if either of the vertices (VO) does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either of the vertices (VO) does not exist.
      */
     deleteEdgeBetween(v1, v2) {
         const vertex1 = this._getVertex(v1);
         const vertex2 = this._getVertex(v2);
         if (!vertex1 || !vertex2) {
-            return null;
+            return undefined;
         }
         const v1Edges = this._edges.get(vertex1);
-        let removed = null;
+        let removed = undefined;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
+            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || undefined;
         }
         const v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
@@ -144,7 +144,7 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      *
      * The deleteEdge function removes an edge between two vertices in a graph.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type EO) or null if the edge was not found.
+     * @returns The method is returning either the removed edge (of type EO) or undefined if the edge was not found.
      */
     deleteEdge(edge) {
         return this.deleteEdgeBetween(edge.vertices[0], edge.vertices[1]);
@@ -251,14 +251,14 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
      * Space Complexity: O(1)
      *
      * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
-     * it returns null.
+     * it returns undefined.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
      * @returns The function `getEndsOfEdge` returns an array containing two vertices `[VO, VO]` if the edge exists in the
-     * graph. If the edge does not exist, it returns `null`.
+     * graph. If the edge does not exist, it returns `undefined`.
      */
     getEndsOfEdge(edge) {
         if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
-            return null;
+            return undefined;
         }
         const v1 = this._getVertex(edge.vertices[0]);
         const v2 = this._getVertex(edge.vertices[1]);
@@ -266,7 +266,7 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
             return [v1, v2];
         }
         else {
-            return null;
+            return undefined;
         }
     }
     /**
@@ -284,7 +284,7 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
     _addEdgeOnly(edge) {
         for (const end of edge.vertices) {
             const endVertex = this._getVertex(end);
-            if (endVertex === null)
+            if (endVertex === undefined)
                 return false;
             if (endVertex) {
                 const edges = this._edges.get(endVertex);

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

@@ -7,8 +7,8 @@
  */
 export declare class DoublyLinkedListNode<E = any> {
     value: E;
-    next: DoublyLinkedListNode<E> | null;
-    prev: DoublyLinkedListNode<E> | null;
+    next: DoublyLinkedListNode<E> | undefined;
+    prev: DoublyLinkedListNode<E> | undefined;
     /**
      * The constructor function initializes the value, next, and previous properties of an object.
      * @param {E} value - The "value" parameter is the value that will be stored in the node. It can be of any data type, as it
@@ -21,10 +21,10 @@ export declare class DoublyLinkedList<E = any> {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor(elements?: Iterable<E>);
-    protected _head: DoublyLinkedListNode<E> | null;
-    get head(): DoublyLinkedListNode<E> | null;
-    protected _tail: DoublyLinkedListNode<E> | null;
-    get tail(): DoublyLinkedListNode<E> | null;
+    protected _head: DoublyLinkedListNode<E> | undefined;
+    get head(): DoublyLinkedListNode<E> | undefined;
+    protected _tail: DoublyLinkedListNode<E> | undefined;
+    get tail(): DoublyLinkedListNode<E> | undefined;
     protected _length: number;
     get length(): number;
     get size(): number;
@@ -76,7 +76,7 @@ export declare class DoublyLinkedList<E = any> {
      *
      * 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.value) if the list is not empty. If the
-     * list is empty, it returns null.
+     * list is empty, it returns undefined.
      */
     pop(): E | undefined;
     /**
@@ -89,7 +89,7 @@ export declare class DoublyLinkedList<E = any> {
      *
      * The `popLast()` 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.value) if the list is not empty. If the
-     * list is empty, it returns null.
+     * list is empty, it returns undefined.
      */
     popLast(): E | undefined;
     /**
@@ -152,8 +152,8 @@ export declare class DoublyLinkedList<E = any> {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getFirst` function returns the first node in a doubly linked list, or null if the list is empty.
-     * @returns The method `getFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
+     * The `getFirst` function returns the first node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `getFirst()` returns the first node of the doubly linked list, or `undefined` if the list is empty.
      */
     getFirst(): E | undefined;
     /**
@@ -164,8 +164,8 @@ export declare class DoublyLinkedList<E = any> {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getLast` function returns the last node in a doubly linked list, or null if the list is empty.
-     * @returns The method `getLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
+     * The `getLast` function returns the last node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `getLast()` returns the last node of the doubly linked list, or `undefined` if the list is empty.
      */
     getLast(): E | undefined;
     /**
@@ -176,11 +176,11 @@ export declare class DoublyLinkedList<E = any> {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
+     * The `getAt` function returns the value at a specified index in a linked list, or undefined 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.
+     * or the linked list is empty, it will return undefined.
      */
     getAt(index: number): E | undefined;
     /**
@@ -191,14 +191,14 @@ export declare class DoublyLinkedList<E = any> {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The function `getNodeAt` returns the node at a given index in a doubly linked list, or null if the index is out of
+     * The function `getNodeAt` returns the node at a given index in a doubly linked list, or undefined 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<E>` object if the index is within the
-     * valid range of the linked list, otherwise it returns `null`.
+     * valid range of the linked list, otherwise it returns `undefined`.
      */
-    getNodeAt(index: number): DoublyLinkedListNode<E> | null;
+    getNodeAt(index: number): DoublyLinkedListNode<E> | undefined;
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -208,12 +208,12 @@ export declare class DoublyLinkedList<E = any> {
      * Space Complexity: O(1)
      *
      * 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.
+     * node if found, otherwise it returns undefined.
      * @param {E} value - The `value` 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 `value`
-     * is found in the linked list. If no such node is found, it returns `null`.
+     * is found in the linked list. If no such node is found, it returns `undefined`.
      */
-    getNode(value: E | null): DoublyLinkedListNode<E> | null;
+    getNode(value: E | undefined): DoublyLinkedListNode<E> | undefined;
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -277,7 +277,7 @@ export declare class DoublyLinkedList<E = any> {
      * 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
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `undefined` if the index is out of
      * bounds.
      */
     deleteAt(index: number): E | undefined;
@@ -295,14 +295,14 @@ export declare class DoublyLinkedList<E = any> {
      * @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: E | DoublyLinkedListNode<E> | null): boolean;
+    delete(valOrNode: E | DoublyLinkedListNode<E> | undefined): boolean;
     /**
      * 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(): boolean;
     /**
-     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
+     * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear(): void;
     /**
@@ -317,9 +317,9 @@ export declare class DoublyLinkedList<E = any> {
      * @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`.
+     * the callback function. If no element satisfies the condition, it returns `undefined`.
      */
-    find(callback: (value: E) => boolean): E | null;
+    find(callback: (value: E) => boolean): E | undefined;
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -344,13 +344,13 @@ export declare class DoublyLinkedList<E = any> {
      * Space Complexity: O(1)
      *
      * The `findBackward` 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.
+     * value that satisfies the given callback function, or undefined if no value satisfies the callback.
      * @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 `findBackward` 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`.
+     * the callback function. If no value satisfies the condition, it returns `undefined`.
      */
-    findBackward(callback: (value: E) => boolean): E | null;
+    findBackward(callback: (value: E) => boolean): E | undefined;
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)