HeapOrdering

net.walend.disentangle.heap.HeapOrdering

trait HeapOrdering[K] extends PartialOrdering[K]

The heap moves the greatest value to the top, according to some HeapOrdering.

Attributes

K: the key type in this heap map.
Graph
Supertypes: trait PartialOrdering[K]
trait Equiv[K]
trait Serializable
class Object
trait Matchable
class Any
Known subtypes: object FewestNodesHeapOrdering.type
object LeastWeightsOrdering.type
object MostProbableOrdering.type
object TransitiveClosureHeapOrdering.type
object MinDoubleHeapOrdering.type

Concise view

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 always be at the top of the heap if present at all. Used to efficiently remove items from the heap.

Generated with