max-priority-queue-typed 2.5.2 → 2.6.0

package/dist/types/data-structures/binary-tree/bst.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeDeleteResult, BSTNOptKeyOrNode, BSTOptions, BTNRep, Comparator, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodePredicate, OptNode, RBTNColor } from '../../types';
+import type { BSTNOptKeyOrNode, BSTOptions, BTNRep, Comparator, DFSOrderPattern, EntryCallback, FamilyPosition, IterationType, NodeCallback, NodePredicate, OptNode, RBTNColor } from '../../types';
 import { BinaryTree } from './binary-tree';
 import { IBinaryTree } from '../../interfaces';
 import { Range } from '../../common';
@@ -366,6 +366,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -438,6 +452,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -513,6 +541,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -532,7 +574,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
  * // 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];
@@ -599,6 +641,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -669,6 +725,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -721,6 +791,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -882,6 +959,27 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -966,6 +1064,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1021,6 +1133,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1075,6 +1194,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1128,6 +1254,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1182,6 +1315,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1236,6 +1376,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1285,6 +1432,13 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1363,6 +1517,20 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1421,7 +1589,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      *   - Value: true if the deletion succeeded, false if it failed (e.g., key not found during deletion phase).
      *   - If no nodes match the search criteria, the returned map is empty.
      */
-    deleteWhere(keyNodeEntryOrPredicate: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BSTNode<K, V>> | Range<K>, onlyOne?: boolean, startNode?: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): BinaryTreeDeleteResult<BSTNode<K, V>>[];
+    deleteWhere(keyNodeEntryOrPredicate: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BSTNode<K, V>> | Range<K>, onlyOne?: boolean, startNode?: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): boolean;
     /**
      * (Protected) Creates the default comparator function for keys that don't have a custom comparator.
      * @remarks Time O(1) Space O(1)

package/dist/types/data-structures/binary-tree/red-black-tree.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeDeleteResult, BTNRep, CRUD, EntryCallback, FamilyPosition, NodePredicate, RBTNColor, IterationType, RedBlackTreeOptions } from '../../types';
+import type { BTNRep, CRUD, EntryCallback, FamilyPosition, NodePredicate, RBTNColor, IterationType, RedBlackTreeOptions } from '../../types';
 import { BST } from './bst';
 import { IBinaryTree } from '../../interfaces';
 export declare class RedBlackTreeNode<K = any, V = any> {
@@ -217,13 +217,36 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      */
     isNode(keyNodeOrEntry: K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): keyNodeOrEntry is RedBlackTreeNode<K, V>;
     /**
-     * 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)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -572,6 +595,34 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -730,6 +781,34 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -758,7 +837,7 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
    *     console.log(rbt.has(5)); // false;
    *     console.log(rbt.size); // 4;
      */
-    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, RedBlackTreeNode<K, V>> | NodePredicate<RedBlackTreeNode<K, V> | null>): BinaryTreeDeleteResult<RedBlackTreeNode<K, V>>[];
+    delete(keyNodeEntryRawOrPredicate: BTNRep<K, V, RedBlackTreeNode<K, V>> | NodePredicate<RedBlackTreeNode<K, V> | null>): boolean;
     /**
      * Transform entries into a like-kind red-black tree with possibly different key/value types.
      * @remarks Time O(n) average, Space O(n)
@@ -850,6 +929,27 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -990,6 +1090,34 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

package/dist/types/data-structures/binary-tree/segment-tree.d.ts

@@ -72,6 +72,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -133,6 +140,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -190,6 +204,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -242,6 +263,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -289,6 +317,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -339,6 +374,13 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+