min-heap-typed 1.52.3 → 1.52.5

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

@@ -96,10 +96,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @return The last element in the array
      */
     get last(): E | undefined;
-    /**
-     * Time Complexity - Amortized O(1) (possible reallocation)
-     * Space Complexity - O(n) (due to potential resizing).
-     */
     /**
      * Time Complexity - Amortized O(1) (possible reallocation),
      * Space Complexity - O(n) (due to potential resizing).
@@ -110,10 +106,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the data structure after the element has been pushed.
      */
     push(element: E): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -123,10 +115,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The element that was removed from the data structure is being returned.
      */
     pop(): E | undefined;
-    /**
-     * Time Complexity: Amortized O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: Amortized O(1)
      * Space Complexity: O(n)
@@ -138,10 +126,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the data structure after the element has been added.
      */
     unshift(element: E): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -152,10 +136,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * returned.
      */
     shift(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -164,10 +144,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns A boolean value indicating whether the size of the object is 0 or not.
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -185,10 +161,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * the last element.
      */
     reverseBegin(): Generator<E>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -200,10 +172,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The element at the specified position in the data structure is being returned.
      */
     at(pos: number): E;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -215,10 +183,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * position in the data structure.
      */
     setAt(pos: number, element: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -235,10 +199,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the array after the insertion is being returned.
      */
     addAt(pos: number, element: E, num?: number): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -251,10 +211,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The method is returning the updated size of the data structure.
      */
     cut(pos: number, isCutSelf?: boolean): Deque<E>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1) or O(n)
@@ -271,10 +227,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * (`newDeque`) depending on the value of the `isCutSelf` parameter.
      */
     cutRest(pos: number, isCutSelf?: boolean): Deque<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1) or O(n)
@@ -287,10 +239,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the data structure after the deletion operation is performed.
      */
     deleteAt(pos: number): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -302,10 +250,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the data structure after the element has been deleted.
      */
     delete(element: E): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -316,10 +260,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * operation on the buckets and updating the relevant properties.
      */
     reverse(): this;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -329,10 +269,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The size of the modified array is being returned.
      */
     unique(): this;
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -344,10 +280,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns Deque<E>
      */
     sort(comparator?: (x: E, y: E) => number): this;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -358,10 +290,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * `this.size` is 0, but it does not return any value.
      */
     shrinkToFit(): void;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -374,10 +302,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * in the data structure. If the element is not found, it returns -1.
      */
     indexOf(element: E): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -386,10 +310,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns The `toArray()` method is returning an array of elements of type `E`.
      */
     toArray(): E[];
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -400,10 +320,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * elements as the original deque (`this`) and the same bucket size.
      */
     clone(): Deque<E, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -424,8 +340,7 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the deque,
      * returning a new deque with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -441,10 +356,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * @returns a new Deque object with elements of type EM and raw elements of type RM.
      */
     map<EM, RM>(callback: ElementCallback<E, R, EM, Deque<E, R>>, toElementFn?: (rawElement: RM) => EM, thisArg?: any): Deque<EM, RM>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -453,10 +364,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * object to be iterated over using a for...of loop.
      */
     protected _getIterator(): IterableIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -467,10 +374,6 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * current bucket count (`this._bucketCount >> 1`) or 1 if the current bucket count is less than 2.
      */
     protected _reallocate(needBucketNum?: number): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

package/dist/data-structures/queue/deque.js

@@ -155,10 +155,6 @@ class Deque extends base_1.IterableElementBase {
             return;
         return this._buckets[this._bucketLast][this._lastInBucket];
     }
-    /**
-     * Time Complexity - Amortized O(1) (possible reallocation)
-     * Space Complexity - O(n) (due to potential resizing).
-     */
     /**
      * Time Complexity - Amortized O(1) (possible reallocation),
      * Space Complexity - O(n) (due to potential resizing).
@@ -190,10 +186,6 @@ class Deque extends base_1.IterableElementBase {
             this.shift();
         return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -222,10 +214,6 @@ class Deque extends base_1.IterableElementBase {
         this._size -= 1;
         return element;
     }
-    /**
-     * Time Complexity: Amortized O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: Amortized O(1)
      * Space Complexity: O(n)
@@ -258,10 +246,6 @@ class Deque extends base_1.IterableElementBase {
             this.pop();
         return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -291,10 +275,6 @@ class Deque extends base_1.IterableElementBase {
         this._size -= 1;
         return element;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -305,10 +285,6 @@ class Deque 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)
@@ -343,10 +319,6 @@ class Deque extends base_1.IterableElementBase {
             index--;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -362,10 +334,6 @@ class Deque extends base_1.IterableElementBase {
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         return this._buckets[bucketIndex][indexInBucket];
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -382,10 +350,6 @@ class Deque extends base_1.IterableElementBase {
         this._buckets[bucketIndex][indexInBucket] = element;
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -425,10 +389,6 @@ class Deque extends base_1.IterableElementBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -460,10 +420,6 @@ class Deque extends base_1.IterableElementBase {
             return newDeque;
         }
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1) or O(n)
@@ -482,7 +438,6 @@ class Deque extends base_1.IterableElementBase {
     cutRest(pos, isCutSelf = false) {
         if (isCutSelf) {
             if (pos < 0) {
-                this.clear();
                 return this;
             }
             const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
@@ -493,16 +448,14 @@ class Deque extends base_1.IterableElementBase {
         }
         else {
             const newDeque = new Deque([], { bucketSize: this._bucketSize });
+            if (pos < 0)
+                pos = 0;
             for (let i = pos; i < this.size; i++) {
                 newDeque.push(this.at(i));
             }
             return newDeque;
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1) or O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1) or O(n)
@@ -533,10 +486,6 @@ class Deque extends base_1.IterableElementBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -564,10 +513,6 @@ class Deque extends base_1.IterableElementBase {
         this.cut(index - 1, true);
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -588,10 +533,6 @@ class Deque extends base_1.IterableElementBase {
         this._lastInBucket = this._bucketSize - _firstInBucket - 1;
         return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -616,10 +557,6 @@ class Deque extends base_1.IterableElementBase {
         this.cut(index - 1, true);
         return this;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -641,10 +578,6 @@ class Deque extends base_1.IterableElementBase {
         }
         return this;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -677,10 +610,6 @@ class Deque extends base_1.IterableElementBase {
         this._bucketLast = newBuckets.length - 1;
         this._buckets = newBuckets;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -700,10 +629,6 @@ class Deque extends base_1.IterableElementBase {
         }
         return -1;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -714,10 +639,6 @@ class Deque extends base_1.IterableElementBase {
     toArray() {
         return [...this];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -730,10 +651,6 @@ class Deque extends base_1.IterableElementBase {
     clone() {
         return new Deque(this, { bucketSize: this.bucketSize, toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -764,8 +681,7 @@ class Deque extends base_1.IterableElementBase {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
-     */
-    /**
+     *
      * The `map` function takes a callback function and applies it to each element in the deque,
      * returning a new deque with the results.
      * @param callback - The callback parameter is a function that will be called for each element in the
@@ -789,10 +705,6 @@ class Deque extends base_1.IterableElementBase {
         }
         return newDeque;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -805,10 +717,6 @@ class Deque extends base_1.IterableElementBase {
             yield this.at(i);
         }
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -839,10 +747,6 @@ class Deque extends base_1.IterableElementBase {
         this._buckets = newBuckets;
         this._bucketCount = newBuckets.length;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)

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

@@ -34,10 +34,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @returns {number} The size of the array, which is the difference between the length of the array and the offset.
      */
     get size(): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -47,10 +43,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     get first(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -60,7 +52,7 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * array is empty, it returns `undefined`.
      */
     get last(): E | undefined;
-    _autoCompactRatio: number;
+    protected _autoCompactRatio: number;
     /**
      * This function returns the value of the autoCompactRatio property.
      * @returns The `autoCompactRatio` property of the object, which is a number.
@@ -72,10 +64,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * `_autoCompactRatio` property.
      */
     set autoCompactRatio(v: number);
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -87,23 +75,15 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * array.
      */
     static fromArray<E>(elements: E[]): Queue<E>;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The push function adds an element to the end of the queue and returns true. Adds an element at the back of the queue.
      * @param {E} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<E>` object.
+     * @returns Always returns true, indicating the element was successfully added.
      */
     push(element: E): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -115,20 +95,16 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
     shift(): E | undefined;
     /**
      * The delete function removes an element from the list.
-     * @param element: E Specify the element to be deleted
+     * @param {E} element - Specify the element to be deleted
      * @return A boolean value indicating whether the element was successfully deleted or not
      */
     delete(element: E): boolean;
     /**
      * The deleteAt function deletes the element at a given index.
-     * @param index: number Determine the index of the element to be deleted
+     * @param {number} index - Determine the index of the element to be deleted
      * @return A boolean value
      */
     deleteAt(index: number): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -136,10 +112,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @param index
      */
     at(index: number): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -148,10 +120,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @returns {boolean} A boolean value indicating whether the size of the object is 0 or not.
      */
     isEmpty(): boolean;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(n)
@@ -160,10 +128,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @returns An array of type E is being returned.
      */
     toArray(): E[];
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -177,11 +141,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @returns The `compact()` method is returning a boolean value of `true`.
      */
     compact(): boolean;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * where n is the number of elements in the queue. It creates a shallow copy of the internal array. the space required is proportional to the number of elements in the queue.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -190,10 +149,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * @returns The `clone()` method is returning a new instance of the `Queue` class.
      */
     clone(): Queue<E, R>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -216,10 +171,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
      * Space Complexity: O(n)
      */
     map<EM, RM>(callback: ElementCallback<E, R, EM, Queue<E, R>>, toElementFn?: (rawElement: RM) => EM, thisArg?: any): Queue<EM, RM>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -235,10 +186,6 @@ export declare class Queue<E = any, R = any> extends IterableElementBase<E, R, Q
  * 4. Frequent Enqueuing and Dequeuing Operations: If your application involves frequent enqueuing and dequeuing operations and is less concerned with random access, then LinkedListQueue is a good choice.
  */
 export declare class LinkedListQueue<E = any, R = any> extends SinglyLinkedList<E, R> {
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)