twzurkan

/// This is a simple Heap implementation which can be used as a priority queue.
class Heap<T:Comparable> {
    typealias HeapComparator<T:Comparable> = (_ l:T,_ r:T) -> Bool
    var heap = [T]()
    var count:Int {
        get {
            heap.count
        }
    }