HeapMember

net.walend.disentangle.heap.Heap.HeapMember

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Members list

Concise view

Value members

Abstract methods

def isInHeap: Boolean
def key: K
def key_(newKey: K): Unit
def raiseKey(candidateKey: K): Unit

If candidateKey will move the HeapMember higher than the heap, change the key. Otherwise, no change.

If candidateKey will move the HeapMember higher than the heap, change the key. Otherwise, no change.

Attributes

candidateKey

proposed new key

def remove(): Unit