priority-queue-typed 2.0.4 → 2.1.0

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

@@ -1,9 +1,20 @@
 "use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.LinkedListQueue = exports.Queue = void 0;
 const linked_list_1 = require("../linked-list");
 const linear_base_1 = require("../base/linear-base");
 /**
+ * Array-backed queue with amortized O(1) enqueue/dequeue via an offset pointer and optional auto-compaction.
+ * @remarks Time O(1), Space O(1)
+ * @template E
+ * @template R
  * 1. First In, First Out (FIFO): The core feature of a queue is its first in, first out nature. The element added to the queue first will be the one to be removed first.
  * 2. Operations: The main operations include enqueue (adding an element to the end of the queue) and dequeue (removing and returning the element at the front of the queue). Typically, there is also a peek operation (looking at the front element without removing it).
  * 3. Uses: Queues are commonly used to manage a series of tasks or elements that need to be processed in order. For example, managing task queues in a multi-threaded environment, or in algorithms for data structures like trees and graphs for breadth-first search.
@@ -20,7 +31,7 @@ const linear_base_1 = require("../base/linear-base");
  *     let maxSum = 0;
  *     let currentSum = 0;
  *
- *     nums.forEach((num) => {
+ *     nums.forEach(num => {
  *       queue.push(num);
  *       currentSum += num;
  *
@@ -60,6 +71,13 @@ const linear_base_1 = require("../base/linear-base");
  *     console.log(visited); // [1, 2, 3, 4, 5]
  */
 class Queue extends linear_base_1.LinearBase {
+    /**
+     * Create a Queue and optionally bulk-insert elements.
+     * @remarks Time O(N), Space O(N)
+     * @param [elements] - Iterable of elements (or raw records if toElementFn is set).
+     * @param [options] - Options such as toElementFn, maxLen, and autoCompactRatio.
+     * @returns New Queue instance.
+     */
     constructor(elements = [], options) {
         super(options);
         this._elements = [];
@@ -71,63 +89,86 @@ class Queue extends linear_base_1.LinearBase {
         }
         this.pushMany(elements);
     }
+    /**
+     * Get the underlying array buffer.
+     * @remarks Time O(1), Space O(1)
+     * @returns Backing array of elements.
+     */
     get elements() {
         return this._elements;
     }
+    /**
+     * Get the current start offset into the array.
+     * @remarks Time O(1), Space O(1)
+     * @returns Zero-based offset.
+     */
     get offset() {
         return this._offset;
     }
-    get length() {
-        return this.elements.length - this.offset;
-    }
+    /**
+     * Get the compaction threshold (offset/size).
+     * @remarks Time O(1), Space O(1)
+     * @returns Auto-compaction ratio in (0,1].
+     */
     get autoCompactRatio() {
         return this._autoCompactRatio;
     }
-    set autoCompactRatio(v) {
-        this._autoCompactRatio = v;
+    /**
+     * Set the compaction threshold.
+     * @remarks Time O(1), Space O(1)
+     * @param value - New ratio; compacts when offset/size exceeds this value.
+     * @returns void
+     */
+    set autoCompactRatio(value) {
+        this._autoCompactRatio = value;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `first` function returns the first element of the array `_elements` if it exists, otherwise it returns `undefined`.
-     * @returns The `get first()` method returns the first element of the data structure, represented by the `_elements` array at
-     * the `_offset` index. If the data structure is empty (length is 0), it returns `undefined`.
+     * Get the number of elements currently in the queue.
+     * @remarks Time O(1), Space O(1)
+     * @returns Current length.
+     */
+    get length() {
+        return this.elements.length - this._offset;
+    }
+    /**
+     * Get the first element (front) without removing it.
+     * @remarks Time O(1), Space O(1)
+     * @returns Front element or undefined.
      */
     get first() {
-        return this.length > 0 ? this.elements[this.offset] : undefined;
+        return this.length > 0 ? this.elements[this._offset] : undefined;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `last` function returns the last element in an array-like data structure, or undefined if the structure is empty.
-     * @returns The method `get last()` returns the last element of the `_elements` array if the array is not empty. If the
-     * array is empty, it returns `undefined`.
+     * Get the last element (back) without removing it.
+     * @remarks Time O(1), Space O(1)
+     * @returns Back element or undefined.
      */
     get last() {
         return this.length > 0 ? this.elements[this.elements.length - 1] : undefined;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.
-     * @public
-     * @param {E[]} elements - The "elements" parameter is an array of elements of type E.
-     * @returns The method is returning a new instance of the Queue class, initialized with the elements from the input
-     * array.
+     * Create a queue from an array of elements.
+     * @remarks Time O(N), Space O(N)
+     * @template E
+     * @param elements - Array of elements to enqueue in order.
+     * @returns A new queue populated from the array.
      */
     static fromArray(elements) {
         return new Queue(elements);
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * 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 Always returns true, indicating the element was successfully added.
+     * Check whether the queue is empty.
+     * @remarks Time O(1), Space O(1)
+     * @returns True if length is 0.
+     */
+    isEmpty() {
+        return this.length === 0;
+    }
+    /**
+     * Enqueue one element at the back.
+     * @remarks Time O(1), Space O(1)
+     * @param element - Element to enqueue.
+     * @returns True on success.
      */
     push(element) {
         this.elements.push(element);
@@ -136,15 +177,10 @@ class Queue extends linear_base_1.LinearBase {
         return true;
     }
     /**
-     * Time Complexity: O(k)
-     * Space Complexity: O(k)
-     *
-     * The `pushMany` function iterates over elements and pushes them into an array after applying a
-     * transformation function if provided.
-     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `pushMany` function
-     * is an iterable containing elements of type `E` or `R`.
-     * @returns The `pushMany` function is returning an array of boolean values indicating whether each
-     * element was successfully pushed into the data structure.
+     * Enqueue many elements from an iterable.
+     * @remarks Time O(N), Space O(1)
+     * @param elements - Iterable of elements (or raw records if toElementFn is set).
+     * @returns Array of per-element success flags.
      */
     pushMany(elements) {
         const ans = [];
@@ -157,300 +193,281 @@ class Queue extends linear_base_1.LinearBase {
         return ans;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * 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 `undefined` if the queue is empty.
+     * Dequeue one element from the front (amortized via offset).
+     * @remarks Time O(1) amortized, Space O(1)
+     * @returns Removed element or undefined.
      */
     shift() {
         if (this.length === 0)
             return undefined;
         const first = this.first;
         this._offset += 1;
-        if (this.offset / this.elements.length > this.autoCompactRatio)
+        if (this.elements.length > 0 && this.offset / this.elements.length > this.autoCompactRatio)
             this.compact();
         return first;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The delete function removes an element from the list.
-     * @param {E} element - Specify the element to be deleted
-     * @return A boolean value indicating whether the element was successfully deleted or not
+     * Delete the first occurrence of a specific element.
+     * @remarks Time O(N), Space O(1)
+     * @param element - Element to remove (strict equality via Object.is).
+     * @returns True if an element was removed.
      */
     delete(element) {
-        const index = this.elements.indexOf(element);
-        return !!this.deleteAt(index);
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The deleteAt function deletes the element at a given index.
-     * @param {number} index - Determine the index of the element to be deleted
-     * @return A boolean value
-     */
-    deleteAt(index) {
-        const deleted = this.elements[index];
-        this.elements.splice(index, 1);
-        return deleted;
+        for (let i = this._offset; i < this.elements.length; i++) {
+            if (Object.is(this.elements[i], element)) {
+                this.elements.splice(i, 1);
+                return true;
+            }
+        }
+        return false;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `at` function returns the element at a specified index adjusted by an offset, or `undefined`
-     * if the index is out of bounds.
-     * @param {number} index - The `index` parameter represents the position of the element you want to
-     * retrieve from the data structure.
-     * @returns The `at` method is returning the element at the specified index adjusted by the offset
-     * `_offset`.
+     * Get the element at a given logical index.
+     * @remarks Time O(1), Space O(1)
+     * @param index - Zero-based index from the front.
+     * @returns Element or undefined.
      */
     at(index) {
-        return this.elements[index + this._offset];
+        if (index < 0 || index >= this.length)
+            return undefined;
+        return this._elements[this._offset + index];
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `reverse` function in TypeScript reverses the elements of an array starting from a specified
-     * offset.
-     * @returns The `reverse()` method is returning the modified object itself (`this`) after reversing
-     * the elements in the array and resetting the offset to 0.
+     * Delete the element at a given index.
+     * @remarks Time O(N), Space O(1)
+     * @param index - Zero-based index from the front.
+     * @returns Removed element or undefined.
      */
-    reverse() {
-        this._elements = this.elements.slice(this.offset).reverse();
-        this._offset = 0;
-        return this;
+    deleteAt(index) {
+        if (index < 0 || index >= this.length)
+            return undefined;
+        const gi = this._offset + index;
+        const [deleted] = this.elements.splice(gi, 1);
+        return deleted;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `addAt` inserts a new element at a specified index in an array, returning true if
-     * successful and false if the index is out of bounds.
-     * @param {number} index - The `index` parameter represents the position at which the `newElement`
-     * should be added in the array.
-     * @param {E} newElement - The `newElement` parameter represents the element that you want to insert
-     * into the array at the specified index.
-     * @returns The `addAt` method returns a boolean value - `true` if the new element was successfully
-     * added at the specified index, and `false` if the index is out of bounds (less than 0 or greater
-     * than the length of the array).
+     * Insert a new element at a given index.
+     * @remarks Time O(N), Space O(1)
+     * @param index - Zero-based index from the front.
+     * @param newElement - Element to insert.
+     * @returns True if inserted.
      */
     addAt(index, newElement) {
         if (index < 0 || index > this.length)
             return false;
-        this._elements.splice(this.offset + index, 0, newElement);
+        this._elements.splice(this._offset + index, 0, newElement);
         return true;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `setAt` updates an element at a specified index in an array-like data structure.
-     * @param {number} index - The `index` parameter is a number that represents the position in the
-     * array where the new element will be set.
-     * @param {E} newElement - The `newElement` parameter represents the new value that you want to set
-     * at the specified index in the array.
-     * @returns The `setAt` method returns a boolean value - `true` if the element was successfully set
-     * at the specified index, and `false` if the index is out of bounds (less than 0 or greater than the
-     * length of the array).
+     * Replace the element at a given index.
+     * @remarks Time O(1), Space O(1)
+     * @param index - Zero-based index from the front.
+     * @param newElement - New element to set.
+     * @returns True if updated.
      */
     setAt(index, newElement) {
-        if (index < 0 || index > this.length)
+        if (index < 0 || index >= this.length)
             return false;
-        this._elements[this.offset + index] = newElement;
+        this._elements[this._offset + index] = newElement;
         return true;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function checks if a data structure is empty by comparing its length to zero.
-     * @returns {boolean} A boolean value indicating whether the length of the object is 0 or not.
+     * Reverse the queue in-place by compacting then reversing.
+     * @remarks Time O(N), Space O(N)
+     * @returns This queue.
      */
-    isEmpty() {
-        return this.length === 0;
+    reverse() {
+        this._elements = this.elements.slice(this._offset).reverse();
+        this._offset = 0;
+        return this;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The clear function resets the elements array and offset to their initial values.
+     * Remove all elements and reset offset.
+     * @remarks Time O(1), Space O(1)
+     * @returns void
      */
     clear() {
         this._elements = [];
         this._offset = 0;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The `compact` function in TypeScript slices the elements array based on the offset and resets the
-     * offset to zero.
-     * @returns The `compact()` method is returning a boolean value of `true`.
+     * Compact storage by discarding consumed head elements.
+     * @remarks Time O(N), Space O(N)
+     * @returns True when compaction performed.
      */
     compact() {
-        this._elements = this.elements.slice(this.offset);
+        this._elements = this.elements.slice(this._offset);
         this._offset = 0;
         return true;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function overrides the splice method to remove and insert elements in a queue-like data
-     * structure.
-     * @param {number} start - The `start` parameter in the `splice` method specifies the index at which
-     * to start changing the array. Items will be added or removed starting from this index.
-     * @param {number} [deleteCount=0] - The `deleteCount` parameter in the `splice` method specifies the
-     * number of elements to remove from the array starting at the specified `start` index. If
-     * `deleteCount` is not provided, it defaults to 0, meaning no elements will be removed but new
-     * elements can still be inserted at
-     * @param {E[]} items - The `items` parameter in the `splice` method represents the elements that
-     * will be added to the array at the specified `start` index. These elements will replace the
-     * existing elements starting from the `start` index for the `deleteCount` number of elements.
-     * @returns The `splice` method is returning the `removedQueue`, which is an instance of the same
-     * class as the original object.
+     * Remove and/or insert elements at a position (array-like).
+     * @remarks Time O(N + M), Space O(M)
+     * @param start - Start index (clamped to [0, length]).
+     * @param [deleteCount] - Number of elements to remove (default 0).
+     * @param [items] - Elements to insert after `start`.
+     * @returns A new queue containing the removed elements (typed as `this`).
      */
     splice(start, deleteCount = 0, ...items) {
-        const removedQueue = this._createInstance();
         start = Math.max(0, Math.min(start, this.length));
         deleteCount = Math.max(0, Math.min(deleteCount, this.length - start));
-        const globalStartIndex = this.offset + start;
-        const removedElements = this._elements.splice(globalStartIndex, deleteCount, ...items);
-        removedQueue.pushMany(removedElements);
-        this.compact();
-        return removedQueue;
+        const gi = this._offset + start;
+        const removedArray = this._elements.splice(gi, deleteCount, ...items);
+        if (this.elements.length > 0 && this.offset / this.elements.length > this.autoCompactRatio)
+            this.compact();
+        const removed = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
+        removed._setAutoCompactRatio(this._autoCompactRatio);
+        removed.pushMany(removedArray);
+        return removed;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `clone()` function returns a new Queue object with the same elements as the original Queue.
-     * @returns The `clone()` method is returning a new instance of the `Queue` class.
+     * Deep clone this queue and its parameters.
+     * @remarks Time O(N), Space O(N)
+     * @returns A new queue with the same content and options.
      */
     clone() {
-        return new Queue(this.elements.slice(this.offset), { toElementFn: this.toElementFn, maxLen: this._maxLen });
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `filter` function creates a new `Queue` object containing elements from the original `Queue`
-     * that satisfy a given predicate function.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * the current element being iterated over, the index of the current element, and the queue itself.
-     * It should return a boolean value indicating whether the element should be included in the filtered
-     * queue or not.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
-     * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be
-     * passed as the `this` value to the `predicate` function. If `thisArg` is
-     * @returns The `filter` method is returning a new `Queue` object that contains the elements that
-     * satisfy the given predicate function.
+        const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
+        out._setAutoCompactRatio(this._autoCompactRatio);
+        for (let i = this._offset; i < this.elements.length; i++)
+            out.push(this.elements[i]);
+        return out;
+    }
+    /**
+     * Filter elements into a new queue of the same class.
+     * @remarks Time O(N), Space O(N)
+     * @param predicate - Predicate (element, index, queue) → boolean to keep element.
+     * @param [thisArg] - Value for `this` inside the predicate.
+     * @returns A new queue with kept elements.
      */
     filter(predicate, thisArg) {
-        const newDeque = this._createInstance({
-            toElementFn: this._toElementFn,
-            autoCompactRatio: this._autoCompactRatio,
-            maxLen: this._maxLen
-        });
+        const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
+        out._setAutoCompactRatio(this._autoCompactRatio);
         let index = 0;
-        for (const el of this) {
-            if (predicate.call(thisArg, el, index, this)) {
-                newDeque.push(el);
-            }
+        for (const v of this) {
+            if (predicate.call(thisArg, v, index, this))
+                out.push(v);
             index++;
         }
-        return newDeque;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `map` function in TypeScript creates a new Queue by applying a callback function to each
-     * element in the original Queue.
-     * @param callback - The `callback` parameter is a function that will be applied to each element in
-     * the queue. It takes the current element, its index, and the queue itself as arguments, and returns
-     * a new element.
-     * @param [toElementFn] - The `toElementFn` parameter is an optional function that can be provided to
-     * convert a raw element of type `RM` to a new element of type `EM`. This function is used within the
-     * `map` method to transform each raw element before passing it to the `callback` function. If
-     * @param {any} [thisArg] - The `thisArg` parameter in the `map` function is used to specify the
-     * value of `this` when executing the `callback` function. It allows you to set the context (the
-     * value of `this`) within the callback function. If `thisArg` is provided, it will be
-     * @returns A new Queue object containing elements of type EM, which are the result of applying the
-     * callback function to each element in the original Queue object.
-     */
-    map(callback, toElementFn, thisArg) {
-        const newDeque = new Queue([], {
-            toElementFn,
-            autoCompactRatio: this._autoCompactRatio,
-            maxLen: this._maxLen
+        return out;
+    }
+    /**
+     * Map each element to a new element in a possibly different-typed queue.
+     * @remarks Time O(N), Space O(N)
+     * @template EM
+     * @template RM
+     * @param callback - Mapping function (element, index, queue) → newElement.
+     * @param [options] - Options for the output queue (e.g., toElementFn, maxLen, autoCompactRatio).
+     * @param [thisArg] - Value for `this` inside the callback.
+     * @returns A new Queue with mapped elements.
+     */
+    map(callback, options, thisArg) {
+        var _a, _b;
+        const out = new this.constructor([], {
+            toElementFn: options === null || options === void 0 ? void 0 : options.toElementFn,
+            maxLen: (_a = options === null || options === void 0 ? void 0 : options.maxLen) !== null && _a !== void 0 ? _a : this._maxLen,
+            autoCompactRatio: (_b = options === null || options === void 0 ? void 0 : options.autoCompactRatio) !== null && _b !== void 0 ? _b : this._autoCompactRatio
         });
         let index = 0;
-        for (const el of this) {
-            newDeque.push(callback.call(thisArg, el, index, this));
-            index++;
-        }
-        return newDeque;
+        for (const v of this)
+            out.push(thisArg === undefined ? callback(v, index++, this) : callback.call(thisArg, v, index++, this));
+        return out;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function `_getIterator` returns an iterable iterator for the elements in the class.
+     * Map each element to a new value of the same type.
+     * @remarks Time O(N), Space O(N)
+     * @param callback - Mapping function (element, index, queue) → element.
+     * @param [thisArg] - Value for `this` inside the callback.
+     * @returns A new queue with mapped elements (same element type).
      */
-    *_getIterator() {
-        for (const item of this.elements.slice(this.offset)) {
-            yield item;
+    mapSame(callback, thisArg) {
+        var _a;
+        const Ctor = this.constructor;
+        const out = new Ctor([], {
+            toElementFn: this.toElementFn,
+            maxLen: this._maxLen,
+            autoCompactRatio: this._autoCompactRatio
+        });
+        (_a = out._setAutoCompactRatio) === null || _a === void 0 ? void 0 : _a.call(out, this._autoCompactRatio);
+        let index = 0;
+        for (const v of this) {
+            const mv = thisArg === undefined ? callback(v, index++, this) : callback.call(thisArg, v, index++, this);
+            out.push(mv);
         }
+        return out;
     }
     /**
-     * The function `_createInstance` returns a new instance of the `Queue` class with the specified
-     * options.
-     * @param [options] - The `options` parameter in the `_createInstance` method is of type
-     * `QueueOptions<E, R>`, which is used to configure the behavior of the queue being created. It
-     * allows you to specify settings or properties that can influence how the queue operates.
-     * @returns An instance of the `Queue` class with an empty array and the provided options is being
-     * returned.
+     * (Protected) Set the internal auto-compaction ratio.
+     * @remarks Time O(1), Space O(1)
+     * @param value - New ratio to assign.
+     * @returns void
      */
-    _createInstance(options) {
-        return new Queue([], options);
+    _setAutoCompactRatio(value) {
+        this._autoCompactRatio = value;
     }
     /**
-     * The function `_getReverseIterator` returns an iterator that iterates over elements in reverse
-     * order.
+     * (Protected) Iterate elements from front to back.
+     * @remarks Time O(N), Space O(1)
+     * @returns Iterator of E.
+     */
+    *_getIterator() {
+        for (let i = this._offset; i < this.elements.length; i++)
+            yield this.elements[i];
+    }
+    /**
+     * (Protected) Iterate elements from back to front.
+     * @remarks Time O(N), Space O(1)
+     * @returns Iterator of E.
      */
     *_getReverseIterator() {
         for (let i = this.length - 1; i >= 0; i--) {
-            const cur = this.at(i); // `at()` handles the offset.
+            const cur = this.at(i);
             if (cur !== undefined)
                 yield cur;
         }
     }
+    /**
+     * (Protected) Create an empty instance of the same concrete class.
+     * @remarks Time O(1), Space O(1)
+     * @param [options] - Options forwarded to the constructor.
+     * @returns An empty like-kind queue instance.
+     */
+    _createInstance(options) {
+        const Ctor = this.constructor;
+        return new Ctor([], options);
+    }
+    /**
+     * (Protected) Create a like-kind queue and seed it from an iterable.
+     * @remarks Time O(N), Space O(N)
+     * @template EM
+     * @template RM
+     * @param [elements] - Iterable used to seed the new queue.
+     * @param [options] - Options forwarded to the constructor.
+     * @returns A like-kind Queue instance.
+     */
+    _createLike(elements = [], options) {
+        const Ctor = this.constructor;
+        return new Ctor(elements, options);
+    }
 }
 exports.Queue = Queue;
 /**
- * 1. First In, First Out (FIFO) Strategy: Like other queue implementations, LinkedListQueue follows the first in, first out principle, meaning the element that is added to the queue first will be the first to be removed.
- * 2. Based on Linked List: LinkedListQueue uses a linked list to store elements. Each node in the linked list contains data and a pointer to the next node.
- * 3. Memory Usage: Since each element requires additional space to store a pointer to the next element, linked lists may use more memory compared to arrays.
- * 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.
+ * Queue implemented over a singly linked list; preserves head/tail operations with linear scans for queries.
+ * @remarks Time O(1), Space O(1)
+ * @template E
+ * @template R
+ * @example examples will be generated by unit test
  */
 class LinkedListQueue extends linked_list_1.SinglyLinkedList {
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     * The `clone` function returns a new instance of the `LinkedListQueue` class with the same values as
-     * the current instance.
-     * @returns The `clone()` method is returning a new instance of `LinkedListQueue` with the same
-     * values as the original `LinkedListQueue`.
+     * Deep clone this linked-list-based queue.
+     * @remarks Time O(N), Space O(N)
+     * @returns A new queue with the same sequence of elements.
      */
     clone() {
-        return new LinkedListQueue(this, { toElementFn: this.toElementFn, maxLen: this._maxLen });
+        const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
+        for (const v of this)
+            out.push(v);
+        return out;
     }
 }
 exports.LinkedListQueue = LinkedListQueue;