doubly-linked-list-typed 1.52.4 → 1.52.5

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

@@ -72,12 +72,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The size of the object, which is a number.
      */
     get size(): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the input array, as it performs a loop to push each element into the linked list.
-     * Linear space, as it creates a new node for each element in the array.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -88,10 +82,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The `fromArray` function returns a `SinglyLinkedList` object.
      */
     static fromArray<E>(data: E[]): SinglyLinkedList<E, any>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -102,11 +92,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The `push` method is returning a boolean value, `true`.
      */
     push(element: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * Linear time in the worst case, as it may need to traverse the list to find the last element.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -116,10 +101,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * list.
      */
     pop(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -128,10 +109,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The value of the removed node.
      */
     shift(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -142,10 +119,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The `unshift` method is returning a boolean value, `true`.
      */
     unshift(element: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -157,10 +130,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * `undefined` if the index is out of bounds.
      */
     at(index: number): E | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -172,10 +141,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * specified index exists, or `undefined` if the index is out of bounds.
      */
     getNodeAt(index: number): SinglyLinkedListNode<E> | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -187,10 +152,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * bounds.
      */
     deleteAt(index: number): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -202,10 +163,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * 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> | undefined): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -229,12 +186,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the list, as it needs to traverse the entire list to convert it to an array.
-     * Linear space, as it creates an array with the same length as the list.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -243,10 +194,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The `toArray()` method is returning an array of type `E[]`.
      */
     toArray(): E[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -255,10 +202,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The reverse() method does not return anything. It has a return type of void.
      */
     reverse(): this;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -269,10 +212,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * value is not found, it returns -1.
      */
     indexOf(value: E): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -284,10 +223,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * the specified value is found, the function returns `undefined`.
      */
     getNode(value: E): SinglyLinkedListNode<E> | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -300,10 +235,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * inserted before the existing value, and `false` otherwise.
      */
     addBefore(existingValueOrNode: E | SinglyLinkedListNode<E>, newValue: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -316,10 +247,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * existing value or node, and false if the existing value or node was not found in the linked list.
      */
     addAfter(existingValueOrNode: E | SinglyLinkedListNode<E>, newValue: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -329,10 +256,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The count of occurrences of the given value in the linked list.
      */
     countOccurrences(value: E): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -343,10 +266,6 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
      * is a clone of the original list.
      */
     clone(): SinglyLinkedList<E, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -368,8 +287,7 @@ export declare class SinglyLinkedList<E = any, R = any> extends IterableElementB
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and returns a new SinglyLinkedList with the results
      * of applying the callback to each element in the original list.
      * @param callback - The `callback` parameter is a function that will be called for each element in

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

@@ -99,12 +99,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
     get size() {
         return this._size;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the input array, as it performs a loop to push each element into the linked list.
-     * Linear space, as it creates a new node for each element in the array.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -121,10 +115,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return singlyLinkedList;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -147,11 +137,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._size++;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     * Linear time in the worst case, as it may need to traverse the list to find the last element.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -180,10 +165,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._size--;
         return value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -199,10 +180,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._size--;
         return removedNode.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -225,10 +202,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._size++;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -248,10 +221,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return current.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -269,10 +238,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return current;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -300,10 +265,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._size--;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -315,7 +276,7 @@ class SinglyLinkedList extends base_1.IterableElementBase {
      * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
      */
     delete(valueOrNode) {
-        if (!valueOrNode)
+        if (valueOrNode === undefined)
             return false;
         let value;
         if (valueOrNode instanceof SinglyLinkedListNode) {
@@ -347,10 +308,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -397,12 +354,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         this._tail = undefined;
         this._size = 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * Linear time, where n is the length of the list, as it needs to traverse the entire list to convert it to an array.
-     * Linear space, as it creates an array with the same length as the list.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -419,10 +370,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -445,10 +392,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         [this._head, this._tail] = [this.tail, this.head];
         return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -470,10 +413,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -494,10 +433,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return undefined;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -536,10 +471,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -571,10 +502,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -594,10 +521,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
         }
         return count;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -610,10 +533,6 @@ class SinglyLinkedList extends base_1.IterableElementBase {
     clone() {
         return new SinglyLinkedList(this, { toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -645,8 +564,7 @@ class SinglyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and returns a new SinglyLinkedList with the results
      * of applying the callback to each element in the original list.
      * @param callback - The `callback` parameter is a function that will be called for each element in

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

@@ -46,10 +46,6 @@ export declare class SkipList<K, V> {
      * @returns The probability value stored in the protected variable `_probability` is being returned.
      */
     get probability(): number;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -58,10 +54,6 @@ export declare class SkipList<K, V> {
      * @returns The value of the first element, or undefined if the Skip List is empty.
      */
     get first(): V | undefined;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -70,10 +62,6 @@ export declare class SkipList<K, V> {
      * @returns The value of the last element, or undefined if the Skip List is empty.
      */
     get last(): V | undefined;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -84,10 +72,6 @@ export declare class SkipList<K, V> {
      * List.
      */
     add(key: K, value: V): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -101,18 +85,13 @@ export declare class SkipList<K, V> {
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The function checks if a key exists in a data structure.
      * @param {K} key - The parameter "key" is of type K, which represents the type of the key being
      * checked.
      * @returns a boolean value.
      */
     has(key: K): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -123,10 +102,6 @@ export declare class SkipList<K, V> {
      * skip list, and `false` if the key was not found in the skip list.
      */
     delete(key: K): boolean;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -136,10 +111,6 @@ export declare class SkipList<K, V> {
      * @returns The value of the first element greater than the given key, or undefined if there is no such element.
      */
     higher(key: K): V | undefined;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -149,11 +120,6 @@ export declare class SkipList<K, V> {
      * @returns The value of the last element less than the given key, or undefined if there is no such element.
      */
     lower(key: K): V | undefined;
-    /**
-     * Time Complexity: O(maxLevel)
-     * Space Complexity: O(1)
-     * where maxLevel is the maximum level of the SkipList, as it may iterate up to maxLevel times in the worst case.
-     */
     /**
      * Time Complexity: O(maxLevel)
      * Space Complexity: O(1)

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

@@ -63,10 +63,6 @@ class SkipList {
     get probability() {
         return this._probability;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -78,10 +74,6 @@ class SkipList {
         const firstNode = this.head.forward[0];
         return firstNode ? firstNode.value : undefined;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -98,10 +90,6 @@ class SkipList {
         }
         return current.value;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -129,10 +117,6 @@ class SkipList {
             this._level = Math.max(this.level, newNode.forward.length);
         }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -158,8 +142,7 @@ class SkipList {
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The function checks if a key exists in a data structure.
      * @param {K} key - The parameter "key" is of type K, which represents the type of the key being
      * checked.
@@ -168,10 +151,6 @@ class SkipList {
     has(key) {
         return this.get(key) !== undefined;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -205,10 +184,6 @@ class SkipList {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -227,10 +202,6 @@ class SkipList {
         const nextNode = current.forward[0];
         return nextNode ? nextNode.value : undefined;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -252,11 +223,6 @@ class SkipList {
         }
         return lastLess ? lastLess.value : undefined;
     }
-    /**
-     * Time Complexity: O(maxLevel)
-     * Space Complexity: O(1)
-     * where maxLevel is the maximum level of the SkipList, as it may iterate up to maxLevel times in the worst case.
-     */
     /**
      * Time Complexity: O(maxLevel)
      * Space Complexity: O(1)