max-priority-queue-typed 2.5.2 → 2.5.3

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

@@ -7,7 +7,6 @@
  */
 
 import type {
-  BinaryTreeDeleteResult,
   BSTNOptKeyOrNode,
   BSTOptions,
   BTNRep,
@@ -500,6 +499,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -602,6 +609,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -700,6 +715,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -713,7 +736,7 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
  * // Level-order grouping
  *  const bst = new BST<number>([5, 3, 7, 1, 4]);
  *     const levels = bst.listLevels(node => node.key);
- *     console.log(levels.length); // > 0;
+ *     console.log(levels); // toBeInstanceOf;
  *     console.log(levels[0].length); // 1; // root level has 1 node
  *     const allKeys = levels.flat().sort((a, b) => a - b);
  *     console.log(allKeys); // [1, 3, 4, 5, 7];
@@ -810,6 +833,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -939,6 +970,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1138,6 +1177,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1495,6 +1538,18 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1624,6 +1679,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1767,6 +1830,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1873,6 +1940,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -1978,6 +2049,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -2127,6 +2202,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -2332,6 +2411,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -2405,6 +2488,10 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
    
    
    
@@ -2529,6 +2616,14 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2606,16 +2701,15 @@ export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implemen
     onlyOne = false,
     startNode: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined = this._root,
     iterationType: IterationType = this.iterationType
-  ): BinaryTreeDeleteResult<BSTNode<K, V>>[] {
+  ): boolean {
     const toDelete = this.search(keyNodeEntryOrPredicate, onlyOne, node => node, startNode, iterationType);
 
-    let results: BinaryTreeDeleteResult<BSTNode<K, V>>[] = [];
+    let deleted = false;
     for (const node of toDelete) {
-      const deleteInfo = this.delete(node);
-      results = results.concat(deleteInfo);
+      if (this.delete(node)) deleted = true;
     }
 
-    return results;
+    return deleted;
   }
 
   /**

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,24 @@ 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)
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -986,6 +996,22 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1198,6 +1224,22 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1224,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.
@@ -1306,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;
   }
 
   /**
@@ -1410,6 +1449,18 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1559,6 +1610,22 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -108,6 +108,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -183,6 +187,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -253,6 +261,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -330,6 +342,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -383,6 +399,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+   
    
    
    
@@ -475,6 +495,10 @@ export class SegmentTree<E = number> implements Iterable<E> {
    
    
    
+   
+   
+   
+