max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -136,7 +136,7 @@ export declare class BinaryTreeNode<K = any, V = any> {
  *       node?: BinaryTreeNode<string> | null,
  *       conditions?: { [key: string]: boolean }
  *     ): string {
- *       if (!node) throw new Error('Invalid node');
+ *       if (!node) raise(Error, 'Invalid node');
  *
  *       // If it's a leaf node, return the decision result
  *       if (!node.left && !node.right) return node.key;
@@ -181,7 +181,7 @@ export declare class BinaryTreeNode<K = any, V = any> {
  *         case '/':
  *           return rightValue !== 0 ? leftValue / rightValue : 0; // Handle division by zero
  *         default:
- *           throw new Error(`Unsupported operator: ${node.key}`);
+ *           raise(Error, `Unsupported operator: ${node.key}`);
  *       }
  *     }
  *
@@ -380,6 +380,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -429,6 +432,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -490,6 +496,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -527,6 +536,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -569,6 +581,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -623,6 +638,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -656,6 +674,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -702,6 +723,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -747,6 +771,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -793,6 +820,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -840,6 +870,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -903,6 +936,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -945,6 +981,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -995,6 +1034,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1041,6 +1083,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1087,6 +1132,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1158,6 +1206,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1201,6 +1252,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1264,6 +1318,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1303,6 +1360,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1344,6 +1404,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
    
    
    
@@ -1387,6 +1450,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1432,6 +1498,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1480,6 +1549,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -1532,6 +1604,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      

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

@@ -254,6 +254,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | BSTNode | [K | null | undefined, V | undefined] | null | undefined | R>, options?: BSTOptions<K, V, R>);
     protected _root?: BSTNode<K, V>;
+    protected _enableOrderStatistic: boolean;
     /**
      * Gets the root node of the tree.
      * @remarks Time O(1)
@@ -367,6 +368,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -433,6 +440,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -502,6 +515,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -582,6 +601,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -646,6 +671,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -691,6 +722,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
    
    
    
@@ -702,6 +736,69 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    */
     rangeSearch(range: Range<K> | [K, K]): (K | undefined)[];
     rangeSearch<C extends NodeCallback<BSTNode<K, V>>>(range: Range<K> | [K, K], callback: C, startNode?: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>[];
+    /**
+     * Returns the element at the k-th position in tree order (0-indexed).
+     * @remarks Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+     * Tree order is defined by the comparator — ascending by default, but respects custom comparators (e.g. descending).
+     *
+     * @param k - The 0-based position in tree order (0 = first element).
+     * @returns The key at position k, or `undefined` if out of bounds.
+      * @example
+   * // Order-statistic on BST
+   *  const tree = new BST<number>([30, 10, 50, 20, 40], { enableOrderStatistic: true });
+   *       console.log(tree.getByRank(0)); // 10;
+   *       console.log(tree.getByRank(4)); // 50;
+   *       console.log(tree.getRank(30)); // 2;
+     */
+    getByRank(k: number): K | undefined;
+    /**
+     * Returns the element at the k-th position in tree order and applies a callback.
+     * @remarks Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+     *
+     * @param k - The 0-based position in tree order (0 = first element).
+     * @param callback - Callback to apply to the found node.
+     * @param iterationType - Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+     * @returns The callback result, or `undefined` if out of bounds.
+     */
+    getByRank<C extends NodeCallback<BSTNode<K, V>>>(k: number, callback: C, iterationType?: IterationType): ReturnType<C> | undefined;
+    /**
+     * Returns the 0-based rank of a key (number of elements that precede it in tree order).
+     * @remarks Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+     * Tree order is defined by the comparator. When the key is not found, returns the insertion position.
+     *
+     * @param keyNodeEntryOrPredicate - The key, node, entry `[K, V]`, or predicate to find.
+     * @returns The rank (0-indexed), or -1 if the tree is empty or input is invalid.
+     */
+    getRank(keyNodeEntryOrPredicate: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BSTNode<K, V>>): number;
+    /**
+     * Returns the 0-based rank (number of preceding elements in tree order) with explicit iteration type.
+     * @remarks Time O(log n), Space O(1) iterative / O(log n) recursive. Requires `enableOrderStatistic: true`.
+     *
+     * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate to find.
+     * @param iterationType - Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+     * @returns The rank (0-indexed), or -1 if the tree is empty or input is invalid.
+     */
+    getRank(keyNodeEntryOrPredicate: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BSTNode<K, V>>, iterationType: IterationType): number;
+    /**
+     * Returns elements by position range in tree order (0-indexed, inclusive on both ends).
+     * @remarks Time O(log n + k), Space O(k), where k = end - start + 1. Requires `enableOrderStatistic: true`.
+     *
+     * @param start - Start position (inclusive, 0-indexed). Clamped to 0 if negative.
+     * @param end - End position (inclusive, 0-indexed). Clamped to size-1 if too large.
+     * @returns Array of keys in tree order within the specified range.
+     */
+    rangeByRank(start: number, end: number): (K | undefined)[];
+    /**
+     * Returns elements by position range in tree order with callback and optional iteration type.
+     * @remarks Time O(log n + k), Space O(k), where k = end - start + 1. Requires `enableOrderStatistic: true`.
+     *
+     * @param start - Start rank (inclusive, 0-indexed).
+     * @param end - End rank (inclusive, 0-indexed).
+     * @param callback - Callback to apply to each node in the range.
+     * @param iterationType - Iteration strategy ('ITERATIVE' or 'RECURSIVE').
+     * @returns Array of callback results for nodes in the rank range.
+     */
+    rangeByRank<C extends NodeCallback<BSTNode<K, V>>>(start: number, end: number, callback: C, iterationType?: IterationType): ReturnType<C>[];
     /**
      * Adds a new node to the BST based on key comparison.
      * @remarks Time O(log N), where H is tree height. O(N) worst-case (unbalanced tree), O(log N) average. Space O(1).
@@ -787,6 +884,15 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -862,6 +968,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -910,6 +1022,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -961,6 +1076,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -1011,6 +1129,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -1062,6 +1183,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -1113,6 +1237,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -1159,6 +1286,9 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
      
      
      
@@ -1235,6 +1365,12 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1412,6 +1548,41 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      *
      * @param v - The node to set as root.
      */
+    /**
+     * (Protected) Recalculates the subtree count for a single node.
+     * @remarks Time O(1). Only active when enableOrderStatistic is true.
+     */
+    protected _updateCount(node: BSTNode<K, V>): void;
+    /**
+     * (Protected) Updates subtree counts from a node up to the root.
+     * @remarks Time O(log n). Only active when enableOrderStatistic is true.
+     */
+    protected _updateCountAlongPath(node: OptNode<BSTNode<K, V>>): void;
+    /**
+     * (Protected) Finds the node at position k in tree order (iterative).
+     * @remarks Time O(log n), Space O(1)
+     */
+    protected _getByRankIterative(node: OptNode<BSTNode<K, V>>, k: number): BSTNode<K, V> | undefined;
+    /**
+     * (Protected) Finds the node at position k in tree order (recursive).
+     * @remarks Time O(log n), Space O(log n) call stack
+     */
+    protected _getByRankRecursive(node: OptNode<BSTNode<K, V>>, k: number): BSTNode<K, V> | undefined;
+    /**
+     * (Protected) Computes the rank of a key iteratively.
+     * @remarks Time O(log n), Space O(1)
+     */
+    protected _getRankIterative(node: OptNode<BSTNode<K, V>>, key: K): number;
+    /**
+     * (Protected) Computes the rank of a key recursively.
+     * @remarks Time O(log n), Space O(log n) call stack
+     */
+    protected _getRankRecursive(node: OptNode<BSTNode<K, V>>, key: K): number;
+    /**
+     * (Protected) Finds the in-order successor of a node.
+     * @remarks Time O(log n), Space O(1)
+     */
+    protected _next(node: BSTNode<K, V>): BSTNode<K, V> | undefined;
     protected _setRoot(v: OptNode<BSTNode<K, V>>): void;
     /**
      * (Protected) Compares two keys using the tree's comparator and reverse setting.

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

@@ -330,6 +330,18 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -556,6 +568,18 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -702,6 +726,18 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -816,6 +852,15 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -941,6 +986,18 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -73,6 +73,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
      
      
      
@@ -131,6 +134,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
      
      
      
@@ -185,6 +191,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
      
      
      
@@ -234,6 +243,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
      
      
      
@@ -278,6 +290,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
      
      
      
@@ -325,6 +340,9 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+