TransitiveClosureHeapOrdering

net.walend.disentangle.graph.semiring.TransitiveClosure$.TransitiveClosureHeapOrdering$

A heap ordering that puts true above false.

Attributes

Graph
Supertypes
trait PartialOrdering[TransitiveClosureHeapKey]
trait Serializable
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

A key that will be among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.

A key that will be among items on the bottom of the heap. Used primarily to add items that will eventually flow higher.

Attributes

Top value for the Heap if it is ever present

Top value for the Heap if it is ever present

Attributes

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

Inherited methods

Attributes

Inherited from:
PartialOrdering

Attributes

Inherited from:
PartialOrdering

Attributes

Inherited from:
PartialOrdering

Attributes

Inherited from:
PartialOrdering
def reverse: PartialOrdering[T]

Attributes

Inherited from:
PartialOrdering