Like std::collections::BinaryHeap but supporting some extra features:

• You can update the priority of an existing item
• You can iterate over the entries in order without modifying the HeapQueue
• T must be Copy + Eq + Hash
• T need not be Ord