data-structure-typed 2.5.0 → 2.5.1

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

@@ -159,6 +159,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get number of elements
@@ -191,6 +211,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if stack has elements
@@ -214,6 +254,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // View the top element without removing it
@@ -237,6 +297,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // basic Stack creation and push operation
@@ -268,6 +348,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Stack pop operation (LIFO - Last In First Out)
@@ -308,6 +408,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove element
@@ -342,6 +462,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all elements
@@ -362,6 +502,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -386,6 +546,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Filter elements
@@ -418,6 +598,26 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Transform elements

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

@@ -228,6 +228,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // basic Trie creation and add words
@@ -258,6 +278,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Add multiple words
@@ -283,6 +323,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if a word exists
@@ -304,6 +364,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if empty
@@ -324,6 +404,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove all words
@@ -347,6 +447,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Trie delete and iteration
@@ -395,6 +515,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Check if a prefix exists
@@ -426,6 +566,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find shared prefix
@@ -451,6 +611,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Trie getWords and prefix search
@@ -476,6 +656,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Create independent copy
@@ -498,6 +698,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Filter words
@@ -505,7 +725,7 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
    *     const result = trie.filter(w => w.startsWith('ca'));
    *     console.log(result.size); // 3;
      */
-    filter(predicate: ElementCallback<string, R, boolean>, thisArg?: any): this;
+    filter(predicate: ElementCallback<string, R, boolean>, thisArg?: unknown): this;
     /**
    * Transform words
   
@@ -515,6 +735,26 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // Transform words
@@ -522,7 +762,7 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
  *     const upper = trie.map(w => w.toUpperCase());
  *     console.log(upper.has('HELLO')); // true;
    */
-    map<RM>(callback: ElementCallback<string, R, string>, options?: TrieOptions<RM>, thisArg?: any): Trie<RM>;
+    map<RM>(callback: ElementCallback<string, R, string>, options?: TrieOptions<RM>, thisArg?: unknown): Trie<RM>;
     /**
      * Map words into a new trie (possibly different record type).
      * @remarks Time O(ΣL), Space O(ΣL)
@@ -533,7 +773,7 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new Trie constructed from mapped words.
      */
-    map<EM, RM>(callback: ElementCallback<string, R, EM>, options?: TrieOptions<RM>, thisArg?: any): IterableElementBase<EM, RM>;
+    map<EM, RM>(callback: ElementCallback<string, R, EM>, options?: TrieOptions<RM>, thisArg?: unknown): IterableElementBase<EM, RM>;
     /**
      * Map words into a new trie of the same element type.
      * @remarks Time O(ΣL), Space O(ΣL)
@@ -541,7 +781,7 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new trie with mapped words.
      */
-    mapSame(callback: ElementCallback<string, R, string>, thisArg?: any): this;
+    mapSame(callback: ElementCallback<string, R, string>, thisArg?: unknown): this;
     /**
      * (Protected) Create an empty instance of the same concrete class.
      * @remarks Time O(1), Space O(1)

package/dist/types/interfaces/graph.d.ts

@@ -17,5 +17,5 @@ export interface IGraph<V, E, VO, EO> {
     isEmpty(): boolean;
     clear(): void;
     clone(): this;
-    filter(...args: any[]): this;
+    filter(...args: unknown[]): this;
 }

package/dist/types/types/common.d.ts

@@ -5,10 +5,10 @@ export type Comparator<K> = (a: K, b: K) => number;
 export type DFSOrderPattern = 'PRE' | 'IN' | 'POST';
 export type NodeDisplayLayout = [string[], number, number, number];
 export interface IterableWithSize<T> extends Iterable<T> {
-    size: number | ((...args: any[]) => number);
+    size: number | ((...args: unknown[]) => number);
 }
 export interface IterableWithLength<T> extends Iterable<T> {
-    length: number | ((...args: any[]) => number);
+    length: number | ((...args: unknown[]) => number);
 }
 export type OptValue<V> = V | undefined;
 export type IterableWithSizeOrLength<T> = IterableWithSize<T> | IterableWithLength<T>;

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

@@ -1,5 +1,6 @@
 import { Comparator } from '../../common';
 import { IterableElementBaseOptions } from '../base';
+/** Configuration options for Heap and PriorityQueue. */
 export type HeapOptions<E, R> = IterableElementBaseOptions<E, R> & {
     comparator?: Comparator<E>;
 };

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

@@ -1,2 +1,3 @@
 import { HeapOptions } from '../heap';
+/** Configuration options for PriorityQueue, same as {@link HeapOptions}. */
 export type PriorityQueueOptions<E, R> = HeapOptions<E, R>;

package/dist/types/types/utils/validate-type.d.ts

@@ -1,18 +1,18 @@
 export type KeyValueObject = {
-    [key: string]: any;
+    [key: string]: unknown;
 };
 export type KeyValueObjectWithKey = {
-    [key: string]: any;
+    [key: string]: unknown;
     key: string | number | symbol;
 };
 export type NonNumberNonObjectButDefined = string | boolean | symbol | null;
 export type ObjectWithoutKey = Omit<KeyValueObject, 'key'>;
 export type ObjectWithNonNumberKey = {
-    [key: string]: any;
+    [key: string]: unknown;
     key: string | boolean | symbol | null | object | undefined;
 };
 export type ObjectWithNumberKey = {
-    [key: string]: any;
+    [key: string]: unknown;
     key: number;
 };
 export type RestrictValByKey = NonNumberNonObjectButDefined | ObjectWithoutKey | ObjectWithNonNumberKey | ObjectWithNumberKey;