binary-tree-typed 2.5.1 → 2.5.3

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

@@ -166,6 +166,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -227,6 +234,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -280,6 +294,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -342,6 +363,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -387,6 +415,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -447,6 +482,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -503,6 +545,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -552,6 +601,13 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -191,6 +191,12 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -213,6 +219,29 @@ 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.
@@ -242,6 +271,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -297,6 +333,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -353,6 +396,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -396,6 +446,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -440,6 +497,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -505,6 +569,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -545,6 +616,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -586,6 +664,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -676,6 +761,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -733,6 +825,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -808,6 +907,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -852,6 +958,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -897,6 +1010,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -950,6 +1070,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -151,6 +151,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -196,6 +203,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -211,6 +225,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)
@@ -253,6 +273,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -310,6 +337,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -365,6 +399,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -415,6 +456,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -456,6 +504,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -494,6 +549,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)
@@ -526,6 +588,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -566,6 +635,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -618,6 +694,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -663,6 +746,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -708,6 +798,13 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -173,6 +173,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -226,6 +233,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -270,6 +284,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -314,6 +335,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -366,6 +394,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -427,6 +462,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -446,9 +488,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)
@@ -482,6 +524,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -523,6 +572,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -568,6 +624,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -621,6 +684,13 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+