A key that will among items on the bottom of the heap.
A key that will among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.
Minimum value for the DoubleHeap
Minimum value for the DoubleHeap
Use require to check the key.
Use require to check the key.
IllegalArgumentException
if the key is unusable
Some negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second, or None if they can't be compared
A heap ordering that puts the least Double on top.
If you imitate this code, observe that lteq and tryCompare find the inverse of what you'd have for MaxDoubleHeapOrdering.