max-priority-queue-typed 2.5.1 → 2.5.3

package/src/data-structures/binary-tree/red-black-tree.ts

@@ -7,7 +7,7 @@
  */
 
 import type {
-  BinaryTreeDeleteResult, BTNRep,
+  BTNRep,
   CRUD,
   EntryCallback,
   FamilyPosition, NodePredicate,
@@ -332,14 +332,36 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
   }
 
   /**
-   * Remove all nodes and clear the key→value store (if in map mode).
+   * Remove all nodes, clear the key→value store (if in map mode) and internal caches.
    * @remarks Time O(n), Space O(1)
-   * @returns void
-   */
-
-  /**
-   * Remove all nodes and clear internal caches.
-   * @remarks Time O(n) average, Space O(1)
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -554,6 +576,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     node.left = NIL;
     node.right = NIL;
     node.color = 'RED';
+    this._updateCountAlongPath(node);
     this._insertFixup(node);
     if (this.isRealNode(this._root)) this._root.color = 'BLACK';
   }
@@ -684,6 +707,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     newNode.right = NIL;
     newNode.color = 'RED';
 
+    this._updateCountAlongPath(newNode);
     this._insertFixup(newNode);
     if (this.isRealNode(this._root)) this._root.color = 'BLACK';
     else return undefined;
@@ -956,6 +980,34 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1156,6 +1208,34 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1186,16 +1266,15 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    */
   override delete(
     keyNodeEntryRawOrPredicate: BTNRep<K, V, RedBlackTreeNode<K, V>> | NodePredicate<RedBlackTreeNode<K, V> | null>
-  ): BinaryTreeDeleteResult<RedBlackTreeNode<K, V>>[] {
-    if (keyNodeEntryRawOrPredicate === null) return [];
+  ): boolean {
+    if (keyNodeEntryRawOrPredicate === null) return false;
 
-    const results: BinaryTreeDeleteResult<RedBlackTreeNode<K, V>>[] = [];
     let nodeToDelete: OptNode<RedBlackTreeNode<K, V>>;
     if (this._isPredicate(keyNodeEntryRawOrPredicate)) nodeToDelete = this.getNode(keyNodeEntryRawOrPredicate);
     else nodeToDelete = this.isRealNode(keyNodeEntryRawOrPredicate) ? keyNodeEntryRawOrPredicate : this.getNode(keyNodeEntryRawOrPredicate);
 
     if (!nodeToDelete) {
-      return results;
+      return false;
     }
 
     // Track min/max cache updates before structural modifications.
@@ -1245,6 +1324,9 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     if (this._isMapMode) this._store.delete(nodeToDelete.key);
     this._size--;
 
+    // Update order-statistic counts from replacement up to root
+    this._updateCountAlongPath(replacementNode?.parent as RedBlackTreeNode<K, V> | undefined ?? replacementNode);
+
     // Update min/max caches.
     if (this._size <= 0) {
       this._setMinCache(undefined);
@@ -1265,9 +1347,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
       this._deleteFixup(replacementNode);
     }
 
-    results.push({ deleted: nodeToDelete, needBalanced: undefined });
-
-    return results;
+    return true;
   }
 
   /**
@@ -1352,6 +1432,27 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1493,6 +1594,34 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1632,6 +1761,9 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     node.right = NIL;
     node.color = 'RED';
 
+    // Update counts along insertion path before fixup
+    this._updateCountAlongPath(node);
+
     this._insertFixup(node);
     return 'CREATED';
   }
@@ -1835,6 +1967,10 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
 
     y.left = x;
     x.parent = y;
+
+    // Update counts: x first (now child), then y (now parent)
+    this._updateCount(x);
+    this._updateCount(y);
   }
 
   /**
@@ -1867,5 +2003,9 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
 
     x.right = y;
     y.parent = x;
+
+    // Update counts: y first (now child), then x (now parent)
+    this._updateCount(y);
+    this._updateCount(x);
   }
 }

package/src/data-structures/binary-tree/segment-tree.ts

@@ -102,6 +102,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -174,6 +181,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -241,6 +255,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -315,6 +336,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -365,6 +393,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -454,6 +489,13 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
+   
+   
+