max-priority-queue-typed 2.5.0 → 2.5.2

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

@@ -229,6 +229,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // basic Trie creation and add words
    *  // Create a simple Trie with initial words
@@ -259,6 +283,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Add multiple words
    *  const trie = new Trie();
@@ -284,6 +332,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check if a word exists
    *  const dict = new Trie(['apple', 'app', 'application']);
@@ -305,6 +377,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check if empty
    *  const trie = new Trie();
@@ -325,6 +421,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove all words
    *  const trie = new Trie(['a', 'b', 'c']);
@@ -348,6 +468,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Trie delete and iteration
    *  const trie = new Trie(['car', 'card', 'care', 'careful', 'can', 'cat']);
@@ -396,6 +540,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check if a prefix exists
    *  const trie = new Trie(['hello', 'help', 'world']);
@@ -427,6 +595,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find shared prefix
    *  const trie = new Trie(['flower', 'flow', 'flight']);
@@ -452,6 +644,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Trie getWords and prefix search
    *  const trie = new Trie(['apple', 'app', 'apply', 'application', 'apricot']);
@@ -477,6 +693,30 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Create independent copy
    *  const trie = new Trie(['hello', 'world']);
@@ -499,13 +739,37 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Filter words
    *  const trie = new Trie(['cat', 'car', 'dog', 'card']);
    *     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
   
@@ -516,13 +780,37 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Transform words
  *  const trie = new Trie(['hello', 'world']);
  *     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 +821,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 +829,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/binary-tree/bst.d.ts

@@ -3,6 +3,7 @@ import type { Comparator, OptValue } from '../../common';
 type BSTBaseOptions<K, V, R> = Omit<BinaryTreeOptions<K, V, R>, 'isDuplicate'>;
 export type BSTOptions<K, V, R> = BSTBaseOptions<K, V, R> & {
     comparator?: Comparator<K>;
+    enableOrderStatistic?: boolean;
 };
 export type BSTNOptKey<K> = K | undefined;
 export type OptNode<NODE> = NODE | undefined;

package/dist/types/types/data-structures/binary-tree/tree-map.d.ts

@@ -8,6 +8,11 @@ export interface TreeMapOptions<K, V, R = [K, V]> {
      * - `false`: store values on tree nodes (Node Mode).
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     * When true, subtree counts are maintained on every node.
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into `[key, value]` entries.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<[K, V]>`.

package/dist/types/types/data-structures/binary-tree/tree-multi-set.d.ts

@@ -8,6 +8,10 @@ export interface TreeMultiSetOptions<K, R = K> {
      * - `false`: Node Mode.
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into keys.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<K>`.

package/dist/types/types/data-structures/binary-tree/tree-set.d.ts

@@ -8,6 +8,10 @@ export interface TreeSetOptions<K, R = K> {
      * - `false`: store values on tree nodes (Node Mode).
      */
     isMapMode?: boolean;
+    /**
+     * Enable order-statistic operations (select, rank, rangeByRank).
+     */
+    enableOrderStatistic?: boolean;
     /**
      * Transform raw elements into keys.
      * When provided, the constructor accepts `Iterable<R>` instead of `Iterable<K>`.

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;