A generic Fibonacci heap
A structure that makes an extreme key of some key,value pair available
A structure that makes an extreme key of some key,value pair available
v0.0.0
The heap moves the greatest value to the top, according to some HeapOrdering.
The heap moves the greatest value to the top, according to some HeapOrdering.
the key type in this heap map.
A heap ordering that puts the least Double on top.
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.
A generic Fibonacci heap
v0.0.0