max-priority-queue-typed 2.5.2 → 2.6.0

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

@@ -76,6 +76,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -149,6 +163,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -221,6 +249,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -294,6 +336,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -365,6 +421,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -439,6 +509,20 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -484,6 +568,13 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -524,6 +615,13 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

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) raise(Error, 'Invalid node');
+ *       if (!node) throw new 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:
- *           raise(Error, `Unsupported operator: ${node.key}`);
+ *           throw new Error(`Unsupported operator: ${node.key}`);
  *       }
  *     }
  *
@@ -353,7 +353,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     isValidKey(key: unknown): key is K;
     /**
      * Adds a new node to the tree.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation adds the node at the first available position in a level-order (BFS) traversal. This is NOT a Binary Search Tree insertion. Time O(N), where N is the number of nodes. It must traverse level-by-level to find an empty slot. Space O(N) in the worst case for the BFS queue (e.g., a full last level).
+     * @remarks Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
      *
      * @param keyNodeOrEntry - The key, node, or entry to add.
      * @returns True if the addition was successful, false otherwise.
@@ -379,6 +379,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -399,7 +406,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     add(keyNodeOrEntry: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
      * Adds or updates a new node to the tree.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation sets the node at the first available position in a level-order (BFS) traversal. This is NOT a Binary Search Tree insertion. Time O(N), where N is the number of nodes. It must traverse level-by-level to find an empty slot. Space O(N) in the worst case for the BFS queue (e.g., a full last level).
+     * @remarks Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
      *
      * @param keyNodeOrEntry - The key, node, or entry to set or update.
      * @param [value] - The value, if providing just a key.
@@ -431,6 +438,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -495,6 +509,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -535,6 +556,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -580,6 +608,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -597,19 +632,27 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      */
     merge(anotherTree: BinaryTree<K, V, R>): void;
     /**
-     * Clears the tree and refills it with new items.
-     * @remarks Time O(N) (for `clear`) + O(N * M) (for `setMany`) = O(N * M). Space O(M) (from `setMany`).
+     * Deletes a node from the tree (internal, returns balancing metadata).
+     * @remarks Time O(N) — O(N) to find the node + O(H) for predecessor swap. Space O(1). BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
+     * @internal Used by AVL/BST subclasses that need balancing metadata after deletion.
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to set.
-     * @param [values] - An optional parallel iterable of values.
+     * @param keyNodeEntryRawOrPredicate - The node to delete.
+     * @returns An array containing deletion results with balancing metadata.
      */
-    refill(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): void;
+    protected _deleteInternal(keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
     /**
      * Deletes a node from the tree.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation finds the node, and if it has two children, swaps it with the rightmost node of its left subtree (in-order predecessor) before deleting. Time O(N) in the worst case. O(N) to find the node (`getNode`) and O(H) (which is O(N) worst-case) to find the rightmost node. Space O(1) (if `getNode` is iterative, which it is).
+     * @remarks Time O(N) — O(N) to find the node + O(H) for predecessor swap. Space O(1). BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
      *
      * @param keyNodeEntryRawOrPredicate - The node to delete.
-     * @returns An array containing deletion results (for compatibility with self-balancing trees).
+     * @returns True if the node was found and deleted, false otherwise.
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -652,7 +695,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    *     console.log(tree.has(3)); // false;
    *     console.log(tree.size); // 4;
      */
-    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): boolean;
     /**
    * Search by predicate
   
@@ -673,6 +716,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -722,6 +772,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -739,7 +796,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     getNodes(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V>>, onlyOne?: boolean, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): BinaryTreeNode<K, V>[];
     /**
      * Gets the first node matching a predicate.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(N) in the worst case (via `search`). Space O(H) or O(N) (via `search`).
+     * @remarks Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
      *
      * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
      * @param [startNode=this._root] - The node to start the search from.
@@ -770,6 +827,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -786,7 +850,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     getNode(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V> | null>, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): BinaryTreeNode<K, V> | null | undefined;
     /**
      * Gets the value associated with a key.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(1) if in Map mode. O(N) if not in Map mode (uses `getNode`). Space O(1) if in Map mode. O(H) or O(N) otherwise.
+     * @remarks Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O(H) or O(N) otherwise. BST subclasses override non-Map-mode to O(log N).
      *
      * @param keyNodeEntryOrPredicate - The key, node, or entry to get the value for.
      * @param [startNode=this._root] - The node to start searching from (if not in Map mode).
@@ -819,6 +883,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -836,7 +907,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     get(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): V | undefined;
     /**
      * Checks if a node matching the predicate exists in the tree.
-     * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(N) in the worst case (via `search`). Space O(H) or O(N) (via `search`).
+     * @remarks Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
      *
      * @param [keyNodeEntryOrPredicate] - The key, node, entry, or predicate to check for.
      * @param [startNode] - The node to start the search from.
@@ -869,6 +940,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -935,6 +1013,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -980,6 +1065,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1033,6 +1125,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1082,6 +1181,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1131,6 +1237,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1205,6 +1318,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1251,6 +1371,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1317,6 +1444,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1359,6 +1493,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1403,6 +1544,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1449,6 +1597,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1497,6 +1652,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1548,6 +1710,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1603,6 +1772,13 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
+