queue-typed 2.5.2 → 2.6.0

package/dist/esm/index.mjs

@@ -208,6 +208,35 @@ var IterableElementBase = class {
     for (const ele of this) if (ele === element) return true;
     return false;
   }
+  /**
+   * Check whether a value exists (Array-compatible alias for `has`).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param element - Element to search for (uses `===`).
+   * @returns `true` if found.
+   */
+  includes(element) {
+    return this.has(element);
+  }
+  /**
+   * Return an iterator of `[index, value]` pairs (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *entries() {
+    let index = 0;
+    for (const value of this) {
+      yield [index++, value];
+    }
+  }
+  /**
+   * Return an iterator of numeric indices (Array-compatible).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+   */
+  *keys() {
+    let index = 0;
+    for (const _ of this) {
+      yield index++;
+    }
+  }
   /**
    * Reduces all elements to a single accumulated value.
    *
@@ -518,6 +547,16 @@ var LinearBase = class _LinearBase extends IterableElementBase {
     }
     return this;
   }
+  /**
+   * Return a new instance of the same type with elements in reverse order (non-mutating).
+   * @remarks Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+   * @returns A new reversed instance.
+   */
+  toReversed() {
+    const cloned = this.clone();
+    cloned.reverse();
+    return cloned;
+  }
 };
 var LinearLinkedBase = class extends LinearBase {
   static {
@@ -809,6 +848,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -876,6 +922,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -948,6 +1001,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1002,6 +1062,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1117,6 +1184,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1176,6 +1250,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1224,6 +1305,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1278,6 +1366,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1337,6 +1432,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1404,6 +1506,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1448,6 +1557,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1498,6 +1614,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1714,6 +1837,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1768,6 +1898,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1850,6 +1987,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2085,6 +2229,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2135,6 +2286,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2152,6 +2310,14 @@ var Queue = class _Queue extends LinearBase {
   get first() {
     return this.length > 0 ? this.elements[this._offset] : void 0;
   }
+  /**
+   * Peek at the front element without removing it (alias for `first`).
+   * @remarks Time O(1), Space O(1)
+   * @returns Front element or undefined.
+   */
+  peek() {
+    return this.first;
+  }
   /**
    * Get the last element (back) without removing it.
    * @remarks Time O(1), Space O(1)
@@ -2201,6 +2367,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2263,6 +2436,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2332,6 +2512,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2391,6 +2578,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2443,6 +2637,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2497,6 +2698,21 @@ var Queue = class _Queue extends LinearBase {
     this._elements[this._offset + index] = newElement;
     return true;
   }
+  /**
+   * Delete the first element that satisfies a predicate.
+   * @remarks Time O(N), Space O(N)
+   * @param predicate - Function (value, index, queue) → boolean to decide deletion.
+   * @returns True if a match was removed.
+   */
+  deleteWhere(predicate) {
+    for (let i = 0; i < this.length; i++) {
+      if (predicate(this._elements[this._offset + i], i, this)) {
+        this.deleteAt(i);
+        return true;
+      }
+    }
+    return false;
+  }
   /**
    * Reverse the queue in-place by compacting then reversing.
    * @remarks Time O(N), Space O(N)
@@ -2536,6 +2752,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2582,6 +2805,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2651,6 +2881,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2704,6 +2941,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2761,6 +3005,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3045,6 +3296,37 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+     * @example
+  * // Deque peek at both ends
+  *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
+  *
+  *     // Get first element without removing
+  *     const first = deque.at(0);
+  *     console.log(first); // 10;
+  *
+  *     // Get last element without removing
+  *     const last = deque.at(deque.length - 1);
+  *     console.log(last); // 50;
+  *
+  *     // Length unchanged
+  *     console.log(deque.length); // 5;
+    */
+  /**
+   * Peek at the front element without removing it (alias for `first`).
+   * @remarks Time O(1), Space O(1)
+   * @returns Front element or undefined.
+   */
+  peek() {
+    return this.first;
+  }
+  /**
+    * Deque peek at both ends
+   
     
     
      * @example
@@ -3097,6 +3379,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3160,6 +3449,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3236,6 +3532,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3299,6 +3602,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3363,6 +3673,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3468,6 +3785,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3513,6 +3837,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3562,6 +3893,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3762,6 +4100,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3856,6 +4201,68 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+     * @example
+  * // Deque for...of iteration and reverse
+  *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
+  *
+  *     // Iterate forward
+  *     const forward: string[] = [];
+  *     for (const item of deque) {
+  *       forward.push(item);
+  *     }
+  *     console.log(forward); // ['A', 'B', 'C', 'D'];
+  *
+  *     // Reverse the deque
+  *     deque.reverse();
+  *     const backward: string[] = [];
+  *     for (const item of deque) {
+  *       backward.push(item);
+  *     }
+  *     console.log(backward); // ['D', 'C', 'B', 'A'];
+    */
+  /**
+    * Find the last value matching a predicate (scans back-to-front).
+    * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+    * @param predicate - Function called with (value, index, deque).
+    * @returns Matching value or undefined.
+     * @example
+  * // Find last matching value
+  *  const d = new Deque([1, 2, 3, 4, 5]);
+  *     console.log(d.findLast(v => v > 2)); // 5;
+  *     console.log(d.findLast(v => v % 2 === 0)); // 4;
+    */
+  findLast(predicate) {
+    for (let i = this.length - 1; i >= 0; i--) {
+      const val = this.at(i);
+      if (predicate(val, i, this)) return val;
+    }
+    return void 0;
+  }
+  /**
+    * Find the index of the last value matching a predicate (scans back-to-front).
+    * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+    * @param predicate - Function called with (value, index, deque).
+    * @returns Matching index, or -1 if not found.
+     * @example
+  * // Find last matching index
+  *  const d = new Deque([10, 20, 30, 20, 10]);
+  *     console.log(d.findLastIndex(v => v === 20)); // 3;
+  *     console.log(d.findLastIndex(v => v === 10)); // 4;
+    */
+  findLastIndex(predicate) {
+    for (let i = this.length - 1; i >= 0; i--) {
+      if (predicate(this.at(i), i, this)) return i;
+    }
+    return -1;
+  }
+  /**
+    * Deque for...of iteration and reverse
+   
     
      * @example
   * // Deque for...of iteration and reverse
@@ -3961,6 +4368,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4032,6 +4446,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4086,6 +4507,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4160,6 +4588,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+