data-structure-typed 2.5.1 → 2.5.3

package/dist/esm-legacy/stack.mjs

@@ -3,6 +3,12 @@ var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { en
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
 var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 
+// src/common/error.ts
+function raise(ErrorClass, message) {
+  throw new ErrorClass(message);
+}
+__name(raise, "raise");
+
 // src/data-structures/base/iterable-element-base.ts
 var _IterableElementBase = class _IterableElementBase {
   /**
@@ -25,7 +31,7 @@ var _IterableElementBase = class _IterableElementBase {
     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");
     }
   }
   /**
@@ -181,7 +187,7 @@ var _IterableElementBase = class _IterableElementBase {
       acc = initialValue;
     } 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;
       index = 1;
     }
@@ -272,6 +278,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -328,6 +342,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -373,6 +395,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -418,6 +448,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -472,6 +510,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -541,6 +587,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -558,18 +612,18 @@ var _Stack = class _Stack extends IterableElementBase {
     */
   delete(element) {
     const idx = this._indexOfByEquals(element);
-    return this.deleteAt(idx);
+    return this.deleteAt(idx) !== void 0;
   }
   /**
    * Delete the element at an index.
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index from the bottom.
-   * @returns True if removed.
+   * @returns The removed element, or undefined if the index is out of range.
    */
   deleteAt(index) {
-    if (index < 0 || index >= this.elements.length) return false;
+    if (index < 0 || index >= this.elements.length) return void 0;
     const spliced = this.elements.splice(index, 1);
-    return spliced.length === 1;
+    return spliced[0];
   }
   /**
    * Delete the first element that satisfies a predicate.
@@ -610,6 +664,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -652,6 +714,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -700,6 +770,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -768,6 +846,14 @@ var _Stack = class _Stack extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     

package/dist/esm-legacy/trie.mjs

@@ -3,6 +3,37 @@ var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { en
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
 var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 
+// src/common/error.ts
+function raise(ErrorClass, message) {
+  throw new ErrorClass(message);
+}
+__name(raise, "raise");
+var ERR = {
+  // Range / index
+  indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
+  invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
+  // Type / argument
+  invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
+  comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
+  invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
+  notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
+  invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
+  invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
+  invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
+  reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
+  callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
+  // State / operation
+  invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
+  // Matrix
+  matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
+  matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
+  matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
+  matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
+  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch"),
+  // Order statistic
+  orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
+};
+
 // src/data-structures/base/iterable-element-base.ts
 var _IterableElementBase = class _IterableElementBase {
   /**
@@ -25,7 +56,7 @@ var _IterableElementBase = class _IterableElementBase {
     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");
     }
   }
   /**
@@ -181,7 +212,7 @@ var _IterableElementBase = class _IterableElementBase {
       acc = initialValue;
     } 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;
       index = 1;
     }
@@ -225,31 +256,6 @@ var _IterableElementBase = class _IterableElementBase {
 __name(_IterableElementBase, "IterableElementBase");
 var IterableElementBase = _IterableElementBase;
 
-// src/common/error.ts
-var ERR = {
-  // Range / index
-  indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
-  invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
-  // Type / argument
-  invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
-  comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
-  invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
-  notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
-  invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
-  invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
-  invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
-  reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
-  callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
-  // State / operation
-  invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
-  // Matrix
-  matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
-  matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
-  matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
-  matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
-  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch")
-};
-
 // src/data-structures/trie/trie.ts
 var _TrieNode = class _TrieNode {
   /**
@@ -399,6 +405,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -467,6 +481,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -522,6 +544,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -572,6 +602,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -614,6 +652,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -660,6 +706,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -788,6 +842,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -860,6 +922,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -915,6 +985,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -988,6 +1066,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1034,6 +1120,14 @@ var _Trie = class _Trie extends IterableElementBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1066,7 +1160,7 @@ var _Trie = class _Trie extends IterableElementBase {
     for (const x of this) {
       const v = thisArg === void 0 ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);
       if (typeof v !== "string") {
-        throw new TypeError(ERR.callbackReturnType("string", typeof v, "Trie.map"));
+        raise(TypeError, ERR.callbackReturnType("string", typeof v, "Trie.map"));
       }
       newTrie.add(v);
     }

package/dist/types/common/error.d.ts

@@ -1,3 +1,11 @@
+/**
+ * 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 declare function raise(ErrorClass: new (msg: string) => Error, message: string): never;
 /**
  * Centralized error message templates.
  * Keep using native Error/TypeError/RangeError — this only standardizes messages.
@@ -20,4 +28,5 @@ export declare const ERR: {
     readonly matrixNotSquare: () => string;
     readonly matrixNotRectangular: () => string;
     readonly matrixRowMismatch: (expected: number, got: number) => string;
+    readonly orderStatisticNotEnabled: (method: string, ctx?: string) => string;
 };

package/dist/types/common/index.d.ts

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

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

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { BST } from './bst';
-import type { AVLTreeOptions, BinaryTreeDeleteResult, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
+import type { AVLTreeOptions, BinaryTreeOptions, BSTNOptKeyOrNode, EntryCallback, FamilyPosition, IterationType, RBTNColor } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 /**
  * Represents a Node in an AVL (Adelson-Velsky and Landis) Tree.
@@ -362,6 +362,38 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -469,6 +501,30 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -497,7 +553,7 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
    *     console.log(avl.has(3)); // false;
    *     console.log(avl.size); // 6;
      */
-    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): BinaryTreeDeleteResult<AVLTreeNode<K, V>>[];
+    delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
      * Rebuilds the tree to be perfectly balanced.
      * @remarks AVL trees are already height-balanced, but this makes them *perfectly* balanced (minimal height and all leaves at N or N-1).
@@ -540,6 +596,22 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -639,6 +711,30 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+