HeapOrdering

abstract def AlwaysBottom: K

A key that will among items on the bottom of the heap.

abstract def AlwaysTop: K

A key that will always be at the top of the heap if present at all.

abstract def checkKey(key: K): Unit

abstract def lteq(x: K, y: K): Boolean

abstract def tryCompare(x: K, y: K): Option[Int]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def equiv(x: K, y: K): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def gt(x: K, y: K): Boolean

def gteq(x: K, y: K): Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lt(x: K, y: K): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reverse: PartialOrdering[K]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit