max-priority-queue-typed 2.5.1 → 2.5.3

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.
@@ -308,6 +308,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -379,6 +386,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -437,6 +451,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -490,6 +511,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -535,6 +563,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -584,6 +619,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -720,6 +762,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -797,6 +846,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -855,6 +911,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -936,6 +999,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -985,6 +1055,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1035,6 +1112,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1074,7 +1158,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/interfaces/binary-tree.ts

@@ -1,6 +1,5 @@
 import { BinaryTreeNode } from '../data-structures';
 import type {
-  BinaryTreeDeleteResult,
   BinaryTreeOptions,
   BTNRep,
   DFSOrderPattern,
@@ -51,7 +50,7 @@ export interface IBinaryTree<K = any, V = any, R = any> {
   // Accept BTNRep, predicate, or raw R for deletion
   delete(
     keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>
-  ): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+  ): boolean;
 
   clear(): void;
 
@@ -242,11 +241,4 @@ export interface IBinaryTree<K = any, V = any, R = any> {
 
   // ---- bulk / interop ----
   merge(anotherTree: IBinaryTree<K, V, R>): void;
-
-  refill(
-    keysNodesEntriesOrRaws: Iterable<
-      K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R
-    >,
-    values?: Iterable<V | undefined>
-  ): void;
 }

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