max-priority-queue-typed 2.5.1 → 2.5.2

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 
 /**
  * Binary Indexed Tree (Fenwick Tree).
@@ -44,7 +44,7 @@ export class BinaryIndexedTree implements Iterable<number> {
       }
     } else {
       if (!Number.isInteger(sizeOrElements) || sizeOrElements < 0) {
-        throw new RangeError(ERR.invalidArgument('size must be a non-negative integer', 'BinaryIndexedTree'));
+        raise(RangeError, ERR.invalidArgument('size must be a non-negative integer', 'BinaryIndexedTree'));
       }
       this._size = sizeOrElements;
       this._tree = new Array(this._size + 1).fill(0);
@@ -105,6 +105,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -176,6 +182,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -247,6 +259,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -318,6 +336,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -387,6 +411,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -464,6 +494,12 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -517,6 +553,9 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
    
    
    
@@ -583,6 +622,9 @@ export class BinaryIndexedTree implements Iterable<number> {
    
    
    
+   
+   
+   
    
    
    
@@ -665,10 +707,10 @@ export class BinaryIndexedTree implements Iterable<number> {
 
   protected _checkIndex(index: number): void {
     if (!Number.isInteger(index)) {
-      throw new TypeError(ERR.invalidIndex('BinaryIndexedTree'));
+      raise(TypeError, ERR.invalidIndex('BinaryIndexedTree'));
     }
     if (index < 0 || index >= this._size) {
-      throw new RangeError(ERR.indexOutOfRange(index, 0, this._size - 1, 'BinaryIndexedTree'));
+      raise(RangeError, ERR.indexOutOfRange(index, 0, this._size - 1, 'BinaryIndexedTree'));
     }
   }
 

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

@@ -28,7 +28,7 @@ import { IBinaryTree } from '../../interfaces';
 import { isComparable, makeTrampoline, makeTrampolineThunk } from '../../utils';
 import { Queue } from '../queue';
 import { IterableEntryBase } from '../base';
-import { DFSOperation, ERR, Range } from '../../common';
+import { DFSOperation, ERR, raise, Range } from '../../common';
 
 /**
  * @template K - The type of the key.
@@ -216,7 +216,7 @@ export class BinaryTreeNode<K = any, V = any> {
  *       node?: BinaryTreeNode<string> | null,
  *       conditions?: { [key: string]: boolean }
  *     ): string {
- *       if (!node) throw new Error('Invalid node');
+ *       if (!node) raise(Error, 'Invalid node');
  *
  *       // If it's a leaf node, return the decision result
  *       if (!node.left && !node.right) return node.key;
@@ -261,7 +261,7 @@ export class BinaryTreeNode<K = any, V = any> {
  *         case '/':
  *           return rightValue !== 0 ? leftValue / rightValue : 0; // Handle division by zero
  *         default:
- *           throw new Error(`Unsupported operator: ${node.key}`);
+ *           raise(Error, `Unsupported operator: ${node.key}`);
  *       }
  *     }
  *
@@ -293,7 +293,7 @@ export class BinaryTree<K = any, V = any, R = any>
       if (isMapMode !== undefined) this._isMapMode = isMapMode;
       if (isDuplicate !== undefined) this._isDuplicate = isDuplicate;
       if (typeof toEntryFn === 'function') this._toEntryFn = toEntryFn;
-      else if (toEntryFn) throw new TypeError(ERR.notAFunction('toEntryFn', 'BinaryTree'));
+      else if (toEntryFn) raise(TypeError, ERR.notAFunction('toEntryFn', 'BinaryTree'));
     }
 
     if (keysNodesEntriesOrRaws) this.setMany(keysNodesEntriesOrRaws);
@@ -589,6 +589,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -643,6 +646,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -759,6 +765,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -803,6 +812,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -873,6 +885,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -939,6 +954,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1035,6 +1053,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1168,6 +1189,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1240,6 +1264,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1306,6 +1333,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1365,6 +1395,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1460,6 +1493,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1506,6 +1542,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1564,6 +1603,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1652,6 +1694,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -1714,6 +1759,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2017,6 +2065,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2102,6 +2153,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2246,6 +2300,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2343,6 +2400,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2458,6 +2518,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2617,6 +2680,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2667,6 +2733,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2721,6 +2790,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+   
    
    
    
@@ -2808,6 +2880,9 @@ export class BinaryTree<K = any, V = any, R = any>
    
    
    
+   
+   
+