data-structure-typed 2.5.2 → 2.5.3

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,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.
@@ -251,6 +277,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -309,6 +339,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -368,6 +402,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -414,6 +452,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -461,6 +503,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -529,6 +575,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -572,6 +622,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -616,6 +670,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -709,6 +767,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -769,6 +831,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -847,6 +913,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -894,6 +964,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -942,6 +1016,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -998,6 +1076,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -157,6 +157,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -205,6 +209,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -217,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)
@@ -265,6 +279,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -325,6 +343,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -383,6 +405,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -436,6 +462,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -480,6 +510,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -515,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)
@@ -553,6 +594,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -596,6 +641,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -651,6 +700,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -699,6 +752,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -747,6 +804,10 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -179,6 +179,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -235,6 +239,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -282,6 +290,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -329,6 +341,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -384,6 +400,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -448,6 +468,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -464,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)
@@ -506,6 +530,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -550,6 +578,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -598,6 +630,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -654,6 +690,10 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -248,6 +248,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -302,6 +306,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -351,6 +359,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -396,6 +408,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -440,6 +456,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -487,6 +507,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -559,6 +583,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -614,6 +642,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -663,6 +695,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -712,6 +748,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -758,6 +798,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -799,6 +843,10 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
    
    
    

package/dist/types/interfaces/binary-tree.d.ts

@@ -1,5 +1,5 @@
 import { BinaryTreeNode } from '../data-structures';
-import type { BinaryTreeDeleteResult, BinaryTreeOptions, BTNRep, DFSOrderPattern, EntryCallback, IterationType, NodeCallback, NodePredicate, OptNodeOrNull, ReduceEntryCallback, ToEntryFn } from '../types';
+import type { BinaryTreeOptions, BTNRep, DFSOrderPattern, EntryCallback, IterationType, NodeCallback, NodePredicate, OptNodeOrNull, ReduceEntryCallback, ToEntryFn } from '../types';
 /**
  * Public, implementation-agnostic binary tree API.
  * K = key, V = value, R = raw/record used with toEntryFn (optional).
@@ -19,7 +19,7 @@ export interface IBinaryTree<K = any, V = any, R = any> {
     add(keyOrNodeOrEntryOrRawElement: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V, count?: number): boolean;
     set(keyOrNodeOrEntryOrRawElement: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V, count?: number): boolean;
     addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): boolean[];
-    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): boolean;
     clear(): void;
     isEmpty(): boolean;
     get(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): V | undefined;
@@ -56,5 +56,4 @@ export interface IBinaryTree<K = any, V = any, R = any> {
     filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): this;
     map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): IBinaryTree<MK, MV, MR>;
     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;
 }