max-priority-queue-typed 2.5.2 → 2.5.3

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

@@ -280,6 +280,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -300,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];
@@ -339,6 +368,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -413,6 +446,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -491,6 +528,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -556,6 +597,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -622,6 +667,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -733,6 +782,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -780,6 +833,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -831,6 +888,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1055,6 +1116,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1148,6 +1213,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1268,6 +1337,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1341,6 +1414,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1397,6 +1474,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1475,6 +1556,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    

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

@@ -187,6 +187,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -239,6 +243,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -255,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)
@@ -311,6 +328,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -375,6 +396,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -448,6 +473,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -509,6 +538,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -563,6 +596,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -622,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)
@@ -666,6 +719,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -714,6 +771,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -791,6 +852,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -846,6 +911,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -905,6 +974,10 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    

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

@@ -192,6 +192,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -260,6 +264,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -311,6 +319,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -362,6 +374,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -422,6 +438,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -499,6 +519,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -513,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];
   }
 
   /**
@@ -578,6 +602,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -626,6 +654,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -680,6 +712,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -756,6 +792,10 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    

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

@@ -314,6 +314,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -388,6 +392,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -449,6 +457,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -505,6 +517,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -553,6 +569,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -605,6 +625,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -744,6 +768,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -824,6 +852,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -885,6 +917,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -969,6 +1005,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1021,6 +1061,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1074,6 +1118,10 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    

package/src/interfaces/binary-tree.ts

@@ -1,6 +1,5 @@
 import { BinaryTreeNode } from '../data-structures';
 import type {
-  BinaryTreeDeleteResult,
   BinaryTreeOptions,
   BTNRep,
   DFSOrderPattern,
@@ -51,7 +50,7 @@ export interface IBinaryTree<K = any, V = any, R = any> {
   // Accept BTNRep, predicate, or raw R for deletion
   delete(
     keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>
-  ): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+  ): boolean;
 
   clear(): void;
 
@@ -242,11 +241,4 @@ export interface IBinaryTree<K = any, V = any, R = any> {
 
   // ---- bulk / interop ----
   merge(anotherTree: IBinaryTree<K, V, R>): void;
-
-  refill(
-    keysNodesEntriesOrRaws: Iterable<
-      K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R
-    >,
-    values?: Iterable<V | undefined>
-  ): void;
 }