max-priority-queue-typed 2.5.0 → 2.5.2

package/src/data-structures/trie/trie.ts

@@ -8,7 +8,7 @@
 
 import type { ElementCallback, TrieOptions } from '../../types';
 import { IterableElementBase } from '../base';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * Node used by Trie to store one character and its children.
@@ -295,6 +295,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // basic Trie creation and add words
  *  // Create a simple Trie with initial words
@@ -345,6 +369,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Add multiple words
  *  const trie = new Trie();
@@ -382,6 +430,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Check if a word exists
  *  const dict = new Trie(['apple', 'app', 'application']);
@@ -414,6 +486,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Check if empty
  *  const trie = new Trie();
@@ -438,6 +534,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove all words
  *  const trie = new Trie(['a', 'b', 'c']);
@@ -466,6 +586,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Trie delete and iteration
  *  const trie = new Trie(['car', 'card', 'care', 'careful', 'can', 'cat']);
@@ -581,6 +725,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Check if a prefix exists
  *  const trie = new Trie(['hello', 'help', 'world']);
@@ -637,6 +805,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find shared prefix
  *  const trie = new Trie(['flower', 'flow', 'flight']);
@@ -674,6 +866,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Trie getWords and prefix search
  *  const trie = new Trie(['apple', 'app', 'apply', 'application', 'apricot']);
@@ -734,6 +950,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Create independent copy
  *  const trie = new Trie(['hello', 'world']);
@@ -762,6 +1002,30 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Filter words
  *  const trie = new Trie(['cat', 'car', 'dog', 'card']);
@@ -769,7 +1033,7 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
  *     console.log(result.size); // 3;
    */
 
-  filter(predicate: ElementCallback<string, R, boolean>, thisArg?: any): this {
+  filter(predicate: ElementCallback<string, R, boolean>, thisArg?: unknown): this {
     const results = this._createInstance();
     let index = 0;
     for (const word of this) {
@@ -791,13 +1055,37 @@ export 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).
@@ -813,16 +1101,16 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
   map<EM, RM>(
     callback: ElementCallback<string, R, EM>,
     options?: TrieOptions<RM>,
-    thisArg?: any
+    thisArg?: unknown
   ): IterableElementBase<EM, RM>;
 
-  map<EM, RM>(callback: ElementCallback<string, R, EM>, options?: TrieOptions<RM>, thisArg?: any): any {
+  map<EM, RM>(callback: ElementCallback<string, R, EM>, options?: TrieOptions<RM>, thisArg?: unknown): any {
     const newTrie = this._createLike<RM>([], options);
     let i = 0;
     for (const x of this) {
       const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);
       if (typeof v !== 'string') {
-        throw new TypeError(ERR.callbackReturnType('string', typeof v, 'Trie.map'));
+        raise(TypeError, ERR.callbackReturnType('string', typeof v, 'Trie.map'));
       }
       newTrie.add(v);
     }
@@ -837,7 +1125,7 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    * @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 {
     const next = this._createInstance();
     let i = 0;
     for (const key of this) {

package/src/interfaces/graph.ts

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

package/src/types/common.ts

@@ -11,11 +11,11 @@ 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;

package/src/types/data-structures/binary-tree/bst.ts

@@ -5,6 +5,7 @@ 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;

package/src/types/data-structures/binary-tree/tree-map.ts

@@ -11,6 +11,12 @@ export interface TreeMapOptions<K, V, R = [K, V]> {
    */
   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/src/types/data-structures/binary-tree/tree-multi-set.ts

@@ -11,6 +11,11 @@ export interface TreeMultiSetOptions<K, R = K> {
    */
   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/src/types/data-structures/binary-tree/tree-set.ts

@@ -11,6 +11,11 @@ export interface TreeSetOptions<K, R = K> {
    */
   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/src/types/data-structures/heap/heap.ts

@@ -1,6 +1,7 @@
 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/src/types/data-structures/priority-queue/priority-queue.ts

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

package/src/types/utils/validate-type.ts

@@ -1,18 +1,18 @@
-export type KeyValueObject = { [key: string]: any };
+export type KeyValueObject = { [key: string]: unknown };
 
-export type KeyValueObjectWithKey = { [key: string]: any; key: string | number | symbol };
+export type KeyValueObjectWithKey = { [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;
 };