binary-tree-typed 2.5.2 → 2.6.0

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,35 @@ 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];
@@ -336,6 +368,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -410,6 +449,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -488,6 +534,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -553,6 +606,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -619,6 +679,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -730,6 +797,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -777,6 +851,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -828,6 +909,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1052,6 +1140,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1148,6 +1243,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1173,6 +1272,66 @@ export 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 {
+    for (let i = this.length - 1; i >= 0; i--) {
+      const val = this.at(i)!;
+      if (predicate(val, i, this)) return val;
+    }
+    return 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 {
+    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
+ *  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 {
     this._buckets.reverse().forEach(function (bucket) {
       bucket.reverse();
@@ -1265,6 +1424,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1338,6 +1504,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1394,6 +1567,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1472,6 +1652,13 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -184,6 +184,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -236,6 +243,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -255,6 +269,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)
@@ -308,6 +331,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -372,6 +402,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -445,6 +482,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -506,6 +550,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -560,6 +611,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -622,6 +680,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)
@@ -663,6 +737,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -711,6 +792,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -788,6 +876,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -843,6 +938,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -902,6 +1004,13 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -189,6 +189,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -257,6 +264,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -308,6 +322,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -359,6 +380,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -419,6 +447,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -496,6 +531,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -513,20 +555,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];
   }
 
   /**
@@ -575,6 +617,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -623,6 +672,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -677,6 +733,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -753,6 +816,13 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+