max-priority-queue-typed 2.5.0 → 2.5.2

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

@@ -245,6 +245,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // basic SinglyLinkedList creation and push operation
    *  // Create a simple SinglyLinkedList with initial values
@@ -277,6 +301,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // SinglyLinkedList pop and shift operations
    *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -309,6 +357,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove from the front
    *  const list = new SinglyLinkedList<number>([10, 20, 30]);
@@ -332,6 +404,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // SinglyLinkedList unshift and forward traversal
    *  const list = new SinglyLinkedList<number>([20, 30, 40]);
@@ -391,6 +487,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Access element by index
    *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
@@ -419,6 +539,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get node at index
    *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -438,6 +582,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove by index
    *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -458,6 +626,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove first occurrence
    *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
@@ -479,6 +671,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Insert at index
    *  const list = new SinglyLinkedList<number>([1, 3]);
@@ -507,6 +723,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check empty
    *  console.log(new SinglyLinkedList().isEmpty()); // true;
@@ -525,6 +765,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove all
    *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -547,6 +811,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Reverse the list in-place
    *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
@@ -620,6 +908,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Deep copy
    *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -646,6 +958,30 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // SinglyLinkedList filter and map operations
    *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -662,7 +998,7 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
    *     const sum = list.reduce((acc, value) => acc + value, 0);
    *     console.log(sum); // 15;
      */
-    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)
@@ -670,7 +1006,7 @@ export declare class SinglyLinkedList<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)
@@ -691,13 +1027,37 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Transform elements
    *  const list = new SinglyLinkedList<number>([1, 2, 3]);
    *     const doubled = list.map(n => n * 2);
    *     console.log([...doubled]); // [2, 4, 6];
      */
-    map<EM, RM = any>(callback: ElementCallback<E, R, EM>, options?: SinglyLinkedListOptions<EM, RM>, thisArg?: any): SinglyLinkedList<EM, RM>;
+    map<EM, RM = any>(callback: ElementCallback<E, R, EM>, options?: SinglyLinkedListOptions<EM, RM>, thisArg?: unknown): SinglyLinkedList<EM, RM>;
     /**
      * (Protected) Create a node from a value.
      * @remarks Time O(1), Space O(1)