priority-queue-typed 1.47.7 → 1.47.8

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

@@ -16,8 +16,8 @@ class DoublyLinkedListNode {
      */
     constructor(value) {
         this.value = value;
-        this.next = null;
-        this.prev = null;
+        this.next = undefined;
+        this.prev = undefined;
     }
 }
 exports.DoublyLinkedListNode = DoublyLinkedListNode;
@@ -26,8 +26,8 @@ class DoublyLinkedList {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor(elements) {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
         if (elements) {
             for (const el of elements) {
@@ -115,19 +115,19 @@ class DoublyLinkedList {
      *
      * 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() {
         if (!this.tail)
             return undefined;
         const removedNode = this.tail;
         if (this.head === this.tail) {
-            this._head = null;
-            this._tail = null;
+            this._head = undefined;
+            this._tail = undefined;
         }
         else {
             this._tail = removedNode.prev;
-            this.tail.next = null;
+            this.tail.next = undefined;
         }
         this._length--;
         return removedNode.value;
@@ -142,7 +142,7 @@ class DoublyLinkedList {
      *
      * 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() {
         return this.pop();
@@ -164,12 +164,12 @@ class DoublyLinkedList {
             return undefined;
         const removedNode = this.head;
         if (this.head === this.tail) {
-            this._head = null;
-            this._tail = null;
+            this._head = undefined;
+            this._tail = undefined;
         }
         else {
             this._head = removedNode.next;
-            this.head.prev = null;
+            this.head.prev = undefined;
         }
         this._length--;
         return removedNode.value;
@@ -237,8 +237,8 @@ class DoublyLinkedList {
      * 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() {
         var _a;
@@ -252,8 +252,8 @@ class DoublyLinkedList {
      * 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() {
         var _a;
@@ -267,11 +267,11 @@ class DoublyLinkedList {
      * 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) {
         if (index < 0 || index >= this.length)
@@ -290,16 +290,16 @@ class DoublyLinkedList {
      * 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) {
         if (index < 0 || index >= this.length)
-            return null;
+            return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
             current = current.next;
@@ -315,10 +315,10 @@ class DoublyLinkedList {
      * 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) {
         let current = this.head;
@@ -328,7 +328,7 @@ class DoublyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -459,7 +459,7 @@ class DoublyLinkedList {
      * 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) {
@@ -525,11 +525,11 @@ class DoublyLinkedList {
         return this.length === 0;
     }
     /**
-     * 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() {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
     }
     /**
@@ -544,7 +544,7 @@ class DoublyLinkedList {
      * @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) {
         let current = this.head;
@@ -554,7 +554,7 @@ class DoublyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -591,11 +591,11 @@ class DoublyLinkedList {
      * 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) {
         let current = this.tail;
@@ -605,7 +605,7 @@ class DoublyLinkedList {
             }
             current = current.prev;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.

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

@@ -7,9 +7,9 @@
  */
 export declare class SinglyLinkedListNode<E = any> {
     value: E;
-    next: SinglyLinkedListNode<E> | null;
+    next: SinglyLinkedListNode<E> | undefined;
     /**
-     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
+     * The constructor function initializes an instance of a class with a given value and sets the next property to undefined.
      * @param {E} value - The "value" parameter is of type E, which means it can be any data type. It represents the value that
      * will be stored in the node of a linked list.
      */
@@ -20,10 +20,10 @@ export declare class SinglyLinkedList<E = any> {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor(elements?: Iterable<E>);
-    protected _head: SinglyLinkedListNode<E> | null;
-    get head(): SinglyLinkedListNode<E> | null;
-    protected _tail: SinglyLinkedListNode<E> | null;
-    get tail(): SinglyLinkedListNode<E> | null;
+    protected _head: SinglyLinkedListNode<E> | undefined;
+    get head(): SinglyLinkedListNode<E> | undefined;
+    protected _tail: SinglyLinkedListNode<E> | undefined;
+    get tail(): SinglyLinkedListNode<E> | undefined;
     protected _length: number;
     get length(): number;
     /**
@@ -77,7 +77,7 @@ export declare class SinglyLinkedList<E = any> {
      * 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`.
+     * the linked list is empty, it returns `undefined`.
      */
     pop(): E | undefined;
     /**
@@ -91,7 +91,7 @@ export declare class SinglyLinkedList<E = any> {
      * The `popLast()` 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`.
+     * the linked list is empty, it returns `undefined`.
      */
     popLast(): E | undefined;
     /**
@@ -152,11 +152,11 @@ export declare class SinglyLinkedList<E = any> {
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
      *
-     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
+     * The function `getAt` returns the value at a specified index in a 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 element we want to
      * retrieve from the list.
-     * @returns The method `getAt(index: number): E | null` returns the value at the specified index in the linked list, or
-     * `null` if the index is out of bounds.
+     * @returns The method `getAt(index: number): E | undefined` returns the value at the specified index in the linked list, or
+     * `undefined` if the index is out of bounds.
      */
     getAt(index: number): E | undefined;
     /**
@@ -171,9 +171,9 @@ export declare class SinglyLinkedList<E = any> {
      * @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<E>` object if the node at the
-     * specified index exists, or `null` if the index is out of bounds.
+     * specified index exists, or `undefined` if the index is out of bounds.
      */
-    getNodeAt(index: number): SinglyLinkedListNode<E> | null;
+    getNodeAt(index: number): SinglyLinkedListNode<E> | undefined;
     /**
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
@@ -185,7 +185,7 @@ export declare class SinglyLinkedList<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;
@@ -203,7 +203,7 @@ export declare class SinglyLinkedList<E = any> {
      * @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: E | SinglyLinkedListNode<E> | null | undefined): boolean;
+    delete(valueOrNode: E | SinglyLinkedListNode<E> | undefined | undefined): boolean;
     /**
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
@@ -228,7 +228,7 @@ export declare class SinglyLinkedList<E = any> {
      */
     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;
     /**
@@ -267,9 +267,9 @@ export declare class SinglyLinkedList<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) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
      * Space Complexity: O(1) - Constant space.
@@ -293,12 +293,12 @@ export declare class SinglyLinkedList<E = any> {
      * Space Complexity: O(1) - Constant space.
      *
      * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
-     * null.
+     * undefined.
      * @param {E} value - The value parameter is the value that we want to search for in the linked list.
      * @returns a `SinglyLinkedListNode<E>` 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`.
+     * the specified value is found, the function returns `undefined`.
      */
-    getNode(value: E): SinglyLinkedListNode<E> | null;
+    getNode(value: E): SinglyLinkedListNode<E> | undefined;
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
      * Space Complexity: O(1) - Constant space.

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

@@ -10,13 +10,13 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  */
 class SinglyLinkedListNode {
     /**
-     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
+     * The constructor function initializes an instance of a class with a given value and sets the next property to undefined.
      * @param {E} value - The "value" parameter is of type E, which means it can be any data type. It represents the value that
      * will be stored in the node of a linked list.
      */
     constructor(value) {
         this.value = value;
-        this.next = null;
+        this.next = undefined;
     }
 }
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
@@ -25,8 +25,8 @@ class SinglyLinkedList {
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
     constructor(elements) {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
         if (elements) {
             for (const el of elements)
@@ -112,15 +112,15 @@ class SinglyLinkedList {
      * 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`.
+     * the linked list is empty, it returns `undefined`.
      */
     pop() {
         if (!this.head)
             return undefined;
         if (this.head === this.tail) {
             const value = this.head.value;
-            this._head = null;
-            this._tail = null;
+            this._head = undefined;
+            this._tail = undefined;
             this._length--;
             return value;
         }
@@ -129,7 +129,7 @@ class SinglyLinkedList {
             current = current.next;
         }
         const value = this.tail.value;
-        current.next = null;
+        current.next = undefined;
         this._tail = current;
         this._length--;
         return value;
@@ -145,7 +145,7 @@ class SinglyLinkedList {
      * The `popLast()` 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`.
+     * the linked list is empty, it returns `undefined`.
      */
     popLast() {
         return this.pop();
@@ -230,11 +230,11 @@ class SinglyLinkedList {
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
      *
-     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
+     * The function `getAt` returns the value at a specified index in a 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 element we want to
      * retrieve from the list.
-     * @returns The method `getAt(index: number): E | null` returns the value at the specified index in the linked list, or
-     * `null` if the index is out of bounds.
+     * @returns The method `getAt(index: number): E | undefined` returns the value at the specified index in the linked list, or
+     * `undefined` if the index is out of bounds.
      */
     getAt(index) {
         if (index < 0 || index >= this.length)
@@ -257,7 +257,7 @@ class SinglyLinkedList {
      * @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<E>` object if the node at the
-     * specified index exists, or `null` if the index is out of bounds.
+     * specified index exists, or `undefined` if the index is out of bounds.
      */
     getNodeAt(index) {
         let current = this.head;
@@ -277,7 +277,7 @@ class SinglyLinkedList {
      * 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) {
@@ -317,13 +317,13 @@ class SinglyLinkedList {
         else {
             value = valueOrNode;
         }
-        let current = this.head, prev = null;
+        let current = this.head, prev = undefined;
         while (current) {
             if (current.value === value) {
-                if (prev === null) {
+                if (prev === undefined) {
                     this._head = current.next;
                     if (current === this.tail) {
-                        this._tail = null;
+                        this._tail = undefined;
                     }
                 }
                 else {
@@ -383,11 +383,11 @@ class SinglyLinkedList {
         return this.length === 0;
     }
     /**
-     * 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() {
-        this._head = null;
-        this._tail = null;
+        this._head = undefined;
+        this._tail = undefined;
         this._length = 0;
     }
     /**
@@ -424,9 +424,9 @@ class SinglyLinkedList {
     reverse() {
         if (!this.head || this.head === this.tail)
             return;
-        let prev = null;
+        let prev = undefined;
         let current = this.head;
-        let next = null;
+        let next = undefined;
         while (current) {
             next = current.next;
             current.next = prev;
@@ -447,7 +447,7 @@ class SinglyLinkedList {
      * @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) {
         let current = this.head;
@@ -457,7 +457,7 @@ class SinglyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
@@ -493,10 +493,10 @@ class SinglyLinkedList {
      * Space Complexity: O(1) - Constant space.
      *
      * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
-     * null.
+     * undefined.
      * @param {E} value - The value parameter is the value that we want to search for in the linked list.
      * @returns a `SinglyLinkedListNode<E>` 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`.
+     * the specified value is found, the function returns `undefined`.
      */
     getNode(value) {
         let current = this.head;
@@ -506,7 +506,7 @@ class SinglyLinkedList {
             }
             current = current.next;
         }
-        return null;
+        return undefined;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.

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

@@ -25,7 +25,7 @@ class SkipList {
      * level in the skip list. It is used to determine the height of each node in the skip list.
      */
     constructor(maxLevel = 16, probability = 0.5) {
-        this._head = new SkipListNode(null, null, maxLevel);
+        this._head = new SkipListNode(undefined, undefined, maxLevel);
         this._level = 0;
         this._maxLevel = maxLevel;
         this._probability = probability;
@@ -69,7 +69,7 @@ class SkipList {
             newNode.forward[i] = update[i].forward[i];
             update[i].forward[i] = newNode;
         }
-        if (newNode.forward[0] !== null) {
+        if (!newNode.forward[0]) {
             this._level = Math.max(this.level, newNode.forward.length);
         }
     }
@@ -140,7 +140,7 @@ class SkipList {
                 }
                 update[i].forward[i] = current.forward[i];
             }
-            while (this.level > 0 && this.head.forward[this.level - 1] === null) {
+            while (this.level > 0 && !this.head.forward[this.level - 1]) {
                 this._level--;
             }
             return true;
@@ -218,7 +218,7 @@ class SkipList {
      */
     lower(key) {
         let current = this.head;
-        let lastLess = null;
+        let lastLess = undefined;
         for (let i = this.level - 1; i >= 0; i--) {
             while (current.forward[i] && current.forward[i].key < key) {
                 current = current.forward[i];

package/dist/data-structures/queue/queue.d.ts

@@ -11,8 +11,8 @@ export declare class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
      */
     enqueue(value: E): void;
     /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or null if the queue is empty.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning the element at the front of the queue, or undefined if the queue is empty.
      */
     dequeue(): E | undefined;
     /**
@@ -75,7 +75,7 @@ export declare class Queue<E = any> {
      *
      * The `shift` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.
-     * @returns The function `shift()` returns either the first element in the queue or `null` if the queue is empty.
+     * @returns The function `shift()` returns either the first element in the queue or `undefined` if the queue is empty.
      */
     shift(): E | undefined;
     /**
@@ -86,9 +86,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `getFirst()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     getFirst(): E | undefined;
     /**
@@ -99,9 +99,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     peek(): E | undefined;
     /**
@@ -112,9 +112,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `getLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `getLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     getLast(): E | undefined;
     /**
@@ -125,9 +125,9 @@ export declare class Queue<E = any> {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `peekLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     peekLast(): E | undefined;
     /**
@@ -150,8 +150,8 @@ export declare class Queue<E = any> {
      * Time Complexity: O(n) - same as shift().
      * Space Complexity: O(1) - same as shift().
      *
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning a value of type E or null.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning a value of type E or undefined.
      */
     dequeue(): E | undefined;
     /**