min-heap-typed 2.1.0 → 2.1.2

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);
   }
 
@@ -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> {
 }
 
 /**
- * RRRRed-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
     > = [],

package/src/data-structures/heap/heap.ts

@@ -190,7 +190,7 @@ import { IterableElementBase } from '../base';
  *     ]);
  *     console.log(scheduleTasks(tasks, 2)); // expectedMap
  */
-export class Heap<E = unknown, R = never> extends IterableElementBase<E, R> {
+export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
   protected _equals: (a: E, b: E) => boolean = Object.is;
 
   /**
@@ -255,7 +255,7 @@ export class Heap<E = unknown, R = never> extends IterableElementBase<E, R> {
    * @returns A new heap instance of this class.
    */
 
-  static from<T, R = never, S extends Heap<T, R> = Heap<T, R>>(
+  static from<T, R = any, S extends Heap<T, R> = Heap<T, R>>(
     this: new (elements?: Iterable<T | R>, options?: HeapOptions<T, R>) => S,
     elements?: Iterable<T | R>,
     options?: HeapOptions<T, R>
@@ -273,7 +273,7 @@ export class Heap<E = unknown, R = never> extends IterableElementBase<E, R> {
    * @returns A new Heap built from elements.
    */
 
-  static heapify<EE = unknown, RR = never>(elements: Iterable<EE>, options: HeapOptions<EE, RR>): Heap<EE, RR> {
+  static heapify<EE = any, RR = any>(elements: Iterable<EE>, options: HeapOptions<EE, RR>): Heap<EE, RR> {
     return new Heap<EE, RR>(elements, options);
   }
 
@@ -788,7 +788,7 @@ export class FibonacciHeap<E> {
    */
 
   push(element: E): this {
-    const node = this._createNode(element);
+    const node = this.createNode(element);
     node.left = node;
     node.right = node;
     this.mergeWithRoot(node);
@@ -900,7 +900,7 @@ export class FibonacciHeap<E> {
     heapToMerge.clear();
   }
 
-  _createNode(element: E): FibonacciHeapNode<E> {
+  createNode(element: E): FibonacciHeapNode<E> {
     return new FibonacciHeapNode<E>(element);
   }
 

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -781,7 +781,7 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    * @returns A new SinglyLinkedListNode instance.
    */
 
-  protected _createNode(value: E): SinglyLinkedListNode<E> {
+  protected createNode(value: E): SinglyLinkedListNode<E> {
     return new SinglyLinkedListNode<E>(value);
   }
 
@@ -807,7 +807,7 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
 
   protected _ensureNode(elementOrNode: E | SinglyLinkedListNode<E>) {
     if (this.isNode(elementOrNode)) return elementOrNode;
-    return this._createNode(elementOrNode);
+    return this.createNode(elementOrNode);
   }
 
   /**

package/src/interfaces/binary-tree.ts

@@ -18,7 +18,7 @@ import type {
  * K = key, V = value, R = raw/record used with toEntryFn (optional).
  * Transforming methods like `map` use method-level generics MK/MV/MR.
  */
-export interface IBinaryTree<K = any, V = any, R extends object = object> {
+export interface IBinaryTree<K = any, V = any, R = any> {
   // ---- state ----
   readonly size: number;
   readonly root: BinaryTreeNode<K, V> | null | undefined;
@@ -32,7 +32,7 @@ export interface IBinaryTree<K = any, V = any, R extends object = object> {
   readonly isDuplicate: boolean;
 
   // ---- construction / mutation ----
-  _createNode(key: K, value?: BinaryTreeNode<K, V>['value']): BinaryTreeNode<K, V>;
+  createNode(key: K, value?: BinaryTreeNode<K, V>['value']): BinaryTreeNode<K, V>;
 
   createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): IBinaryTree<K, V, R>;
 
@@ -232,7 +232,7 @@ export interface IBinaryTree<K = any, V = any, R extends object = object> {
 
   filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): this;
 
-  map<MK = K, MV = V, MR extends object = object>(
+  map<MK = K, MV = V, MR = any>(
     callback: EntryCallback<K, V | undefined, [MK, MV]>,
     options?: Partial<BinaryTreeOptions<MK, MV, MR>>,
     thisArg?: unknown

package/tsconfig.base.json

@@ -0,0 +1,23 @@
+{
+  "compilerOptions": {
+    "allowJs": true,
+    "allowSyntheticDefaultImports": true,
+    "baseUrl": "./",
+    "declaration": true,
+    "esModuleInterop": true,
+    "inlineSourceMap": false,
+    "lib": ["esnext"],
+    "listEmittedFiles": false,
+    "listFiles": false,
+    "noFallthroughCasesInSwitch": true,
+    "pretty": true,
+    "resolveJsonModule": true,
+    "skipLibCheck": true,
+    "strict": true,
+    "traceResolution": false,
+    "noImplicitOverride": true,
+    "types": ["node"]
+  },
+  "compileOnSave": false,
+  "exclude": ["node_modules", "dist"]
+}

package/tsconfig.json

@@ -1,38 +1,12 @@
 {
+  "extends": "./tsconfig.base.json",
   "compilerOptions": {
-    "declaration": true,
-    "outDir": "./dist",
-    "module": "commonjs",
-    "target": "es6",
-    "lib": [
-      //      "es2015",
-      "esnext"
-    ],
-    "strict": true,
-    "esModuleInterop": true,
-    "moduleResolution": "node",
-    "declarationDir": "./dist",
-    "skipLibCheck": true,
-    "downlevelIteration": true,
-    "experimentalDecorators": true,
-    //    "allowJs": true,
-    //    "allowSyntheticDefaultImports": true,
-    //    "forceConsistentCasingInFileNames": true,
-    //    "noFallthroughCasesInSwitch": true,
-    //    "resolveJsonModule": true,
-    //    "isolatedModules": true,
-    //    "noEmit": true,
-    "typeRoots": [
-      "node_modules/@types"
-    ]
+    "rootDir": "./",
+    "outDir": "dist/dev",
+    "module": "NodeNext",
+    "target": "ESNext",
+    "moduleResolution": "NodeNext",
+    "sourceMap": true
   },
-  "include": [
-    "src"
-  ],
-  "exclude": [
-    //    "node_modules/data-structure-typed",
-    "node_modules",
-    "dist"
-  ]
+  "include": ["./src/**/*.ts"]
 }
-

package/tsconfig.test.json

@@ -0,0 +1,8 @@
+{
+  "extends": "./tsconfig.json",
+  "compilerOptions": {
+    "noEmit": true,
+    "types": ["node", "jest"]
+  },
+  "include": ["./test/**/*.ts"]
+}

package/tsconfig.types.json

@@ -0,0 +1,15 @@
+{
+  "extends": "./tsconfig.base.json",
+  "compilerOptions": {
+    "target": "ES2018",
+    "lib": ["ES2018", "DOM"],
+    "module": "NodeNext",
+    "moduleResolution": "NodeNext",
+    "declaration": true,
+    "emitDeclarationOnly": true,
+    "declarationMap": false,
+    "outDir": "dist/types"
+  },
+  "include": ["./src/**/*.ts"],
+  "exclude": ["dist", "node_modules", "test"]
+}

package/tsup.config.js

@@ -0,0 +1,28 @@
+import { defineConfig } from 'tsup';
+
+export default defineConfig([
+  {
+    entry: { "max-heap-typed": "src/index.ts" },
+    target: 'es2018',
+    format: ["iife"],
+    clean: true,
+    sourcemap: true,
+    minify: true,
+    outDir: "dist/umd",
+    globalName: "minHeapTyped",
+    platform: "browser",
+    outExtension: () => ({ js: '.min.js' }),
+  },
+  {
+    entry: { "max-heap-typed": "src/index.ts" },
+    target: 'es2018',
+    format: ["iife"],
+    clean: false,
+    sourcemap: true,
+    minify: false,
+    outDir: "dist/umd",
+    globalName: "minHeapTyped",
+    platform: "browser",
+    outExtension: () => ({ js: '.js' }),
+  }
+]);

package/tsup.node.config.js

@@ -0,0 +1,37 @@
+import { defineConfig } from "tsup";
+
+export default defineConfig([
+  // ESM
+  {
+    entry: { index: "src/index.ts" },
+    format: ["esm"],
+    outDir: "dist/esm",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: true,
+    target: "es2018",
+    outExtension() {
+      return { js: ".mjs" }
+    },
+  },
+
+  // CJS
+  {
+    entry: { index: "src/index.ts" },
+    format: ["cjs"],
+    outDir: "dist/cjs",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: false,
+    target: "es2018",
+    outExtension() {
+      return { js: ".cjs" };
+    },
+  },
+]);