/**
 * A generic array-based min-heap implementation for priority queue usage.  Used to track operation timeouts.
 */
export declare class MinHeap<T> {
    private lessThanOperator;
    private heap;
    private currentSize;
    constructor(lessThanOperator: (lhs: T, rhs: T) => boolean);
    /**
     * Push a value into the min-heap
     *
     * @param value value to add
     */
    push(value: T): void;
    /**
     * Gets the minimum value of the heap.  Returns undefined if the heap is empty.
     */
    peek(): T | undefined;
    /**
     * Pops the minimum value from the heap.  Throws an exception if the heap is empty.
     */
    pop(): T;
    /**
     * Checks if the min-heap is empty or not
     */
    empty(): boolean;
    /**
     * Removes all values from the min-heap
     */
    clear(): void;
    private swapElements;
    private heapifyDown;
    private heapifyUp;
}