data-structure-typed 2.5.3 → 2.6.1

package/dist/cjs/priority-queue.cjs

@@ -186,6 +186,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.
    *
@@ -326,6 +355,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -416,6 +448,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -477,6 +512,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -571,6 +609,9 @@ var Heap = class _Heap extends IterableElementBase {
     */
   /**
     * @deprecated Use `pop` instead. Will be removed in a future major version.
+    
+    
+    
      * @example
   * // Heap with custom comparator (MaxHeap behavior)
   *  interface Task {
@@ -654,6 +695,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -758,6 +802,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -809,6 +856,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -853,6 +903,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -904,6 +957,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1007,6 +1063,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1091,6 +1150,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1148,6 +1210,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1204,6 +1269,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1267,6 +1335,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

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 {
@@ -770,6 +809,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -841,6 +883,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -917,6 +962,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -975,6 +1023,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1094,6 +1145,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1157,6 +1211,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1209,6 +1266,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1267,6 +1327,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1330,6 +1393,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1401,6 +1467,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1449,6 +1518,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1503,6 +1575,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1723,6 +1798,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1781,6 +1859,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1867,6 +1948,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2106,6 +2190,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2160,6 +2247,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2238,6 +2328,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2304,6 +2397,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2377,6 +2473,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2440,6 +2539,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2496,6 +2598,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2608,6 +2713,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2658,6 +2766,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2731,6 +2842,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2788,6 +2902,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2849,6 +2966,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3159,7 +3279,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]);
   *
@@ -3217,6 +3340,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3284,6 +3410,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3364,6 +3493,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3431,6 +3563,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3499,6 +3634,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3608,6 +3746,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3657,6 +3798,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3710,6 +3854,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3914,6 +4061,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4008,6 +4158,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
@@ -4121,6 +4329,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4196,6 +4407,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4254,6 +4468,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4332,6 +4549,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+