queue-typed 2.5.3 → 2.6.0

package/dist/esm-legacy/index.mjs

@@ -206,6 +206,35 @@ var _IterableElementBase = class _IterableElementBase {
     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.
    *
@@ -514,6 +543,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;
+  }
 };
 __name(_LinearBase, "LinearBase");
 var LinearBase = _LinearBase;
@@ -812,6 +851,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -883,6 +925,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -960,6 +1005,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1018,6 +1066,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1137,6 +1188,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1200,6 +1254,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1252,6 +1309,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1310,6 +1370,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1373,6 +1436,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1444,6 +1510,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1492,6 +1561,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1546,6 +1618,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1766,6 +1841,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1824,6 +1902,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1910,6 +1991,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2148,6 +2232,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2202,6 +2289,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2280,6 +2370,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2346,6 +2439,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2419,6 +2515,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2482,6 +2581,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2538,6 +2640,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2650,6 +2755,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2700,6 +2808,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2773,6 +2884,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2830,6 +2944,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2891,6 +3008,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3201,7 +3321,10 @@ var _Deque = class _Deque extends LinearBase {
   }
   /**
     * Deque peek at both ends
-    * @example
+   
+    
+    
+     * @example
   * // Deque peek at both ends
   *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
   *
@@ -3259,6 +3382,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3326,6 +3452,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3406,6 +3535,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3473,6 +3605,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3541,6 +3676,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3650,6 +3788,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3699,6 +3840,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3752,6 +3896,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3956,6 +4103,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4050,6 +4200,64 @@ var _Deque = class _Deque 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
@@ -4163,6 +4371,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4238,6 +4449,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4296,6 +4510,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4374,6 +4591,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+