data-structure-typed 2.1.1 → 2.2.0

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[];