data-structure-typed 2.5.0 → 2.5.1

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

@@ -176,6 +176,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Deque peek at both ends
@@ -207,6 +227,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Peek at the back element
@@ -241,6 +281,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // basic Deque creation and push/pop operations
@@ -276,6 +336,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove from the back
@@ -298,6 +378,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove from the front
@@ -321,6 +421,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Deque shift and unshift operations
@@ -365,6 +485,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if empty
@@ -384,6 +524,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all elements
@@ -404,6 +564,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Access by index
@@ -473,6 +653,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove element
@@ -509,6 +709,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Deque for...of iteration and reverse
@@ -563,6 +783,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Reclaim memory
@@ -586,6 +826,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -610,6 +870,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Filter elements
@@ -617,7 +897,7 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
    *     const result = dq.filter(x => x > 2);
    *     console.log(result.length); // 2;
      */
-    filter(predicate: ElementCallback<E, R, boolean>, thisArg?: any): this;
+    filter(predicate: ElementCallback<E, R, boolean>, thisArg?: unknown): this;
     /**
      * Map elements into a new deque of the same element type.
      * @remarks Time O(N), Space O(N)
@@ -625,7 +905,7 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new deque with mapped values.
      */
-    mapSame(callback: ElementCallback<E, R, E>, thisArg?: any): this;
+    mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;
     /**
      * Map elements into a new deque (possibly different element type).
      * @remarks Time O(N), Space O(N)
@@ -642,6 +922,26 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Transform elements
@@ -649,7 +949,7 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
    *     const result = dq.map(x => x * 10);
    *     console.log(result.toArray()); // [10, 20, 30];
      */
-    map<EM, RM>(callback: ElementCallback<E, R, EM>, options?: IterableElementBaseOptions<EM, RM>, thisArg?: any): Deque<EM, RM>;
+    map<EM, RM>(callback: ElementCallback<E, R, EM>, options?: IterableElementBaseOptions<EM, RM>, thisArg?: unknown): Deque<EM, RM>;
     /**
      * (Protected) Set the internal bucket size.
      * @remarks Time O(1), Space O(1)
@@ -696,7 +996,7 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      * @param [options] - Options forwarded to the constructor.
      * @returns A like-kind Deque instance.
      */
-    protected _createLike<T = E, RR = R>(elements?: IterableWithSizeOrLength<T> | IterableWithSizeOrLength<RR>, options?: DequeOptions<T, RR>): any;
+    protected _createLike<T = E, RR = R>(elements?: IterableWithSizeOrLength<T> | IterableWithSizeOrLength<RR>, options?: DequeOptions<T, RR>): Deque<T, RR>;
     /**
      * (Protected) Iterate elements from back to front.
      * @remarks Time O(N), Space O(1)

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

@@ -137,6 +137,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Track queue length
@@ -161,6 +181,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // View the front element
@@ -197,6 +237,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Queue for...of iteration and isEmpty check
@@ -233,6 +293,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // basic Queue creation and push operation
@@ -267,6 +347,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Queue shift and peek operations
@@ -296,6 +396,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove specific element
@@ -316,6 +436,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Access element by index
@@ -365,6 +505,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all elements
@@ -384,6 +544,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Reclaim unused memory
@@ -415,6 +595,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -439,6 +639,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Filter elements
@@ -463,6 +683,26 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Transform elements