Reversible iterable that is a view on elements of that heap.
Flag of being disposed.
Linked reified set that is a view on nodes of that heap.
Number of elements in the collection.
Adds the element with corresponding priority to the heap and returns constructed node that corresponds to the element and the priority.
Disposes the structure and its dependent ones.
Retrieves the root node and removes it from the heap. It is a node with the minimum priority.
Retrieves the root node. It is a node with the minimum priority.