max-priority-queue-typed 2.5.0 → 2.5.1

package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -196,6 +196,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // basic DoublyLinkedList creation and push operation
    *  // Create a simple DoublyLinkedList with initial values
@@ -228,6 +249,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // DoublyLinkedList pop and shift operations
    *  const list = new DoublyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -260,6 +302,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove from the front
    *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -283,6 +346,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Add to the front
    *  const list = new DoublyLinkedList<number>([2, 3]);
@@ -320,6 +404,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Access by index
    *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -340,6 +445,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get node at index
    *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -367,6 +493,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Insert at position
    *  const list = new DoublyLinkedList<number>([1, 3]);
@@ -411,6 +558,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove by index
    *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -431,6 +599,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove first occurrence
    *  const list = new DoublyLinkedList<number>([1, 2, 3, 2]);
@@ -451,6 +640,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check empty
    *  console.log(new DoublyLinkedList().isEmpty()); // true;
@@ -469,6 +679,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove all
    *  const list = new DoublyLinkedList<number>([1, 2]);
@@ -489,6 +720,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Search with predicate
    *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -509,6 +761,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find value scanning from tail
    *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
@@ -532,6 +805,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Reverse in-place
    *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -559,6 +853,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Deep copy
    *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -584,13 +899,34 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Filter elements
    *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
    *     const evens = list.filter(n => n % 2 === 0);
    *     console.log([...evens]); // [2, 4];
      */
-    filter(callback: ElementCallback<E, R, boolean>, thisArg?: any): this;
+    filter(callback: ElementCallback<E, R, boolean>, thisArg?: unknown): this;
     /**
      * Map values into a new list of the same class.
      * @remarks Time O(N), Space O(N)
@@ -598,7 +934,7 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new list with mapped values.
      */
-    mapSame(callback: ElementCallback<E, R, E>, thisArg?: any): this;
+    mapSame(callback: ElementCallback<E, R, E>, thisArg?: unknown): this;
     /**
      * Map values into a new list (possibly different element type).
      * @remarks Time O(N), Space O(N)
@@ -619,6 +955,27 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // DoublyLinkedList for...of iteration and map operation
    *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -634,7 +991,7 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
    *     }
    *     console.log(result); // [1, 2, 3, 4, 5];
      */
-    map<EM, RM>(callback: ElementCallback<E, R, EM>, options?: DoublyLinkedListOptions<EM, RM>, thisArg?: any): DoublyLinkedList<EM, RM>;
+    map<EM, RM>(callback: ElementCallback<E, R, EM>, options?: DoublyLinkedListOptions<EM, RM>, thisArg?: unknown): DoublyLinkedList<EM, RM>;
     /**
      * (Protected) Create or return a node for the given input (node or raw element).
      * @remarks Time O(1), Space O(1)