max-priority-queue-typed 2.5.2 → 2.6.0

package/dist/types/data-structures/matrix/matrix.d.ts

@@ -169,6 +169,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -233,6 +240,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -289,6 +303,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -354,6 +375,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -402,6 +430,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -465,6 +500,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -524,6 +566,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -576,6 +625,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/queue/deque.d.ts

@@ -197,6 +197,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -216,6 +219,32 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
    *     // 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(): E | undefined;
+    /**
+   * Deque peek at both ends
+  
+   
+   
+    * @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;
+   */
     get first(): E | undefined;
     /**
      * Get the last element without removing it.
@@ -248,6 +277,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -306,6 +342,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -365,6 +408,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -411,6 +461,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -458,6 +515,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -526,6 +590,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -569,6 +640,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -613,6 +691,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -706,6 +791,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -769,6 +861,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -793,6 +889,53 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
    *     }
    *     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: (value: E, index: number, deque: this) => boolean): E | undefined;
+    /**
+     * 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: (value: E, index: number, deque: this) => boolean): number;
+    /**
+   * Deque for...of iteration and reverse
+  
+   
+    * @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'];
+   */
     reverse(): this;
     /**
      * Deduplicate consecutive equal elements in-place.
@@ -844,6 +987,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -891,6 +1041,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -939,6 +1096,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -995,6 +1159,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/queue/queue.d.ts

@@ -154,6 +154,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -202,6 +209,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -217,6 +231,12 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
    *     console.log(q.length); // 3;
      */
     get first(): E | undefined;
+    /**
+     * Peek at the front element without removing it (alias for `first`).
+     * @remarks Time O(1), Space O(1)
+     * @returns Front element or undefined.
+     */
+    peek(): E | undefined;
     /**
      * Get the last element (back) without removing it.
      * @remarks Time O(1), Space O(1)
@@ -262,6 +282,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -322,6 +349,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -380,6 +414,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -433,6 +474,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -477,6 +525,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -515,6 +570,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      * @returns True if updated.
      */
     setAt(index: number, newElement: E): boolean;
+    /**
+     * 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: (value: E, index: number, queue: this) => boolean): boolean;
     /**
      * Reverse the queue in-place by compacting then reversing.
      * @remarks Time O(N), Space O(N)
@@ -550,6 +612,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -593,6 +662,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -648,6 +724,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -696,6 +779,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -744,6 +834,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/stack/stack.d.ts

@@ -176,6 +176,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -232,6 +239,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -279,6 +293,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -326,6 +347,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -381,6 +409,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -445,6 +480,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -464,9 +506,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      * Delete the element at an index.
      * @remarks Time O(N), Space O(1)
      * @param index - Zero-based index from the bottom.
-     * @returns True if removed.
+     * @returns The removed element, or undefined if the index is out of range.
      */
-    deleteAt(index: number): boolean;
+    deleteAt(index: number): E | undefined;
     /**
      * Delete the first element that satisfies a predicate.
      * @remarks Time O(N), Space O(1)
@@ -503,6 +545,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -547,6 +596,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -595,6 +651,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -651,6 +714,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+