data-structure-typed 2.1.1 → 2.1.2

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

@@ -78,7 +78,7 @@ export declare class AVLTreeCounter<K = any, V = any, R = any> extends AVLTree<K
      * @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)

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

@@ -69,7 +69,7 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = any> extends AVLTree<
      * @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;
     /**

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

@@ -153,7 +153,7 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      * @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)

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

@@ -260,7 +260,7 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @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)

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

@@ -180,7 +180,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      * @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.

package/dist/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);
 }
 /**
- * RRRRRRRRRRRRRRRRRRed-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
@@ -117,7 +117,7 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      * @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)

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

@@ -86,7 +86,7 @@ export declare class TreeCounter<K = any, V = any, R = any> extends RedBlackTree
      * @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)

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

@@ -233,7 +233,7 @@ export declare class TreeMultiMap<K = any, V = any, R = any> extends RedBlackTre
      * @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;
     /**

package/dist/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/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/types/interfaces/binary-tree.d.ts

@@ -14,7 +14,7 @@ export interface IBinaryTree<K = any, V = any, R = any> {
     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[];