data-structure-typed 2.5.3 → 2.6.1

package/dist/esm/priority-queue.mjs

@@ -184,6 +184,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.
    *
@@ -324,6 +353,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -414,6 +446,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -475,6 +510,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -569,6 +607,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 {
@@ -652,6 +693,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -756,6 +800,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -807,6 +854,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -851,6 +901,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -902,6 +955,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1005,6 +1061,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1089,6 +1148,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1146,6 +1208,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1202,6 +1267,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1265,6 +1333,9 @@ var Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

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 {
@@ -768,6 +807,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -839,6 +881,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -915,6 +960,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -973,6 +1021,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1092,6 +1143,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1155,6 +1209,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1207,6 +1264,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1265,6 +1325,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1328,6 +1391,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1399,6 +1465,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1447,6 +1516,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1501,6 +1573,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1721,6 +1796,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1779,6 +1857,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1865,6 +1946,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2104,6 +2188,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2158,6 +2245,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2236,6 +2326,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2302,6 +2395,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2375,6 +2471,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2438,6 +2537,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2494,6 +2596,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2606,6 +2711,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2656,6 +2764,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2729,6 +2840,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2786,6 +2900,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2847,6 +2964,9 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3157,7 +3277,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]);
   *
@@ -3215,6 +3338,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3282,6 +3408,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3362,6 +3491,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3429,6 +3561,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3497,6 +3632,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3606,6 +3744,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3655,6 +3796,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3708,6 +3852,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3912,6 +4059,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4006,6 +4156,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
@@ -4119,6 +4327,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4194,6 +4405,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4252,6 +4466,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4330,6 +4547,9 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+