data-structure-typed 2.5.3 → 2.6.1

package/dist/cjs-legacy/priority-queue.cjs

@@ -185,6 +185,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.
    *
@@ -333,6 +362,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -424,6 +456,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -485,6 +520,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -579,6 +617,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 {
@@ -662,6 +703,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -766,6 +810,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -817,6 +864,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -861,6 +911,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -912,6 +965,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1015,6 +1071,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1099,6 +1158,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1156,6 +1218,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1212,6 +1277,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1275,6 +1343,9 @@ var _Heap = class _Heap extends IterableElementBase {
     
     
     
+    
+    
+    
     
     
     

package/dist/cjs-legacy/queue.cjs

@@ -160,6 +160,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.
    *
@@ -468,6 +497,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;
@@ -766,6 +805,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -837,6 +879,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -914,6 +959,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -972,6 +1020,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1091,6 +1142,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1154,6 +1208,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1206,6 +1263,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1264,6 +1324,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1327,6 +1390,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1398,6 +1464,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1446,6 +1515,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1500,6 +1572,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1720,6 +1795,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1778,6 +1856,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -1864,6 +1945,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2102,6 +2186,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2156,6 +2243,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2234,6 +2324,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2300,6 +2393,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2373,6 +2469,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2436,6 +2535,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2492,6 +2594,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2604,6 +2709,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2654,6 +2762,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2727,6 +2838,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2784,6 +2898,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -2845,6 +2962,9 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3155,7 +3275,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]);
   *
@@ -3213,6 +3336,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3280,6 +3406,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3360,6 +3489,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3427,6 +3559,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3495,6 +3630,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3604,6 +3742,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3653,6 +3794,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3706,6 +3850,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -3910,6 +4057,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4004,6 +4154,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
@@ -4117,6 +4325,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4192,6 +4403,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4250,6 +4464,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+    
     
     
     
@@ -4328,6 +4545,9 @@ var _Deque = class _Deque extends LinearBase {
     
     
     
+    
+    
+