data-structure-typed 2.5.2 → 2.6.0

package/dist/esm/queue.mjs

@@ -159,6 +159,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.
    *
@@ -469,6 +498,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 {
@@ -760,6 +799,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -827,6 +873,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -899,6 +952,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -953,6 +1013,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1068,6 +1135,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1127,6 +1201,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1175,6 +1256,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1229,6 +1317,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1288,6 +1383,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1355,6 +1457,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1399,6 +1508,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1449,6 +1565,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1665,6 +1788,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1719,6 +1849,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1801,6 +1938,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2036,6 +2180,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2086,6 +2237,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2103,6 +2261,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)
@@ -2152,6 +2318,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2214,6 +2387,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2283,6 +2463,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2342,6 +2529,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2394,6 +2588,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2448,6 +2649,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)
@@ -2487,6 +2703,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2533,6 +2756,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2602,6 +2832,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2655,6 +2892,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2712,6 +2956,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2996,6 +3247,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
@@ -3048,6 +3330,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3111,6 +3400,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3187,6 +3483,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3250,6 +3553,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3314,6 +3624,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3419,6 +3736,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3464,6 +3788,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3513,6 +3844,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3713,6 +4051,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3807,6 +4152,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
@@ -3912,6 +4319,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3983,6 +4397,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4037,6 +4458,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4111,6 +4539,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+