@datastructures-js/heap/src/heap.d.ts

Min/Max Heap & Heap Sort implementation in javascript

export interface ICompare<T> {
  (a: T, b: T): number;
}

export class Heap<T> implements Iterable<T> {
  constructor(comparator: ICompare<T>, values?: T[], leaf?: T);
  toArray(): T[];
  [Symbol.iterator](): Iterator<T, any, undefined>;
  insert(value: T): Heap<T>;
  push(value: T): Heap<T>;
  extractRoot(): T | null;
  pop(): T | null;
  sort(): T[];
  fix(): Heap<T>;
  isValid(): boolean;
  clone(): Heap<T>;
  root(): T | null;
  top(): T | null;
  leaf(): T | null;
  size(): number;
  isEmpty(): boolean;
  clear(): void;
  static heapify<T>(values: T[], comparator: ICompare<T>): Heap<T>;
  static isHeapified<T>(values: T[], comparator: ICompare<T>): boolean;
}