max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -446,6 +446,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -554,6 +566,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 +697,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;
@@ -964,6 +978,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1164,6 +1190,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1245,6 +1283,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);
@@ -1363,6 +1404,15 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1501,6 +1551,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1632,6 +1694,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 +1900,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 +1936,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

@@ -106,6 +106,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
    
    
    
@@ -178,6 +181,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
    
    
    
@@ -245,6 +251,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
    
    
    
@@ -319,6 +328,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
    
    
    
@@ -369,6 +381,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
    
    
    
@@ -458,6 +473,9 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+