Pairing heap.
The root node is the minimum element according to comparator.
Returns true iff a < b.
Private
Returns a new iterator over the entries in the heap.
Returns a new iterator over the entries in the heap. The entries will be removed as they are iterated.
Generated using TypeDoc
Pairing heap.
The root node is the minimum element according to comparator.
Final