net.walend.disentangle.heap.MinDoubleHeapOrdering$
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.
Attributes Graph Reset zoom Hide graph Show graph
Supertypes trait PartialOrdering [Double ]
trait Equiv [Double ]
trait Serializable
class Object
trait Matchable
class Any
Self type Members list Concise view
Value members
A key that will among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.
A key that will among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.
Attributes
Minimum value for the DoubleHeap
Minimum value for the DoubleHeap
Attributes
Use require to check the key.
Use require to check the key.
Attributes Throws: IllegalArgumentException
if the key is unusable
Attributes Returns: 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
Attributes Inherited from: PartialOrdering
Attributes Inherited from: PartialOrdering
Attributes Inherited from: PartialOrdering
Attributes Inherited from: PartialOrdering
Attributes Inherited from: PartialOrdering