data-structure-typed 2.5.0 → 2.5.1

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -144,6 +144,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if empty
@@ -163,6 +183,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all entries
@@ -176,7 +216,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @remarks Time O(1), Space O(1)
      * @returns True if the value is a 2-tuple.
      */
-    isEntry(rawElement: any): rawElement is [K, V];
+    isEntry(rawElement: unknown): rawElement is [K, V];
     /**
      * Insert or replace a single entry.
      * @remarks Time O(1), Space O(1)
@@ -203,6 +243,46 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
       * @example
@@ -238,6 +318,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Add multiple entries
@@ -261,6 +361,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // HashMap get and has operations
@@ -300,6 +420,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check key existence
@@ -324,6 +464,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove entries by key
@@ -353,6 +513,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -379,6 +559,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Transform all values
@@ -388,7 +588,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
    *     console.log(doubled.get('apple')); // 2;
    *     console.log(doubled.get('banana')); // 4;
      */
-    map<VM>(callbackfn: EntryCallback<K, V, VM>, thisArg?: any): any;
+    map<VM>(callbackfn: EntryCallback<K, V, VM>, thisArg?: unknown): HashMap<K, VM>;
     /**
      * Filter entries into a new map.
      * @remarks Time O(N), Space O(N)
@@ -405,6 +605,26 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // HashMap iteration and filter operations
@@ -432,7 +652,7 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
    *     console.log(values); // contains 3; // 'Bob', 'Eve'
    *     console.log(values); // contains 7;
      */
-    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): any;
+    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): any;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N), Space O(N)
@@ -443,10 +663,10 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      * @param [options] - Options forwarded to the constructor.
      * @returns A like-kind map instance.
      */
-    protected _createLike<TK = K, TV = V, TR = [TK, TV]>(entries?: Iterable<[TK, TV] | TR>, options?: any): any;
+    protected _createLike<TK = K, TV = V, TR = [TK, TV]>(entries?: Iterable<[TK, TV] | TR>, options?: Record<string, unknown>): this;
     protected _rehashNoObj(): void;
     protected _getIterator(): IterableIterator<[K, V]>;
-    protected _isObjKey(key: any): key is object | ((...args: any[]) => any);
+    protected _isObjKey(key: unknown): key is object | ((...args: unknown[]) => unknown);
     protected _getNoObjKey(key: K): string;
 }
 /**
@@ -561,10 +781,10 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      */
     deleteAt(index: number): boolean;
     isEmpty(): boolean;
-    isEntry(rawElement: any): rawElement is [K, V];
+    isEntry(rawElement: unknown): rawElement is [K, V];
     clear(): void;
-    clone(): any;
-    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: any): any;
+    clone(): this;
+    filter(predicate: EntryCallback<K, V, boolean>, thisArg?: unknown): this;
     /**
      * Map each entry to a new [key, value] pair and preserve order.
      * @remarks Time O(N), Space O(N)
@@ -574,8 +794,8 @@ export declare class LinkedHashMap<K = any, V = any, R = [K, V]> extends Iterabl
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new map of the same class with transformed entries.
      */
-    map<MK, MV>(callback: EntryCallback<K, V, [MK, MV]>, thisArg?: any): any;
+    map<MK, MV>(callback: EntryCallback<K, V, [MK, MV]>, thisArg?: unknown): LinkedHashMap<MK, MV>;
     protected _getIterator(): IterableIterator<[K, V]>;
     protected _deleteNode(node: HashMapLinkedNode<K, V | undefined>): boolean;
-    protected _createLike<TK = K, TV = V, TR = [TK, TV]>(entries?: Iterable<[TK, TV] | TR>, options?: any): any;
+    protected _createLike<TK = K, TV = V, TR = [TK, TV]>(entries?: Iterable<[TK, TV] | TR>, options?: Record<string, unknown>): this;
 }

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

@@ -175,6 +175,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Track heap capacity
@@ -229,6 +249,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // basic Heap creation and add operation
@@ -259,6 +299,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Add multiple elements
@@ -282,6 +342,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Heap with custom comparator (MaxHeap behavior)
@@ -324,6 +404,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Heap for event processing with priority
@@ -398,6 +498,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if heap is empty
@@ -419,6 +539,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all elements
@@ -440,6 +580,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @param element - Element to search for.
      * @returns True if found.
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check element existence
@@ -460,6 +620,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove specific element
@@ -488,6 +668,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @param [order] - Traversal order: 'PRE' | 'IN' | 'POST'.
      * @returns Array of visited elements.
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Depth-first traversal
@@ -516,6 +716,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Sort elements using heap
@@ -536,6 +756,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -560,6 +800,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Filter elements
@@ -584,6 +844,26 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Transform elements