queue-typed 2.5.2 → 2.6.0

package/dist/umd/queue-typed.js

@@ -232,6 +232,35 @@ var queueTyped = (() => {
       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.
      *
@@ -536,6 +565,16 @@ var queueTyped = (() => {
       }
       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 {
     constructor(options) {
@@ -820,6 +859,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -887,6 +933,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -960,6 +1013,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1014,6 +1074,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1129,6 +1196,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1188,6 +1262,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1236,6 +1317,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1290,6 +1378,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1349,6 +1444,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1416,6 +1518,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1460,6 +1569,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1510,6 +1626,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1726,6 +1849,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1780,6 +1910,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -1862,6 +1999,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2093,6 +2237,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2143,6 +2294,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2160,6 +2318,14 @@ var queueTyped = (() => {
     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)
@@ -2209,6 +2375,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2271,6 +2444,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2340,6 +2520,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2399,6 +2586,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2451,6 +2645,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2505,6 +2706,21 @@ var queueTyped = (() => {
       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)
@@ -2544,6 +2760,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2590,6 +2813,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2659,6 +2889,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2712,6 +2949,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -2769,6 +3013,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3049,6 +3300,37 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+       * @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
@@ -3101,6 +3383,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3164,6 +3453,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3240,6 +3536,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3303,6 +3606,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3367,6 +3677,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3472,6 +3789,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3517,6 +3841,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3566,6 +3897,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3766,6 +4104,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -3860,6 +4205,68 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+       * @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
@@ -3965,6 +4372,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4036,6 +4450,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4090,6 +4511,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4164,6 +4592,13 @@ var queueTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+