queue-typed 2.5.3 → 2.6.0

package/dist/cjs-legacy/index.cjs

@@ -208,6 +208,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.
    *
@@ -516,6 +545,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;
@@ -814,6 +853,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -885,6 +927,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -962,6 +1007,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1020,6 +1068,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1139,6 +1190,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1202,6 +1256,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1254,6 +1311,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1312,6 +1372,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1375,6 +1438,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1446,6 +1512,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1494,6 +1563,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1548,6 +1620,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1768,6 +1843,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1826,6 +1904,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1912,6 +1993,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2150,6 +2234,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2204,6 +2291,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2282,6 +2372,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2348,6 +2441,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2421,6 +2517,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2484,6 +2583,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2540,6 +2642,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2652,6 +2757,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2702,6 +2810,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2775,6 +2886,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2832,6 +2946,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2893,6 +3010,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3203,7 +3323,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]);
   *
@@ -3261,6 +3384,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3328,6 +3454,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3408,6 +3537,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3475,6 +3607,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3543,6 +3678,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3652,6 +3790,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3701,6 +3842,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3754,6 +3898,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3958,6 +4105,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4052,6 +4202,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
@@ -4165,6 +4373,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4240,6 +4451,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4298,6 +4512,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4376,6 +4593,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+