binomial-heap
Version:
No dependency binomial heap, compatible with typescript, can have custom compare function
8 lines (7 loc) • 753 B
TypeScript
import { Heap, Tree } from "../types";
export declare const flattenTree: <T>(tree: Tree<T>, acc: T[]) => void;
export declare const flatten: <T>(heap: Tree<T>[]) => T[];
export declare const failedMerge: <T>(a: Tree<T>[], compare: (a: T, b: T) => number, getMin: (params: number) => void) => Tree<T>[];
export declare const mergeHeaps: <T>(a: Tree<T>[], b: Tree<T>[], compare: (a: T, b: T) => number, getMin: (params: number) => void) => Tree<T>[];
export declare const mergeFunctionImpl: <T, E>(heap: Heap<T>, items: Tree<E>[], compare: (a: T | E, b: T | E) => number, nextCompare: Function | undefined, disableSanityCheck: boolean) => Tree<T>[];
export declare const mergeTree: <T>(a: Tree<T>, b: Tree<T>, compare: (a: T, b: T) => number) => Tree<T>;