A hashed heap is a heap with a hash map (also known as a dictionary) to speed up lookup of elements by value. This combination doesn't compromize on time performance but requires extra storage for the hash map. This is mainly used for heuristic search algorihms, in particular A*.
See HashedHeap.swift for the implementation. See Heap for a detailed explanation of the basic heap implementation.
Written for the Swift Algorithm Club by Alejandro Isaza