|Did you know ...
|Adds Key with priority Priority to Heap0, constructing a new heap in Heap.
|Deletes Key from Heap0, leaving its priority in Priority and the resulting data structure in Heap.
|True if Heap is an empty heap.
|Retrieves the minimum-priority pair Priority-Key from Heap0.
|Determines the number of elements in Heap.
|Constructs a list List of Priority-Element terms, ordered by (ascending) priority.
|Returns true if X is a heap.
|If List is a list of Priority-Element terms, constructs a heap out of List.
|Merge the two heaps Heap0 and Heap1 in Heap.
|Unifies Key with the minimum-priority element of Heap and Priority with its priority value.
|Gets the two minimum-priority elements from Heap.
|True if Heap is a heap with the single element Priority-Key.