Documentation

The PriorityQueue type represents an imperative heap-based priority queue.

Test whether the priority queue is empty.

Return the number of elements in the priority queue.

Create a new priority queue.

Enqueue a new element with the specified priority.

Dequeue the element with the minimal priority.

Return the element with the minimal priority.

Remove the specified element from the queue and return a computation of the flag indicating whether the element was actually removed.

Note that unlike other functions it has complexity O(n).

Remove an element satisfying the predicate and return a computation of the flag indicating whether the element was actually removed.

Note that unlike other functions it has complexity O(n).