data-structure-typed 2.1.0 → 2.1.2

package/jest.integration.config.js

@@ -1,5 +1,12 @@
 module.exports = {
   preset: 'ts-jest',
   testEnvironment: 'node',
-  testMatch: ['<rootDir>/test/integration/**/*.test.ts', '<rootDir>/test/integration/**/*.test.js'],
+  testMatch: [
+    '<rootDir>/test/integration/**/*.test.ts',
+    '<rootDir>/test/integration/**/*.test.js',
+    '<rootDir>/test/integration/**/*.test.mjs'
+  ],
+  transform: {
+    '^.+\\.(ts|tsx)$': ['ts-jest', { tsconfig: 'tsconfig.test.json' }]
+  }
 };

package/package.json

@@ -1,31 +1,37 @@
 {
   "name": "data-structure-typed",
-  "version": "2.1.0",
+  "version": "2.1.2",
   "description": "Standard data structure",
-  "main": "dist/cjs/index.js",
-  "module": "dist/esm/index.js",
   "browser": "dist/umd/data-structure-typed.min.js",
-  "types": "dist/esm/index.d.ts",
   "umd:main": "dist/umd/data-structure-typed.min.js",
+  "main": "dist/cjs/index.cjs",
+  "module": "dist/esm/index.mjs",
+  "types": "dist/types/index.d.ts",
   "exports": {
     ".": {
-      "import": "./dist/esm/index.js",
-      "require": "./dist/cjs/index.js"
+      "types": "./dist/types/index.d.ts",
+      "import": "./dist/esm/index.mjs",
+      "require": "./dist/cjs/index.cjs"
     }
   },
+  "sideEffects": false,
+  "engines": {
+    "node": ">=12.20.0",
+    "npm": ">=6.14.0"
+  },
   "scripts": {
     "build": "npm run build:ecu && npm run build:docs-class",
-    "build:esm": "rm -rf dist/esm && tsc -p tsconfig-esm.json",
-    "build:cjs": "rm -rf dist/cjs && tsc -p tsconfig-cjs.json",
+    "build:node": "tsup --config tsup.node.config.js",
+    "build:types": "rm -rf dist/types && tsc -p tsconfig.types.json",
     "build:umd": "tsup",
-    "build:ecu": "npm run build:esm && npm run build:cjs && npm run build:umd",
+    "build:ecu": "npm run build:node && npm run build:types && npm run build:umd",
     "build:docs": "npm run gen:examples && typedoc --out docs ./src",
     "build:docs-class": "npm run gen:examples && typedoc --out docs ./src/data-structures",
-    "gen:examples": "ts-node scripts/testToExample.ts",
+    "gen:examples": "ts-node scripts/test-to-example.ts",
     "test:in-band": "jest --runInBand",
     "test": "npm run test:in-band",
-    "test:integration": "npm run update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.ts && node test/integration/compile.mjs",
-    "test:perf": "npm run build:cjs && npm run build:esm && ts-node test/performance/benchmark-runner.ts --isolate --gc --cooldown-ms=80",
+    "test:integration": "npm run update:subs && jest --config jest.integration.config.js && tsc test/integration/compile.test.ts && node test/integration/compile.mjs",
+    "test:perf": "npm run build:ecu && ts-node test/performance/benchmark-runner.ts --isolate --gc --cooldown-ms=80",
     "check": "tsc --noEmit",
     "check:circular-refs": "dependency-cruiser src",
     "lint:src": "eslint --fix 'src/**/*.{js,ts}'",
@@ -75,7 +81,7 @@
     "benchmark": "^2.1.4",
     "binary-tree-typed": "^1.54.3",
     "bst-typed": "^1.54.3",
-    "data-structure-typed": "^1.54.3",
+    "data-structure-typed": "^2.1.1",
     "dependency-cruiser": "^16.5.0",
     "doctoc": "^2.2.1",
     "eslint": "^9.13.0",
@@ -92,7 +98,7 @@
     "ts-jest": "^29.2.5",
     "ts-loader": "^9.5.1",
     "ts-node": "^10.9.2",
-    "tsup": "^8.3.5",
+    "tsup": "^8.5.1",
     "typedoc": "^0.26.10",
     "typescript": "^5.6.3"
   },

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

@@ -95,10 +95,7 @@ export class AVLTreeCounterNode<K = any, V = any> extends AVLTreeNode<K, V> {
  * @template V
  * @template R
  */
-export class AVLTreeCounter<K = any, V = any, R extends object = object>
-  extends AVLTree<K, V, R>
-  implements IBinaryTree<K, V, R>
-{
+export class AVLTreeCounter<K = any, V = any, R = any> extends AVLTree<K, V, R> implements IBinaryTree<K, V, R> {
   /**
    * Create a AVLTreeCounter instance
    * @remarks Time O(n), Space O(n)
@@ -133,7 +130,7 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
     return sum;
   }
 
-  override _createNode(key: K, value?: V, count?: number): AVLTreeCounterNode<K, V> {
+  override createNode(key: K, value?: V, count?: number): AVLTreeCounterNode<K, V> {
     return new AVLTreeCounterNode(key, this._isMapMode ? undefined : value, count) as AVLTreeCounterNode<K, V>;
   }
 
@@ -314,7 +311,7 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new AVLTreeCounter with mapped entries.
    */
-  override map<MK = K, MV = V, MR extends object = object>(
+  override map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -337,7 +334,7 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
    * @param [options] - Optional constructor options for the like-kind instance.
    * @returns An empty like-kind instance.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
+  protected override _createInstance<TK = K, TV = V, TR = R>(
     options?: Partial<AVLTreeCounterOptions<TK, TV, TR>>
   ): this {
     const Ctor = this.constructor as unknown as new (
@@ -359,7 +356,7 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
    * @param [options] - Options merged with the current snapshot.
    * @returns A like-kind AVLTreeCounter built from the iterable.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<
       TK | AVLTreeCounterNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR
     > = [],
@@ -394,10 +391,10 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
       const [key, entryValue] = keyNodeOrEntry;
       if (key === undefined || key === null) return [undefined, undefined];
       const finalValue = value ?? entryValue;
-      return [this._createNode(key, finalValue, count), finalValue];
+      return [this.createNode(key, finalValue, count), finalValue];
     }
 
-    return [this._createNode(keyNodeOrEntry, value, count), value];
+    return [this.createNode(keyNodeOrEntry, value, count), value];
   }
 
   /**
@@ -415,7 +412,7 @@ export class AVLTreeCounter<K = any, V = any, R extends object = object>
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, height } = destNode;
-      const tempNode = this._createNode(key, value, count);
+      const tempNode = this.createNode(key, value, count);
       if (tempNode) {
         tempNode.height = height;
 

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

@@ -93,10 +93,7 @@ export class AVLTreeMultiMapNode<K = any, V = any> extends AVLTreeNode<K, V[]> {
  * @template V
  * @template R
  */
-export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
-  extends AVLTree<K, V[], R>
-  implements IBinaryTree<K, V[], R>
-{
+export class AVLTreeMultiMap<K = any, V = any, R = any> extends AVLTree<K, V[], R> implements IBinaryTree<K, V[], R> {
   /**
    * Create an AVLTreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -116,7 +113,7 @@ export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
     }
   }
 
-  override _createNode(key: K, value: V[] = []): AVLTreeMultiMapNode<K, V> {
+  override createNode(key: K, value: V[] = []): AVLTreeMultiMapNode<K, V> {
     return new AVLTreeMultiMapNode<K, V>(key, this._isMapMode ? [] : value);
   }
 
@@ -251,7 +248,7 @@ export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new AVLTreeMultiMap when mapping to array values; see overloads.
    */
-  override map<MK = K, MVArr extends unknown[] = V[], MR extends object = object>(
+  override map<MK = K, MVArr extends unknown[] = V[], MR = any>(
     callback: EntryCallback<K, V[] | undefined, [MK, MVArr]>,
     options?: Partial<AVLTreeOptions<MK, MVArr, MR>>,
     thisArg?: unknown
@@ -268,7 +265,7 @@ export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new AVLTree when mapping to non-array values; see overloads.
    */
-  override map<MK = K, MV = V[], MR extends object = object>(
+  override map<MK = K, MV = V[], MR = any>(
     callback: EntryCallback<K, V[] | undefined, [MK, MV]>,
     options?: Partial<AVLTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -305,9 +302,7 @@ export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
    * @param [options] - Optional constructor options for the like-kind instance.
    * @returns An empty like-kind instance.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<AVLTreeOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<AVLTreeOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | AVLTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: AVLTreeOptions<TK, TV, TR>
@@ -325,7 +320,7 @@ export class AVLTreeMultiMap<K = any, V = any, R extends object = object>
    * @param [options] - Options merged with the current snapshot.
    * @returns A like-kind AVLTree built from the iterable.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<TK | AVLTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR> = [],
     options?: Partial<AVLTreeOptions<TK, TV, TR>>
   ): AVLTree<TK, TV, TR> {

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

@@ -169,7 +169,7 @@ export class AVLTreeNode<K = any, V = any> extends BSTNode<K, V> {
  *  //      { minute: 15, temperature: 58.6 }
  *  //    ]
  */
-export class AVLTree<K = any, V = any, R extends object = object> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
+export class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
   /**
    * Creates an instance of AVLTree.
    * @remarks Time O(N log N) (from `addMany` with balanced add). Space O(N).
@@ -196,7 +196,7 @@ export class AVLTree<K = any, V = any, R extends object = object> extends BST<K,
    * @param [value] - The value for the new node.
    * @returns The newly created AVLTreeNode.
    */
-  override _createNode(key: K, value?: V): AVLTreeNode<K, V> {
+  override createNode(key: K, value?: V): AVLTreeNode<K, V> {
     return new AVLTreeNode<K, V>(key, this._isMapMode ? undefined : value) as AVLTreeNode<K, V>;
   }
 
@@ -301,7 +301,7 @@ export class AVLTree<K = any, V = any, R extends object = object> extends BST<K,
    * @param [thisArg] - `this` context for the callback.
    * @returns A new, mapped AVLTree.
    */
-  override map<MK = K, MV = V, MR extends object = object>(
+  override map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -325,9 +325,7 @@ export class AVLTree<K = any, V = any, R extends object = object> extends BST<K,
    * @param [options] - Options for the new tree.
    * @returns A new, empty tree.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<BSTOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: BSTOptions<TK, TV, TR>
@@ -344,7 +342,7 @@ export class AVLTree<K = any, V = any, R extends object = object> extends BST<K,
    * @param [options] - Options for the new tree.
    * @returns A new AVLTree.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR> = [],
     options?: Partial<BSTOptions<TK, TV, TR>>
   ): AVLTree<TK, TV, TR> {
@@ -372,7 +370,7 @@ export class AVLTree<K = any, V = any, R extends object = object> extends BST<K,
 
     if (srcNodeEnsured && destNodeEnsured) {
       const { key, value, height } = destNodeEnsured;
-      const tempNode = this._createNode(key, value);
+      const tempNode = this.createNode(key, value);
 
       if (tempNode) {
         tempNode.height = height;

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

@@ -266,7 +266,7 @@ export class BinaryTreeNode<K = any, V = any> {
  *
  *     console.log(evaluate(expressionTree.root)); // -27
  */
-export class BinaryTree<K = any, V = any, R extends object = object>
+export class BinaryTree<K = any, V = any, R = any>
   extends IterableEntryBase<K, V | undefined>
   implements IBinaryTree<K, V, R>
 {
@@ -390,7 +390,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created node.
    */
-  _createNode(key: K, value?: V): BinaryTreeNode<K, V> {
+  createNode(key: K, value?: V): BinaryTreeNode<K, V> {
     return new BinaryTreeNode<K, V>(key, this._isMapMode ? undefined : value);
   }
 
@@ -973,8 +973,8 @@ export class BinaryTree<K = any, V = any, R extends object = object>
     startNode: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined = this._root,
     iterationType: IterationType = this.iterationType
   ): boolean {
-    startNode = this.ensureNode(startNode);
-    if (!startNode) return true;
+    const startNodeSired = this.ensureNode(startNode);
+    if (!startNodeSired) return true;
 
     if (iterationType === 'RECURSIVE') {
       const dfs = (cur: BinaryTreeNode<K, V> | null | undefined, min: number, max: number): boolean => {
@@ -984,15 +984,15 @@ export class BinaryTree<K = any, V = any, R extends object = object>
         return dfs(cur.left, min, numKey) && dfs(cur.right, numKey, max);
       };
 
-      const isStandardBST = dfs(startNode, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
-      const isInverseBST = dfs(startNode, Number.MAX_SAFE_INTEGER, Number.MIN_SAFE_INTEGER); // Check for reverse BST
+      const isStandardBST = dfs(startNodeSired, Number.MIN_SAFE_INTEGER, Number.MAX_SAFE_INTEGER);
+      const isInverseBST = dfs(startNodeSired, Number.MAX_SAFE_INTEGER, Number.MIN_SAFE_INTEGER); // Check for reverse BST
       return isStandardBST || isInverseBST;
     } else {
       // Iterative in-order traversal check
       const checkBST = (checkMax = false) => {
         const stack: BinaryTreeNode<K, V>[] = [];
         let prev = checkMax ? Number.MAX_SAFE_INTEGER : Number.MIN_SAFE_INTEGER;
-        let curr: BinaryTreeNode<K, V> | null | undefined = startNode;
+        let curr: BinaryTreeNode<K, V> | null | undefined = startNodeSired;
         while (this.isRealNode(curr) || stack.length > 0) {
           while (this.isRealNode(curr)) {
             stack.push(curr);
@@ -1178,9 +1178,9 @@ export class BinaryTree<K = any, V = any, R extends object = object>
     iterationType: IterationType = this.iterationType
   ): ReturnType<C> {
     if (this.isNIL(startNode)) return callback(undefined);
-    startNode = this.ensureNode(startNode);
+    const ensuredStartNode = this.ensureNode(startNode);
 
-    if (!this.isRealNode(startNode)) return callback(undefined);
+    if (!this.isRealNode(ensuredStartNode)) return callback(undefined);
     if (iterationType === 'RECURSIVE') {
       const dfs = (cur: BinaryTreeNode<K, V>): BinaryTreeNode<K, V> => {
         const { left } = cur;
@@ -1188,7 +1188,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
         return dfs(left);
       };
 
-      return callback(dfs(startNode));
+      return callback(dfs(ensuredStartNode));
     } else {
       // Iterative (trampolined to prevent stack overflow, though 'ITERATIVE' usually means a loop)
       const dfs = makeTrampoline((cur: BinaryTreeNode<K, V>): Trampoline<BinaryTreeNode<K, V>> => {
@@ -1197,7 +1197,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
         return makeTrampolineThunk(() => dfs(left));
       });
 
-      return callback(dfs(startNode));
+      return callback(dfs(ensuredStartNode));
     }
   }
 
@@ -1689,7 +1689,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
    * @param [thisArg] - `this` context for the callback.
    * @returns A new, mapped tree.
    */
-  map<MK = K, MV = V, MR extends object = object>(
+  map<MK = K, MV = V, MR = any>(
     cb: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -1948,7 +1948,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
    * @template TK, TV, TR - Generic types for the options.
    * @returns The options object.
    */
-  protected _snapshotOptions<TK = K, TV = V, TR extends object = R>(): BinaryTreeOptions<TK, TV, TR> {
+  protected _snapshotOptions<TK = K, TV = V, TR = R>(): BinaryTreeOptions<TK, TV, TR> {
     return {
       iterationType: this.iterationType,
       toEntryFn: this.toEntryFn as unknown as BinaryTreeOptions<TK, TV, TR>['toEntryFn'],
@@ -1965,9 +1965,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
    * @param [options] - Options for the new tree.
    * @returns A new, empty tree.
    */
-  protected _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<BinaryTreeOptions<TK, TV, TR>>
-  ): this {
+  protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BinaryTreeOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | BinaryTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: BinaryTreeOptions<TK, TV, TR>
@@ -1984,7 +1982,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
    * @param [options] - Options for the new tree.
    * @returns A new tree.
    */
-  protected _createLike<TK = K, TV = V, TR extends object = R>(
+  protected _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<TK | BinaryTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR> = [],
     options?: Partial<BinaryTreeOptions<TK, TV, TR>>
   ): BinaryTree<TK, TV, TR> {
@@ -2021,10 +2019,10 @@ export class BinaryTree<K = any, V = any, R extends object = object>
       if (key === undefined) return [undefined, undefined];
       else if (key === null) return [null, undefined];
       const finalValue = value ?? entryValue;
-      return [this._createNode(key, finalValue), finalValue];
+      return [this.createNode(key, finalValue), finalValue];
     }
 
-    return [this._createNode(keyNodeOrEntry, value), value];
+    return [this.createNode(keyNodeOrEntry, value), value];
   }
 
   /**
@@ -2149,7 +2147,7 @@ export class BinaryTree<K = any, V = any, R extends object = object>
 
     if (srcNode && destNode) {
       const { key, value } = destNode;
-      const tempNode = this._createNode(key, value); // Use a temp node to hold dest properties
+      const tempNode = this.createNode(key, value); // Use a temp node to hold dest properties
 
       if (tempNode) {
         // Copy src to dest

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

@@ -165,10 +165,7 @@ export class BSTNode<K = any, V = any> extends BinaryTreeNode<K, V> {
  *     console.log(findLCA(5, 35)); // 15
  *     console.log(findLCA(20, 30)); // 25
  */
-export class BST<K = any, V = any, R extends object = object>
-  extends BinaryTree<K, V, R>
-  implements IBinaryTree<K, V, R>
-{
+export class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R> implements IBinaryTree<K, V, R> {
   /**
    * Creates an instance of BST.
    * @remarks Time O(N log N) or O(N^2) depending on `isBalanceAdd` in `addMany` and input order. Space O(N).
@@ -271,7 +268,7 @@ export class BST<K = any, V = any, R extends object = object>
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created BSTNode.
    */
-  override _createNode(key: K, value?: V): BSTNode<K, V> {
+  override createNode(key: K, value?: V): BSTNode<K, V> {
     return new BSTNode<K, V>(key, this._isMapMode ? undefined : value);
   }
 
@@ -811,7 +808,7 @@ export class BST<K = any, V = any, R extends object = object>
    * @param [thisArg] - `this` context for the callback.
    * @returns A new, mapped BST.
    */
-  override map<MK = K, MV = V, MR extends object = object>(
+  override map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -864,9 +861,7 @@ export class BST<K = any, V = any, R extends object = object>
    * @param [options] - Options for the new BST.
    * @returns A new, empty BST.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<BSTOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: BSTOptions<TK, TV, TR>
@@ -883,7 +878,7 @@ export class BST<K = any, V = any, R extends object = object>
    * @param [options] - Options for the new BST.
    * @returns A new BST.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR> = [],
     options?: Partial<BSTOptions<TK, TV, TR>>
   ): BST<TK, TV, TR> {
@@ -901,7 +896,7 @@ export class BST<K = any, V = any, R extends object = object>
    * @template TK, TV, TR - Generic types for the options.
    * @returns The options object.
    */
-  protected override _snapshotOptions<TK = K, TV = V, TR extends object = R>(): BSTOptions<TK, TV, TR> {
+  protected override _snapshotOptions<TK = K, TV = V, TR = R>(): BSTOptions<TK, TV, TR> {
     return {
       ...super._snapshotOptions<TK, TV, TR>(),
       specifyComparable: this.specifyComparable as BSTOptions<TK, TV, TR>['specifyComparable'],

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

@@ -89,7 +89,7 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
 }
 
 /**
- * RRRed-Black Tree (self-balancing BST) supporting map-like mode and stable O(log n) updates.
+ * Represents a Red-Black Tree (self-balancing BST) supporting map-like mode and stable O(log n) updates.
  * @remarks Time O(1), Space O(1)
  * @template K
  * @template V
@@ -141,10 +141,7 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
  *     console.log(stocksInRange); // ['GOOGL', 'META', 'MSFT']
  */
 
-export class RedBlackTree<K = any, V = any, R extends object = object>
-  extends BST<K, V, R>
-  implements IBinaryTree<K, V, R>
-{
+export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
   constructor(
     keysNodesEntriesOrRaws: Iterable<
       K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R
@@ -179,7 +176,7 @@ export class RedBlackTree<K = any, V = any, R extends object = object>
    * @param color - See parameter type for details.
    * @returns A new RedBlackTreeNode instance.
    */
-  override _createNode(key: K, value?: V, color: RBTNColor = 'BLACK'): RedBlackTreeNode<K, V> {
+  override createNode(key: K, value?: V, color: RBTNColor = 'BLACK'): RedBlackTreeNode<K, V> {
     return new RedBlackTreeNode<K, V>(key, this._isMapMode ? undefined : value, color);
   }
 
@@ -324,7 +321,7 @@ export class RedBlackTree<K = any, V = any, R extends object = object>
    * @returns A new RedBlackTree with mapped entries.
    */
 
-  override map<MK = K, MV = V, MR extends object = object>(
+  override map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -338,9 +335,7 @@ export class RedBlackTree<K = any, V = any, R extends object = object>
     return out;
   }
 
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<RedBlackTreeOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: RedBlackTreeOptions<TK, TV, TR>
@@ -348,7 +343,7 @@ export class RedBlackTree<K = any, V = any, R extends object = object>
     return new Ctor([], { ...this._snapshotOptions<TK, TV, TR>(), ...(options ?? {}) }) as unknown as this;
   }
 
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<
       TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR
     > = [],

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

@@ -100,10 +100,7 @@ export class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<K, V> {
  * @template V
  * @template R
  */
-export class TreeCounter<K = any, V = any, R extends object = object>
-  extends RedBlackTree<K, V, R>
-  implements IBinaryTree<K, V, R>
-{
+export class TreeCounter<K = any, V = any, R = any> extends RedBlackTree<K, V, R> implements IBinaryTree<K, V, R> {
   /**
    * Create a TreeCounter and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -145,7 +142,7 @@ export class TreeCounter<K = any, V = any, R extends object = object>
     return sum;
   }
 
-  override _createNode(key: K, value?: V, color: RBTNColor = 'BLACK', count?: number): TreeCounterNode<K, V> {
+  override createNode(key: K, value?: V, color: RBTNColor = 'BLACK', count?: number): TreeCounterNode<K, V> {
     return new TreeCounterNode(key, this._isMapMode ? undefined : value, count, color) as TreeCounterNode<K, V>;
   }
 
@@ -342,7 +339,7 @@ export class TreeCounter<K = any, V = any, R extends object = object>
    * @param [thisArg] - Value for `this` inside the callback.
    * @returns A new TreeCounter with mapped entries.
    */
-  override map<MK = K, MV = V, MR extends object = object>(
+  override map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -377,9 +374,7 @@ export class TreeCounter<K = any, V = any, R extends object = object>
    * @param [options] - Optional constructor options for the like-kind instance.
    * @returns An empty like-kind instance.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<BSTOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: BSTOptions<TK, TV, TR>
@@ -397,7 +392,7 @@ export class TreeCounter<K = any, V = any, R extends object = object>
    * @param [options] - Options merged with the current snapshot.
    * @returns A like-kind TreeCounter built from the iterable.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<TK | BSTNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR> = [],
     options?: Partial<BSTOptions<TK, TV, TR>>
   ): TreeCounter<TK, TV, TR> {
@@ -432,10 +427,10 @@ export class TreeCounter<K = any, V = any, R extends object = object>
       const [key, entryValue] = keyNodeOrEntry;
       if (key === undefined || key === null) return [undefined, undefined];
       const finalValue = value ?? entryValue;
-      return [this._createNode(key, finalValue, 'BLACK', count), finalValue];
+      return [this.createNode(key, finalValue, 'BLACK', count), finalValue];
     }
 
-    return [this._createNode(keyNodeOrEntry, value, 'BLACK', count), value];
+    return [this.createNode(keyNodeOrEntry, value, 'BLACK', count), value];
   }
 
   /**
@@ -453,7 +448,7 @@ export class TreeCounter<K = any, V = any, R extends object = object>
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, color } = destNode;
-      const tempNode = this._createNode(key, value, color, count);
+      const tempNode = this.createNode(key, value, color, count);
       if (tempNode) {
         tempNode.color = color;
 

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

@@ -250,10 +250,7 @@ export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]>
  *  //      ]
  *  //    ]
  */
-export class TreeMultiMap<K = any, V = any, R extends object = object>
-  extends RedBlackTree<K, V[], R>
-  implements IBinaryTree<K, V[], R>
-{
+export class TreeMultiMap<K = any, V = any, R = any> extends RedBlackTree<K, V[], R> implements IBinaryTree<K, V[], R> {
   /**
    * Create a TreeMultiMap and optionally bulk-insert items.
    * @remarks Time O(N log N), Space O(N)
@@ -273,7 +270,7 @@ export class TreeMultiMap<K = any, V = any, R extends object = object>
     }
   }
 
-  override _createNode(key: K, value: V[] = []): TreeMultiMapNode<K, V> {
+  override createNode(key: K, value: V[] = []): TreeMultiMapNode<K, V> {
     return new TreeMultiMapNode<K, V>(key, this._isMapMode ? [] : value);
   }
 
@@ -365,13 +362,13 @@ export class TreeMultiMap<K = any, V = any, R extends object = object>
     return false;
   }
 
-  override map<MK = K, MVArr extends unknown[] = V[], MR extends object = object>(
+  override map<MK = K, MVArr extends unknown[] = V[], MR = any>(
     callback: EntryCallback<K, V[] | undefined, [MK, MVArr]>,
     options?: Partial<RedBlackTreeOptions<MK, MVArr, MR>>,
     thisArg?: unknown
   ): TreeMultiMap<MK, ElemOf<MVArr>, MR>;
 
-  override map<MK = K, MV = V[], MR extends object = object>(
+  override map<MK = K, MV = V[], MR = any>(
     callback: EntryCallback<K, V[] | undefined, [MK, MV]>,
     options?: Partial<RedBlackTreeOptions<MK, MV, MR>>,
     thisArg?: unknown
@@ -408,9 +405,7 @@ export class TreeMultiMap<K = any, V = any, R extends object = object>
    * @param [options] - Optional constructor options for the like-kind instance.
    * @returns An empty like-kind instance.
    */
-  protected override _createInstance<TK = K, TV = V, TR extends object = R>(
-    options?: Partial<RedBlackTreeOptions<TK, TV, TR>>
-  ): this {
+  protected override _createInstance<TK = K, TV = V, TR = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this {
     const Ctor = this.constructor as unknown as new (
       iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>,
       opts?: RedBlackTreeOptions<TK, TV, TR>
@@ -428,7 +423,7 @@ export class TreeMultiMap<K = any, V = any, R extends object = object>
    * @param [options] - Options merged with the current snapshot.
    * @returns A like-kind RedBlackTree built from the iterable.
    */
-  protected override _createLike<TK = K, TV = V, TR extends object = R>(
+  protected override _createLike<TK = K, TV = V, TR = R>(
     iter: Iterable<
       TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR
     > = [],