data-structure-typed 2.1.0 → 2.1.2

package/dist/{cjs → types}/data-structures/binary-tree/avl-tree-counter.d.ts

@@ -61,7 +61,7 @@ export declare class AVLTreeCounterNode<K = any, V = any> extends AVLTreeNode<K,
  * @template V
  * @template R
  */
-export declare class AVLTreeCounter<K = any, V = any, R extends object = object> extends AVLTree<K, V, R> implements IBinaryTree<K, V, R> {
+export declare 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)
@@ -78,7 +78,7 @@ export declare class AVLTreeCounter<K = any, V = any, R extends object = object>
      * @returns Total count recomputed from nodes.
      */
     getComputedCount(): number;
-    _createNode(key: K, value?: V, count?: number): AVLTreeCounterNode<K, V>;
+    createNode(key: K, value?: V, count?: number): AVLTreeCounterNode<K, V>;
     /**
      * Type guard: check whether the input is an AVLTreeCounterNode.
      * @remarks Time O(1), Space O(1)
@@ -132,7 +132,7 @@ export declare 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.
      */
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTreeCounter<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTreeCounter<MK, MV, MR>;
     /**
      * (Protected) Create an empty instance of the same concrete class.
      * @remarks Time O(1), Space O(1)
@@ -142,7 +142,7 @@ export declare 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 _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<AVLTreeCounterOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<AVLTreeCounterOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N log N), Space O(N)
@@ -153,7 +153,7 @@ export declare 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 _createLike<TK = K, TV = V, TR extends object = R>(iter?: Iterable<TK | AVLTreeCounterNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<AVLTreeCounterOptions<TK, TV, TR>>): AVLTreeCounter<TK, TV, TR>;
+    protected _createLike<TK = K, TV = V, TR = R>(iter?: Iterable<TK | AVLTreeCounterNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<AVLTreeCounterOptions<TK, TV, TR>>): AVLTreeCounter<TK, TV, TR>;
     /**
      * (Protected) Normalize input into a node plus its effective value and count.
      * @remarks Time O(1), Space O(1)

package/dist/{esm → types}/data-structures/binary-tree/avl-tree-multi-map.d.ts

@@ -60,7 +60,7 @@ export declare class AVLTreeMultiMapNode<K = any, V = any> extends AVLTreeNode<K
  * @template V
  * @template R
  */
-export declare class AVLTreeMultiMap<K = any, V = any, R extends object = object> extends AVLTree<K, V[], R> implements IBinaryTree<K, V[], R> {
+export declare 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)
@@ -69,7 +69,7 @@ export declare class AVLTreeMultiMap<K = any, V = any, R extends object = object
      * @returns New AVLTreeMultiMap instance.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined | R>, options?: AVLTreeMultiMapOptions<K, V[], R>);
-    _createNode(key: K, value?: V[]): AVLTreeMultiMapNode<K, V>;
+    createNode(key: K, value?: V[]): AVLTreeMultiMapNode<K, V>;
     add(keyNodeOrEntry: K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
     add(key: K, value: V): boolean;
     /**
@@ -98,7 +98,7 @@ export declare 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.
      */
-    map<MK = K, MVArr extends unknown[] = V[], MR extends object = object>(callback: EntryCallback<K, V[] | undefined, [MK, MVArr]>, options?: Partial<AVLTreeOptions<MK, MVArr, MR>>, thisArg?: unknown): AVLTreeMultiMap<MK, ElemOf<MVArr>, MR>;
+    map<MK = K, MVArr extends unknown[] = V[], MR = any>(callback: EntryCallback<K, V[] | undefined, [MK, MVArr]>, options?: Partial<AVLTreeOptions<MK, MVArr, MR>>, thisArg?: unknown): AVLTreeMultiMap<MK, ElemOf<MVArr>, MR>;
     /**
      * Create a new tree by mapping each [key, values] bucket.
      * @remarks Time O(N log N), Space O(N)
@@ -110,7 +110,7 @@ export declare 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.
      */
-    map<MK = K, MV = V[], MR extends object = object>(callback: EntryCallback<K, V[] | undefined, [MK, MV]>, options?: Partial<AVLTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
+    map<MK = K, MV = V[], MR = any>(callback: EntryCallback<K, V[] | undefined, [MK, MV]>, options?: Partial<AVLTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
     /**
      * (Protected) Create an empty instance of the same concrete class.
      * @remarks Time O(1), Space O(1)
@@ -120,7 +120,7 @@ export declare 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 _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<AVLTreeOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<AVLTreeOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N log N), Space O(N)
@@ -131,5 +131,5 @@ export declare 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 _createLike<TK = K, TV = V, TR extends object = 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>;
+    protected _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/dist/{esm → types}/data-structures/binary-tree/avl-tree.d.ts

@@ -136,7 +136,7 @@ export declare class AVLTreeNode<K = any, V = any> extends BSTNode<K, V> {
  *  //      { minute: 15, temperature: 58.6 }
  *  //    ]
  */
-export declare class AVLTree<K = any, V = any, R extends object = object> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
+export declare 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).
@@ -153,7 +153,7 @@ export declare class AVLTree<K = any, V = any, R extends object = object> extend
      * @param [value] - The value for the new node.
      * @returns The newly created AVLTreeNode.
      */
-    _createNode(key: K, value?: V): AVLTreeNode<K, V>;
+    createNode(key: K, value?: V): AVLTreeNode<K, V>;
     /**
      * Checks if the given item is an `AVLTreeNode` instance.
      * @remarks Time O(1), Space O(1)
@@ -200,7 +200,7 @@ export declare class AVLTree<K = any, V = any, R extends object = object> extend
      * @param [thisArg] - `this` context for the callback.
      * @returns A new, mapped AVLTree.
      */
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
     /**
      * (Protected) Creates a new, empty instance of the same AVLTree constructor.
      * @remarks Time O(1)
@@ -209,7 +209,7 @@ export declare class AVLTree<K = any, V = any, R extends object = object> extend
      * @param [options] - Options for the new tree.
      * @returns A new, empty tree.
      */
-    protected _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Creates a new instance of the same AVLTree constructor, potentially with different generic types.
      * @remarks Time O(N log N) (from constructor) due to processing the iterable.
@@ -219,7 +219,7 @@ export declare class AVLTree<K = any, V = any, R extends object = object> extend
      * @param [options] - Options for the new tree.
      * @returns A new AVLTree.
      */
-    protected _createLike<TK = K, TV = V, TR extends object = 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>;
+    protected _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>;
     /**
      * (Protected) Swaps properties of two nodes, including height.
      * @remarks Time O(H) (due to `ensureNode`), but O(1) if nodes are passed directly.

package/dist/{esm → types}/data-structures/binary-tree/binary-tree.d.ts

@@ -186,7 +186,7 @@ export declare class BinaryTreeNode<K = any, V = any> {
  *
  *     console.log(evaluate(expressionTree.root)); // -27
  */
-export declare class BinaryTree<K = any, V = any, R extends object = object> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R> {
+export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, R> {
     iterationType: IterationType;
     /**
      * Creates an instance of BinaryTree.
@@ -260,7 +260,7 @@ export declare class BinaryTree<K = any, V = any, R extends object = object> ext
      * @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>;
     /**
      * Creates a new, empty tree of the same type and configuration.
      * @remarks Time O(1) (excluding options cloning), Space O(1)
@@ -596,7 +596,7 @@ export declare class BinaryTree<K = any, V = any, R extends object = object> ext
      * @param [thisArg] - `this` context for the callback.
      * @returns A new, mapped tree.
      */
-    map<MK = K, MV = V, MR extends object = object>(cb: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): BinaryTree<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(cb: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): BinaryTree<MK, MV, MR>;
     /**
      * Generates a string representation of the tree for visualization.
      * @remarks Time O(N), visits every node. Space O(N*H) or O(N^2) in the worst case, as the string width can grow significantly.
@@ -638,7 +638,7 @@ export declare class BinaryTree<K = any, V = any, R extends object = object> ext
      * @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>;
     /**
      * (Protected) Creates a new, empty instance of the same tree constructor.
      * @remarks Time O(1)
@@ -647,7 +647,7 @@ export declare class BinaryTree<K = any, V = any, R extends object = object> ext
      * @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;
     /**
      * (Protected) Creates a new instance of the same tree constructor, potentially with different generic types.
      * @remarks Time O(N) (or as per constructor) due to processing the iterable.
@@ -657,7 +657,7 @@ export declare class BinaryTree<K = any, V = any, R extends object = object> ext
      * @param [options] - Options for the new tree.
      * @returns A new tree.
      */
-    protected _createLike<TK = K, TV = V, TR extends object = 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>;
+    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>;
     /**
      * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
      * @remarks Time O(1)

package/dist/{esm → types}/data-structures/binary-tree/bst.d.ts

@@ -127,7 +127,7 @@ export declare class BSTNode<K = any, V = any> extends BinaryTreeNode<K, V> {
  *     console.log(findLCA(5, 35)); // 15
  *     console.log(findLCA(20, 30)); // 25
  */
-export declare class BST<K = any, V = any, R extends object = object> extends BinaryTree<K, V, R> implements IBinaryTree<K, V, R> {
+export declare 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).
@@ -180,7 +180,7 @@ export declare class BST<K = any, V = any, R extends object = object> extends Bi
      * @param [value] - The value for the new node (used if not in Map mode).
      * @returns The newly created BSTNode.
      */
-    _createNode(key: K, value?: V): BSTNode<K, V>;
+    createNode(key: K, value?: V): BSTNode<K, V>;
     /**
      * Ensures the input is a node. If it's a key or entry, it searches for the node.
      * @remarks Time O(log N) (height of the tree), O(N) worst-case.
@@ -341,7 +341,7 @@ export declare class BST<K = any, V = any, R extends object = object> extends Bi
      * @param [thisArg] - `this` context for the callback.
      * @returns A new, mapped BST.
      */
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): BST<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): BST<MK, MV, MR>;
     /**
      * Deletes the first node found that satisfies the predicate.
      * @remarks Performs an in-order traversal. Time O(N) worst-case (O(log N) to find + O(log N) to delete). Space O(log N) for stack.
@@ -358,7 +358,7 @@ export declare class BST<K = any, V = any, R extends object = object> extends Bi
      * @param [options] - Options for the new BST.
      * @returns A new, empty BST.
      */
-    protected _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Creates a new instance of the same BST constructor, potentially with different generic types.
      * @remarks Time O(N log N) or O(N^2) (from constructor) due to processing the iterable.
@@ -368,7 +368,7 @@ export declare class BST<K = any, V = any, R extends object = object> extends Bi
      * @param [options] - Options for the new BST.
      * @returns A new BST.
      */
-    protected _createLike<TK = K, TV = V, TR extends object = 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>;
+    protected _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>;
     /**
      * (Protected) Snapshots the current BST's configuration options.
      * @remarks Time O(1)
@@ -376,7 +376,7 @@ export declare class BST<K = any, V = any, R extends object = object> extends Bi
      * @template TK, TV, TR - Generic types for the options.
      * @returns The options object.
      */
-    protected _snapshotOptions<TK = K, TV = V, TR extends object = R>(): BSTOptions<TK, TV, TR>;
+    protected _snapshotOptions<TK = K, TV = V, TR = R>(): BSTOptions<TK, TV, TR>;
     /**
      * (Protected) Converts a key, node, or entry into a standardized [node, value] tuple.
      * @remarks Time O(1)

package/dist/{esm → types}/data-structures/binary-tree/red-black-tree.d.ts

@@ -49,7 +49,7 @@ export declare class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
     set right(v: RedBlackTreeNode<K, V> | null | undefined);
 }
 /**
- * RRed-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
@@ -100,7 +100,7 @@ export declare class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
  *     );
  *     console.log(stocksInRange); // ['GOOGL', 'META', 'MSFT']
  */
-export declare class RedBlackTree<K = any, V = any, R extends object = object> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
+export declare 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>, options?: RedBlackTreeOptions<K, V, R>);
     protected _root: RedBlackTreeNode<K, V> | undefined;
     /**
@@ -117,7 +117,7 @@ export declare class RedBlackTree<K = any, V = any, R extends object = object> e
      * @param color - See parameter type for details.
      * @returns A new RedBlackTreeNode instance.
      */
-    _createNode(key: K, value?: V, color?: RBTNColor): RedBlackTreeNode<K, V>;
+    createNode(key: K, value?: V, color?: RBTNColor): RedBlackTreeNode<K, V>;
     /**
      * Type guard: check whether the input is a RedBlackTreeNode.
      * @remarks Time O(1), Space O(1)
@@ -157,9 +157,9 @@ export declare class RedBlackTree<K = any, V = any, R extends object = object> e
      * @param [thisArg] - See parameter type for details.
      * @returns A new RedBlackTree with mapped entries.
      */
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): RedBlackTree<MK, MV, MR>;
-    protected _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this;
-    protected _createLike<TK = K, TV = V, TR extends object = R>(iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): RedBlackTree<TK, TV, TR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): RedBlackTree<MK, MV, MR>;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this;
+    protected _createLike<TK = K, TV = V, TR = R>(iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): RedBlackTree<TK, TV, TR>;
     protected _setRoot(v: RedBlackTreeNode<K, V> | undefined): void;
     protected _replaceNode(oldNode: RedBlackTreeNode<K, V>, newNode: RedBlackTreeNode<K, V>): RedBlackTreeNode<K, V>;
     /**

package/dist/{cjs → types}/data-structures/binary-tree/tree-counter.d.ts

@@ -64,7 +64,7 @@ export declare class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<
  * @template V
  * @template R
  */
-export declare class TreeCounter<K = any, V = any, R extends object = object> extends RedBlackTree<K, V, R> implements IBinaryTree<K, V, R> {
+export declare 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)
@@ -86,7 +86,7 @@ export declare class TreeCounter<K = any, V = any, R extends object = object> ex
      * @returns Total count recomputed from nodes.
      */
     getComputedCount(): number;
-    _createNode(key: K, value?: V, color?: RBTNColor, count?: number): TreeCounterNode<K, V>;
+    createNode(key: K, value?: V, color?: RBTNColor, count?: number): TreeCounterNode<K, V>;
     /**
      * Type guard: check whether the input is a TreeCounterNode.
      * @remarks Time O(1), Space O(1)
@@ -134,7 +134,7 @@ export declare class TreeCounter<K = any, V = any, R extends object = object> ex
      * @param [thisArg] - Value for `this` inside the callback.
      * @returns A new TreeCounter with mapped entries.
      */
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): TreeCounter<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): TreeCounter<MK, MV, MR>;
     /**
      * Deep copy this tree, preserving map mode and aggregate counts.
      * @remarks Time O(N), Space O(N)
@@ -150,7 +150,7 @@ export declare class TreeCounter<K = any, V = any, R extends object = object> ex
      * @param [options] - Optional constructor options for the like-kind instance.
      * @returns An empty like-kind instance.
      */
-    protected _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<BSTOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N log N), Space O(N)
@@ -161,7 +161,7 @@ export declare class TreeCounter<K = any, V = any, R extends object = object> ex
      * @param [options] - Options merged with the current snapshot.
      * @returns A like-kind TreeCounter built from the iterable.
      */
-    protected _createLike<TK = K, TV = V, TR extends object = 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>;
+    protected _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>;
     /**
      * (Protected) Normalize input into a node plus its effective value and count.
      * @remarks Time O(1), Space O(1)

package/dist/{cjs → types}/data-structures/binary-tree/tree-multi-map.d.ts

@@ -224,7 +224,7 @@ export declare class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode
  *  //      ]
  *  //    ]
  */
-export declare class TreeMultiMap<K = any, V = any, R extends object = object> extends RedBlackTree<K, V[], R> implements IBinaryTree<K, V[], R> {
+export declare 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)
@@ -233,7 +233,7 @@ export declare class TreeMultiMap<K = any, V = any, R extends object = object> e
      * @returns New TreeMultiMap instance.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined | R>, options?: TreeMultiMapOptions<K, V[], R>);
-    _createNode(key: K, value?: V[]): TreeMultiMapNode<K, V>;
+    createNode(key: K, value?: V[]): TreeMultiMapNode<K, V>;
     add(keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
     add(key: K, value: V): boolean;
     /**
@@ -244,8 +244,8 @@ export declare class TreeMultiMap<K = any, V = any, R extends object = object> e
      * @returns True if the value was removed; false if not found.
      */
     deleteValue(keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined, value: V): boolean;
-    map<MK = K, MVArr extends unknown[] = V[], MR extends object = object>(callback: EntryCallback<K, V[] | undefined, [MK, MVArr]>, options?: Partial<RedBlackTreeOptions<MK, MVArr, MR>>, thisArg?: unknown): TreeMultiMap<MK, ElemOf<MVArr>, MR>;
-    map<MK = K, MV = V[], MR extends object = object>(callback: EntryCallback<K, V[] | undefined, [MK, MV]>, options?: Partial<RedBlackTreeOptions<MK, MV, MR>>, thisArg?: unknown): RedBlackTree<MK, MV, MR>;
+    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>;
+    map<MK = K, MV = V[], MR = any>(callback: EntryCallback<K, V[] | undefined, [MK, MV]>, options?: Partial<RedBlackTreeOptions<MK, MV, MR>>, thisArg?: unknown): RedBlackTree<MK, MV, MR>;
     /**
      * (Protected) Create an empty instance of the same concrete class.
      * @remarks Time O(1), Space O(1)
@@ -255,7 +255,7 @@ export declare class TreeMultiMap<K = any, V = any, R extends object = object> e
      * @param [options] - Optional constructor options for the like-kind instance.
      * @returns An empty like-kind instance.
      */
-    protected _createInstance<TK = K, TV = V, TR extends object = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this;
+    protected _createInstance<TK = K, TV = V, TR = R>(options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): this;
     /**
      * (Protected) Create a like-kind instance and seed it from an iterable.
      * @remarks Time O(N log N), Space O(N)
@@ -266,5 +266,5 @@ export declare class TreeMultiMap<K = any, V = any, R extends object = object> e
      * @param [options] - Options merged with the current snapshot.
      * @returns A like-kind RedBlackTree built from the iterable.
      */
-    protected _createLike<TK = K, TV = V, TR extends object = R>(iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): RedBlackTree<TK, TV, TR>;
+    protected _createLike<TK = K, TV = V, TR = R>(iter?: Iterable<TK | RedBlackTreeNode<TK, TV> | [TK | null | undefined, TV | undefined] | null | undefined | TR>, options?: Partial<RedBlackTreeOptions<TK, TV, TR>>): RedBlackTree<TK, TV, TR>;
 }

package/dist/{esm → types}/data-structures/heap/heap.d.ts

@@ -188,7 +188,7 @@ import { IterableElementBase } from '../base';
  *     ]);
  *     console.log(scheduleTasks(tasks, 2)); // expectedMap
  */
-export declare class Heap<E = unknown, R = never> extends IterableElementBase<E, R> {
+export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
     protected _equals: (a: E, b: E) => boolean;
     /**
      * Create a Heap and optionally bulk-insert elements.
@@ -227,7 +227,7 @@ export declare class Heap<E = unknown, R = never> extends IterableElementBase<E,
      * @param [options] - Heap options including comparator.
      * @returns A new heap instance of this class.
      */
-    static from<T, R = never, 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>): S;
+    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>): S;
     /**
      * Build a Heap from an iterable in linear time given a comparator.
      * @remarks Time O(N), Space O(N)
@@ -237,7 +237,7 @@ export declare class Heap<E = unknown, R = never> extends IterableElementBase<E,
      * @param options - Heap options including comparator.
      * @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>;
     /**
      * Insert an element.
      * @remarks Time O(1) amortized, Space O(1)
@@ -493,7 +493,7 @@ export declare class FibonacciHeap<E> {
      * @returns void
      */
     merge(heapToMerge: FibonacciHeap<E>): void;
-    _createNode(element: E): FibonacciHeapNode<E>;
+    createNode(element: E): FibonacciHeapNode<E>;
     isEmpty(): boolean;
     protected _defaultComparator(a: E, b: E): number;
     protected mergeWithRoot(node: FibonacciHeapNode<E>): void;

package/dist/{esm → types}/data-structures/linked-list/singly-linked-list.d.ts

@@ -375,7 +375,7 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      * @param value - Value to wrap in a node.
      * @returns A new SinglyLinkedListNode instance.
      */
-    protected _createNode(value: E): SinglyLinkedListNode<E>;
+    protected createNode(value: E): SinglyLinkedListNode<E>;
     /**
      * (Protected) Check if input is a node predicate function.
      * @remarks Time O(1), Space O(1)

package/dist/{esm → types}/interfaces/binary-tree.d.ts

@@ -5,7 +5,7 @@ import type { BinaryTreeDeleteResult, BinaryTreeOptions, BTNRep, DFSOrderPattern
  * 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> {
     readonly size: number;
     readonly root: BinaryTreeNode<K, V> | null | undefined;
     readonly isMapMode: boolean;
@@ -14,7 +14,7 @@ export interface IBinaryTree<K = any, V = any, R extends object = object> {
     readonly store: Map<K, V | undefined>;
     readonly toEntryFn?: ToEntryFn<K, V, R>;
     readonly isDuplicate: boolean;
-    _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>;
     add(keyOrNodeOrEntryOrRawElement: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V, count?: number): boolean;
     addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): boolean[];
@@ -53,7 +53,7 @@ export interface IBinaryTree<K = any, V = any, R extends object = object> {
     search<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V> | null>, onlyOne?: boolean, callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>[];
     clone(): this;
     filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): this;
-    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): IBinaryTree<MK, MV, MR>;
+    map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): IBinaryTree<MK, MV, MR>;
     merge(anotherTree: IBinaryTree<K, V, R>): void;
     refill(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): void;
 }