data-structure-typed 2.5.3 → 2.6.0

package/dist/esm-legacy/priority-queue.mjs

@@ -183,6 +183,35 @@ var _IterableElementBase = class _IterableElementBase {
     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.
    *
@@ -331,6 +360,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -422,6 +454,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -483,6 +518,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -577,6 +615,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 {
@@ -660,6 +701,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -764,6 +808,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -815,6 +862,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -859,6 +909,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -910,6 +963,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1013,6 +1069,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1097,6 +1156,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1154,6 +1216,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1210,6 +1275,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1273,6 +1341,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

package/dist/esm-legacy/queue.mjs

@@ -158,6 +158,35 @@ var _IterableElementBase = class _IterableElementBase {
     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.
    *
@@ -466,6 +495,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;
+  }
 };
 __name(_LinearBase, "LinearBase");
 var LinearBase = _LinearBase;
@@ -764,6 +803,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -835,6 +877,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -912,6 +957,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -970,6 +1018,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1089,6 +1140,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1152,6 +1206,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1204,6 +1261,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1262,6 +1322,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1325,6 +1388,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1396,6 +1462,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1444,6 +1513,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1498,6 +1570,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1718,6 +1793,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1776,6 +1854,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1862,6 +1943,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2100,6 +2184,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2154,6 +2241,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2232,6 +2322,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2298,6 +2391,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2371,6 +2467,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2434,6 +2533,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2490,6 +2592,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2602,6 +2707,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2652,6 +2760,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2725,6 +2836,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2782,6 +2896,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2843,6 +2960,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3153,7 +3273,10 @@ var _Deque = class _Deque extends LinearBase {
   }
   /**
     * Deque peek at both ends
-    * @example
+   
+    
+    
+     * @example
   * // Deque peek at both ends
   *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
   *
@@ -3211,6 +3334,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3278,6 +3404,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3358,6 +3487,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3425,6 +3557,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3493,6 +3628,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3602,6 +3740,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3651,6 +3792,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3704,6 +3848,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3908,6 +4055,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4002,6 +4152,64 @@ var _Deque = class _Deque 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
@@ -4115,6 +4323,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4190,6 +4401,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4248,6 +4462,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4326,6 +4543,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+