tree-multimap-typed 2.5.2 → 2.5.3

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

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { BST } from './bst';
-import type { AVLTreeOptions, BinaryTreeDeleteResult, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
+import type { AVLTreeOptions, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 /**
  * Represents a Node in an AVL (Adelson-Velsky and Landis) Tree.
@@ -382,6 +382,22 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -505,6 +521,18 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -525,7 +553,7 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
    *     console.log(avl.has(3)); // false;
    *     console.log(avl.size); // 6;
      */
-    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): BinaryTreeDeleteResult<AVLTreeNode<K, V>>[];
+    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
      * Rebuilds the tree to be perfectly balanced.
      * @remarks AVL trees are already height-balanced, but this makes them *perfectly* balanced (minimal height and all leaves at N or N-1).
@@ -584,6 +612,14 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -695,6 +731,18 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      

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

@@ -82,6 +82,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -155,6 +163,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -227,6 +243,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -300,6 +324,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -371,6 +403,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -445,6 +485,14 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -487,6 +535,10 @@ export declare class BinaryIndexedTree implements Iterable<number> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -527,6 +579,10 @@ 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.
@@ -382,6 +382,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -399,7 +403,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.
@@ -434,6 +438,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -498,6 +506,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -538,6 +550,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -583,6 +599,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -597,19 +617,24 @@ 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 +677,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
   
@@ -676,6 +701,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -725,6 +754,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -739,7 +772,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.
@@ -773,6 +806,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -786,7 +823,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).
@@ -822,6 +859,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -836,7 +877,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.
@@ -872,6 +913,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -938,6 +983,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -983,6 +1032,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1036,6 +1089,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1085,6 +1142,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1134,6 +1195,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1208,6 +1273,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1254,6 +1323,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1320,6 +1393,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1362,6 +1439,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1406,6 +1487,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1452,6 +1537,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1500,6 +1589,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1551,6 +1644,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1606,6 +1703,10 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      
      
      
+     
+     
+     
+