data-structure-typed 2.5.1 → 2.5.3

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

@@ -189,6 +189,13 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -212,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.
@@ -239,6 +269,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -293,6 +331,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -348,6 +394,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -390,6 +444,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -433,6 +495,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -497,6 +567,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -536,6 +614,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -576,6 +662,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -665,6 +759,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -721,6 +823,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -795,6 +905,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -838,6 +956,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -882,6 +1008,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -934,6 +1068,14 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -149,6 +149,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -193,6 +201,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -209,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)
@@ -249,6 +271,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -305,6 +335,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -359,6 +397,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -408,6 +454,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -448,6 +502,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -487,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)
@@ -517,6 +586,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -556,6 +633,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -607,6 +692,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -651,6 +744,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -695,6 +796,14 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -171,6 +171,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -223,6 +231,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -266,6 +282,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -309,6 +333,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -360,6 +392,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -420,6 +460,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -440,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)
@@ -474,6 +522,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -514,6 +570,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -558,6 +622,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -610,6 +682,14 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+