doubly-linked-list-typed 1.52.3 → 1.52.5

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

@@ -311,10 +311,6 @@ export declare class FibonacciHeap<E> {
      * @protected
      */
     peek(): E | undefined;
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -333,10 +329,6 @@ export declare class FibonacciHeap<E> {
      * @param node
      */
     mergeWithChild(parent: FibonacciHeapNode<E>, node: FibonacciHeapNode<E>): void;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -345,10 +337,6 @@ export declare class FibonacciHeap<E> {
      * @returns The top element or undefined if the heap is empty.
      */
     poll(): E | undefined;
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -357,10 +345,6 @@ export declare class FibonacciHeap<E> {
      * @returns The top element or undefined if the heap is empty.
      */
     pop(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -382,10 +366,6 @@ export declare class FibonacciHeap<E> {
      * @protected
      */
     protected _defaultComparator(a: E, b: E): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -394,10 +374,6 @@ export declare class FibonacciHeap<E> {
      * @param node - The node to be merged.
      */
     protected mergeWithRoot(node: FibonacciHeapNode<E>): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -407,10 +383,6 @@ export declare class FibonacciHeap<E> {
      * @protected
      */
     protected removeFromRoot(node: FibonacciHeapNode<E>): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -421,10 +393,6 @@ export declare class FibonacciHeap<E> {
      * @protected
      */
     protected _link(y: FibonacciHeapNode<E>, x: FibonacciHeapNode<E>): void;
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)

package/dist/data-structures/heap/heap.js

@@ -510,10 +510,6 @@ class FibonacciHeap {
     peek() {
         return this.min ? this.min.element : undefined;
     }
-    /**
-     * Time Complexity: O(n), where n is the number of elements in the linked list.
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
@@ -559,10 +555,6 @@ class FibonacciHeap {
             parent.child.right = node;
         }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -573,10 +565,6 @@ class FibonacciHeap {
     poll() {
         return this.pop();
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -607,10 +595,6 @@ class FibonacciHeap {
         this._size--;
         return z.element;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -663,10 +647,6 @@ class FibonacciHeap {
             return 1;
         return 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -685,10 +665,6 @@ class FibonacciHeap {
             this.root.right = node;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -705,10 +681,6 @@ class FibonacciHeap {
         if (node.right)
             node.right.left = node.left;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -726,10 +698,6 @@ class FibonacciHeap {
         x.degree++;
         y.parent = x;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)

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

@@ -81,11 +81,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The size of the object, which is a number.
      */
     get size(): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -94,10 +89,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The method `get first()` returns the first node of the doubly linked list, or `undefined` if the list is empty.
      */
     get first(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -106,10 +97,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The method `get last()` returns the last node of the doubly linked list, or `undefined` if the list is empty.
      */
     get last(): E | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -123,8 +110,7 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The push function adds a new element to the end of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value that you want to add to the
      * doubly linked list.
@@ -134,8 +120,7 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `pop()` function removes and returns the value of the last element in a linked list.
      * @returns The method is returning the value of the removed node.
      */
@@ -143,8 +128,7 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `shift()` function removes and returns the value of the first element in a doubly linked list.
      * @returns The value of the removed node.
      */
@@ -152,18 +136,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The unshift function adds a new element to the beginning of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value of the element that you want to
      * add to the beginning of the doubly linked list.
      * @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)
@@ -175,10 +154,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * or the linked list is empty, it will return undefined.
      */
     at(index: number): E | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -191,10 +166,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * valid range of the linked list, otherwise it returns `undefined`.
      */
     getNodeAt(index: number): DoublyLinkedListNode<E> | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -206,10 +177,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * is found in the linked list. If no such node is found, it returns `undefined`.
      */
     getNode(value: E | undefined): DoublyLinkedListNode<E> | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -223,11 +190,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * if the index is out of bounds.
      */
     addAt(index: number, value: E): boolean;
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -242,10 +204,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * insertion fails.
      */
     addBefore(existingValueOrNode: E | DoublyLinkedListNode<E>, newValue: E): boolean;
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -270,10 +228,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * bounds.
      */
     deleteAt(index: number): boolean;
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -285,10 +239,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * deleted from the doubly linked list, and `false` if the value or node was not found in the list.
      */
     delete(valOrNode: E | DoublyLinkedListNode<E> | undefined): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -297,10 +247,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * @returns A boolean value is being returned.
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -308,10 +254,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * The `clear` function resets the linked list by setting the head, tail, and size to undefined and 0 respectively.
      */
     clear(): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -323,10 +265,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * list. If the 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)
@@ -339,10 +277,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * the callback function. If no value satisfies the condition, it returns `undefined`.
      */
     findBackward(callback: (value: E) => boolean): E | undefined;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -350,10 +284,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * The `reverse` function reverses the order of the elements in a doubly linked list.
      */
     reverse(): this;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -362,10 +292,6 @@ export declare class DoublyLinkedList<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(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -374,10 +300,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * @returns The `toReversedArray()` function returns an array of type `E[]`.
      */
     toReversedArray(): E[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -388,10 +310,6 @@ export declare class DoublyLinkedList<E = any, R = any> extends IterableElementB
      * is a copy of the original list.
      */
     clone(): DoublyLinkedList<E, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -413,8 +331,7 @@ export declare class DoublyLinkedList<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 DoublyLinkedList 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 the

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

@@ -107,11 +107,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     get size() {
         return this._size;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -123,10 +118,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         var _a;
         return (_a = this.head) === null || _a === void 0 ? void 0 : _a.value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -138,10 +129,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         var _a;
         return (_a = this.tail) === null || _a === void 0 ? void 0 : _a.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -157,8 +144,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The push function adds a new element to the end of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value that you want to add to the
      * doubly linked list.
@@ -181,8 +167,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `pop()` function removes and returns the value of the last element in a linked list.
      * @returns The method is returning the value of the removed node.
      */
@@ -204,8 +189,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The `shift()` function removes and returns the value of the first element in a doubly linked list.
      * @returns The value of the removed node.
      */
@@ -227,8 +211,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     */
-    /**
+     *
      * The unshift function adds a new element to the beginning of a doubly linked list.
      * @param {E} element - The "element" parameter represents the value of the element that you want to
      * add to the beginning of the doubly linked list.
@@ -248,10 +231,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         this._size++;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -271,10 +250,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return current.value;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -295,10 +270,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return current;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -319,10 +290,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return undefined;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -356,11 +323,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         this._size++;
         return true;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the linked list.
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -398,10 +360,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -467,10 +425,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         this._size--;
         return true;
     }
-    /**
-     * Time Complexity: O(1) or O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1) or O(n)
      * Space Complexity: O(1)
@@ -507,10 +461,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return false;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -521,10 +471,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     isEmpty() {
         return this.size === 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -536,10 +482,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         this._tail = undefined;
         this._size = 0;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -562,10 +504,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -587,10 +525,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return undefined;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -607,10 +541,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -627,10 +557,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -647,10 +573,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
         }
         return array;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -663,10 +585,6 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     clone() {
         return new DoublyLinkedList(this);
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -698,8 +616,7 @@ class DoublyLinkedList extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and returns a new DoublyLinkedList 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 the