max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -185,6 +185,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -234,6 +237,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -303,6 +309,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -364,6 +373,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -434,6 +446,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -492,6 +507,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -543,6 +561,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -643,6 +664,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -688,6 +712,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -762,6 +789,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -814,6 +844,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -870,6 +903,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    

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

@@ -190,6 +190,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -255,6 +258,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -303,6 +309,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -351,6 +360,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -408,6 +420,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -482,6 +497,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -558,6 +576,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -603,6 +624,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -654,6 +678,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -727,6 +754,9 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    

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.
@@ -312,6 +312,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -383,6 +386,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -441,6 +447,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -494,6 +503,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -539,6 +551,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -588,6 +603,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -724,6 +742,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -801,6 +822,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -859,6 +883,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -940,6 +967,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -989,6 +1019,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1039,6 +1072,9 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1074,7 +1110,7 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
     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);
     }

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>`.