deque-typed 2.5.3 → 2.6.0

package/dist/cjs/index.cjs

@@ -218,6 +218,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.
    *
@@ -480,6 +509,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;
+  }
 };
 
 // src/data-structures/queue/deque.ts
@@ -673,7 +712,10 @@ var Deque = class extends LinearBase {
   }
   /**
     * Deque peek at both ends
-    * @example
+   
+    
+    
+     * @example
   * // Deque peek at both ends
   *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
   *
@@ -731,6 +773,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -798,6 +843,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -878,6 +926,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -945,6 +996,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1013,6 +1067,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1122,6 +1179,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1171,6 +1231,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1224,6 +1287,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1428,6 +1494,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1522,6 +1591,64 @@ 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
@@ -1635,6 +1762,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1710,6 +1840,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1768,6 +1901,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1846,6 +1982,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+