priority-queue-typed 2.5.2 → 2.6.0

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

@@ -9,7 +9,6 @@
 import { BST } from './bst';
 import type {
   AVLTreeOptions,
-  BinaryTreeDeleteResult,
   BinaryTreeOptions,
   BSTNOptKeyOrNode,
   EntryCallback,
@@ -471,6 +470,34 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -600,6 +627,27 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -630,15 +678,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    */
   override delete(
     keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined
-  ): BinaryTreeDeleteResult<AVLTreeNode<K, V>>[] {
-    const deletedResults = super.delete(keyNodeOrEntry);
+  ): boolean {
+    const deletedResults = this._deleteInternal(keyNodeOrEntry);
     // After deletion, balance the path from the parent of the *physically deleted* node.
     for (const { needBalanced } of deletedResults) {
       if (needBalanced) {
-        this._balancePath(needBalanced);
+        this._balancePath(needBalanced as AVLTreeNode<K, V>);
       }
     }
-    return deletedResults;
+    return deletedResults.length > 0;
   }
 
   /**
@@ -693,6 +741,20 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -830,6 +892,27 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -103,6 +103,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -180,6 +194,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -257,6 +285,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -334,6 +376,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -409,6 +465,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -492,6 +562,20 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -552,6 +636,13 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -621,6 +712,13 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
+