max-priority-queue-typed 2.5.1 → 2.5.3

package/src/data-structures/queue/deque.ts

@@ -274,6 +274,12 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -297,6 +303,32 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
  *     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 {
+    return this.first;
+  }
+
+    /**
+   * 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 {
     if (this._length === 0) return;
     return this._buckets[this._bucketFirst][this._firstInBucket];
@@ -330,6 +362,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -401,6 +440,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -476,6 +522,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -538,6 +591,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -601,6 +661,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -709,6 +776,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -753,6 +827,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -801,6 +882,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1022,6 +1110,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1112,6 +1207,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1229,6 +1331,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1299,6 +1408,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1352,6 +1468,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1427,6 +1550,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/queue/queue.ts

@@ -181,6 +181,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -230,6 +237,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -249,6 +263,15 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
     return this.length > 0 ? this.elements[this._offset] : 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 {
+    return this.first;
+  }
+
   /**
    * Get the last element (back) without removing it.
    * @remarks Time O(1), Space O(1)
@@ -299,6 +322,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -360,6 +390,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -430,6 +467,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -488,6 +532,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -539,6 +590,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -601,6 +659,22 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
     return true;
   }
 
+  /**
+   * 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 {
+    for (let i = 0; i < this.length; i++) {
+      if (predicate(this._elements[this._offset + i], i, this)) {
+        this.deleteAt(i);
+        return true;
+      }
+    }
+    return false;
+  }
+
   /**
    * Reverse the queue in-place by compacting then reversing.
    * @remarks Time O(N), Space O(N)
@@ -639,6 +713,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -684,6 +765,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -758,6 +846,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -810,6 +905,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -866,6 +968,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/data-structures/stack/stack.ts

@@ -186,6 +186,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -251,6 +258,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -299,6 +313,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -347,6 +368,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -404,6 +432,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -478,6 +513,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -495,20 +537,20 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
 
   delete(element: E): boolean {
     const idx = this._indexOfByEquals(element);
-    return this.deleteAt(idx);
+    return this.deleteAt(idx) !== undefined;
   }
 
   /**
    * 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 {
-    if (index < 0 || index >= this.elements.length) return false;
+  deleteAt(index: number): E | undefined {
+    if (index < 0 || index >= this.elements.length) return undefined;
     const spliced = this.elements.splice(index, 1);
-    return spliced.length === 1;
+    return spliced[0];
   }
 
   /**
@@ -554,6 +596,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -599,6 +648,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -650,6 +706,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -723,6 +786,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+