binary-tree-typed 2.5.1 → 2.5.2

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "binary-tree-typed",
-  "version": "2.5.1",
+  "version": "2.5.2",
   "description": "Binary Tree. Javascript & Typescript Data Structure.",
   "browser": "dist/umd/binary-tree-typed.min.js",
   "umd:main": "dist/umd/binary-tree-typed.min.js",
@@ -178,6 +178,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.5.1"
+    "data-structure-typed": "^2.5.2"
   }
 }

package/src/common/error.ts

@@ -1,3 +1,17 @@
+/**
+ * Centralized error dispatch.
+ * All library errors go through this function for consistent messaging and easy grep.
+ * @remarks Always throws — data structure errors are never recoverable.
+ * @param ErrorClass - The error constructor (Error, TypeError, RangeError, etc.)
+ * @param message - The error message.
+ */
+export function raise(
+  ErrorClass: new (msg: string) => Error,
+  message: string
+): never {
+  throw new ErrorClass(message);
+}
+
 /**
  * Centralized error message templates.
  * Keep using native Error/TypeError/RangeError — this only standardizes messages.
@@ -56,5 +70,9 @@ export const ERR = {
     'Matrix: Must be rectangular for transposition.',
 
   matrixRowMismatch: (expected: number, got: number) =>
-    `Matrix: Expected row length ${expected}, but got ${got}.`
+    `Matrix: Expected row length ${expected}, but got ${got}.`,
+
+  // Order statistic
+  orderStatisticNotEnabled: (method: string, ctx?: string) =>
+    `${ctx ? ctx + ': ' : ''}${method}() requires enableOrderStatistic: true.`
 } as const;

package/src/common/index.ts

@@ -1,4 +1,4 @@
-export { ERR } from './error';
+export { ERR, raise } from './error';
 
 export enum DFSOperation {
   VISIT = 0,

package/src/data-structures/base/iterable-element-base.ts

@@ -1,4 +1,5 @@
 import type { ElementCallback, IterableElementBaseOptions, ReduceElementCallback } from '../../types';
+import { raise } from '../../common';
 
 /**
  * Base class that makes a data structure iterable and provides common
@@ -25,7 +26,7 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
     if (options) {
       const { toElementFn } = options;
       if (typeof toElementFn === 'function') this._toElementFn = toElementFn;
-      else if (toElementFn) throw new TypeError('toElementFn must be a function type');
+      else if (toElementFn) raise(TypeError, 'toElementFn must be a function type');
     }
   }
 
@@ -224,7 +225,7 @@ export abstract class IterableElementBase<E, R> implements Iterable<E> {
       acc = initialValue as U;
     } else {
       const first = iter.next();
-      if (first.done) throw new TypeError('Reduce of empty structure with no initial value');
+      if (first.done) raise(TypeError, 'Reduce of empty structure with no initial value');
       acc = first.value as unknown as U;
       index = 1;
     }

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

@@ -467,6 +467,18 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -590,6 +602,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -674,6 +695,12 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -805,6 +832,15 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -970,6 +1006,8 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
     }
     this._updateHeight(A);
     if (B) this._updateHeight(B);
+    this._updateCount(A);
+    if (B) this._updateCount(B);
   }
 
   /**
@@ -1022,6 +1060,9 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
     this._updateHeight(A);
     if (B) this._updateHeight(B);
     if (C) this._updateHeight(C);
+    this._updateCount(A);
+    if (B) this._updateCount(B);
+    if (C) this._updateCount(C);
   }
 
   /**
@@ -1061,6 +1102,8 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
     }
     this._updateHeight(A);
     if (B) this._updateHeight(B);
+    this._updateCount(A);
+    if (B) this._updateCount(B);
   }
 
   /**
@@ -1112,6 +1155,9 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
     this._updateHeight(A);
     if (B) this._updateHeight(B);
     if (C) this._updateHeight(C);
+    this._updateCount(A);
+    if (B) this._updateCount(B);
+    if (C) this._updateCount(C);
   }
 
   /**
@@ -1130,6 +1176,7 @@ export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements
       const A = path[i];
       if (A) {
         this._updateHeight(A);
+        this._updateCount(A);
 
         // Check the balance factor
         switch (this._balanceFactor(A)) {

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>
    
    
    
+   
+   
+