GraphOrdering

A GraphOrdering is an ordering on objects of the type N (which should be thought of as nodes of a graph), where for each object we mark whether it is an head element or not. Note that a graph ordering generally considers only a subset of the elements of type N, those returned by the toSeq method. The result of applying any method of this trait on any element which is not part of the domain is not specified.

N: the type of the ordered element.

Linear Supertypes

Ordering[N], PartialOrdering[N], Equiv[N], Serializable, Serializable, Comparator[N], AnyRef, Any

Known Subclasses

DFOrdering, HierarchicalOrdering

Instance Constructors

new GraphOrdering()

Type Members

class Ops extends AnyRef

Definition Classes
Ordering

Abstract Value Members

abstract def compare(x: N, y: N): Int

Definition Classes
Ordering → Comparator
abstract def isHead(n: N): Boolean

It returns whether n is an head element.
abstract def stringPrefix: String

Defines the prefix of this object's toString representation.
abstract def toSeq: Seq[N]

Returns the elements which are part of the ordering in the correct order.

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def equiv(x: N, y: N): Boolean

Definition Classes
Ordering → PartialOrdering → Equiv
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def gt(x: N, y: N): Boolean

Definition Classes
Ordering → PartialOrdering
def gteq(x: N, y: N): Boolean

Definition Classes
Ordering → PartialOrdering
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lt(x: N, y: N): Boolean

Definition Classes
Ordering → PartialOrdering
def lteq(x: N, y: N): Boolean

Definition Classes
Ordering → PartialOrdering
def max(x: N, y: N): N

Definition Classes
Ordering
def min(x: N, y: N): N

Definition Classes
Ordering
implicit def mkOrderingOps(lhs: N): Ops

Definition Classes
Ordering
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def on[U](f: (U) ⇒ N): Ordering[U]

Definition Classes
Ordering
def reverse: Ordering[N]

Definition Classes
Ordering → PartialOrdering
def reversed(): Comparator[N]

Definition Classes
Comparator
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: N, _ <: U]): Comparator[N]

Definition Classes
Comparator
def thenComparing[U](arg0: Function[_ >: N, _ <: U], arg1: Comparator[_ >: U]): Comparator[N]

Definition Classes
Comparator
def thenComparing(arg0: Comparator[_ >: N]): Comparator[N]

Definition Classes
Comparator
def thenComparingDouble(arg0: ToDoubleFunction[_ >: N]): Comparator[N]

Definition Classes
Comparator
def thenComparingInt(arg0: ToIntFunction[_ >: N]): Comparator[N]

Definition Classes
Comparator
def thenComparingLong(arg0: ToLongFunction[_ >: N]): Comparator[N]

Definition Classes
Comparator
def toString(): String

Converts a GraphOrdering into a string composed by the sequence of its elements in the correct order.
Converts a GraphOrdering into a string composed by the sequence of its elements in the correct order. Head elements are marked with parenthesis.

Definition Classes
GraphOrdering → AnyRef → Any
def tryCompare(x: N, y: N): Some[Int]

Definition Classes
Ordering → PartialOrdering
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object GraphOrdering | package finite

abstract class GraphOrdering[N] extends Ordering[N]

Instance Constructors

new GraphOrdering()

Type Members

class Ops extends AnyRef

Abstract Value Members

abstract def compare(x: N, y: N): Int

abstract def isHead(n: N): Boolean

abstract def stringPrefix: String

abstract def toSeq: Seq[N]

Concrete Value Members

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: N, y: N): Boolean

def finalize(): Unit

final def getClass(): Class[_]

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

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

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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

def lteq(x: N, y: N): Boolean

def max(x: N, y: N): N

def min(x: N, y: N): N

implicit def mkOrderingOps(lhs: N): Ops

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def on[U](f: (U) ⇒ N): Ordering[U]

def reverse: Ordering[N]

def reversed(): Comparator[N]

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

def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: N, _ <: U]): Comparator[N]

def thenComparing[U](arg0: Function[_ >: N, _ <: U], arg1: Comparator[_ >: U]): Comparator[N]

def thenComparing(arg0: Comparator[_ >: N]): Comparator[N]

def thenComparingDouble(arg0: ToDoubleFunction[_ >: N]): Comparator[N]

def thenComparingInt(arg0: ToIntFunction[_ >: N]): Comparator[N]

def thenComparingLong(arg0: ToLongFunction[_ >: N]): Comparator[N]

def toString(): String

def tryCompare(x: N, y: N): Some[Int]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Ordering[N]

Inherited from PartialOrdering[N]

Inherited from Equiv[N]

Inherited from Serializable

Inherited from Serializable

Inherited from Comparator[N]

Inherited from AnyRef

Inherited from Any

Ungrouped