max-priority-queue-typed 2.5.2 → 2.6.0

package/src/data-structures/trie/trie.ts

@@ -311,6 +311,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -385,6 +392,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -446,6 +460,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -502,6 +523,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -550,6 +578,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -602,6 +637,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -741,6 +783,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -821,6 +870,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -882,6 +938,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -966,6 +1029,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1018,6 +1088,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1071,6 +1148,13 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/src/interfaces/binary-tree.ts

@@ -1,6 +1,5 @@
 import { BinaryTreeNode } from '../data-structures';
 import type {
-  BinaryTreeDeleteResult,
   BinaryTreeOptions,
   BTNRep,
   DFSOrderPattern,
@@ -51,7 +50,7 @@ export interface IBinaryTree<K = any, V = any, R = any> {
   // Accept BTNRep, predicate, or raw R for deletion
   delete(
     keyNodeEntryRawOrPredicate: BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>
-  ): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+  ): boolean;
 
   clear(): void;
 
@@ -242,11 +241,4 @@ export interface IBinaryTree<K = any, V = any, R = any> {
 
   // ---- bulk / interop ----
   merge(anotherTree: IBinaryTree<K, V, R>): void;
-
-  refill(
-    keysNodesEntriesOrRaws: Iterable<
-      K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R
-    >,
-    values?: Iterable<V | undefined>
-  ): void;
 }