data-structure-typed 2.5.2 → 2.6.0

package/dist/cjs/queue.cjs

@@ -161,6 +161,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.
    *
@@ -471,6 +500,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 {
@@ -762,6 +801,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -829,6 +875,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -901,6 +954,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -955,6 +1015,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1070,6 +1137,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1129,6 +1203,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1177,6 +1258,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1231,6 +1319,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1290,6 +1385,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1357,6 +1459,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1401,6 +1510,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1451,6 +1567,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1667,6 +1790,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1721,6 +1851,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1803,6 +1940,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2038,6 +2182,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2088,6 +2239,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2105,6 +2263,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)
@@ -2154,6 +2320,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2216,6 +2389,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2285,6 +2465,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2344,6 +2531,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2396,6 +2590,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2450,6 +2651,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)
@@ -2489,6 +2705,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2535,6 +2758,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2604,6 +2834,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2657,6 +2894,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2714,6 +2958,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2998,6 +3249,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
@@ -3050,6 +3332,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3113,6 +3402,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3189,6 +3485,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3252,6 +3555,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3316,6 +3626,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3421,6 +3738,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3466,6 +3790,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3515,6 +3846,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3715,6 +4053,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3809,6 +4154,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
@@ -3914,6 +4321,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3985,6 +4399,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4039,6 +4460,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4113,6 +4541,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+