Disentangle-Graph
API
Generated with
Disentangle-Graph/net.walend.disentangle.graph.semiring/FewestNodes/FewestNodesHeapOrdering

FewestNodesHeapOrdering

net.walend.disentangle.graph.semiring.FewestNodes$.FewestNodesHeapOrdering$
object FewestNodesHeapOrdering extends HeapOrdering[Int]

A heap ordering that puts lower numbers on the top of the heap

Attributes

Graph
Supertypes
trait HeapOrdering[Int]
trait PartialOrdering[Int]
trait Equiv[Int]
trait Serializable
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

def AlwaysBottom: Int

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

def AlwaysTop: Int

Minimum value for the DoubleHeap

Minimum value for the DoubleHeap

Attributes

def checkKey(key: Int): Unit

Attributes

Throws:
IllegalArgumentException

if the key is unusable

def lteq(x: Int, y: Int): Boolean
def tryCompare(x: Int, y: Int): Option[Int]

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

Inherited methods

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

Attributes

Inherited from:
PartialOrdering
def gt(x: Int, y: Int): Boolean

Attributes

Inherited from:
PartialOrdering
def gteq(x: Int, y: Int): Boolean

Attributes

Inherited from:
PartialOrdering
def lt(x: Int, y: Int): Boolean

Attributes

Inherited from:
PartialOrdering
def reverse: PartialOrdering[T]

Attributes

Inherited from:
PartialOrdering
Generated with