Hierarchical ordering as defined in Bourdoncle's paper "Efficient chaotic iteration strategies with widenings", FMPA'93.
- Companion:
- object
class GraphOrdering[N]
trait Ordering[N]
trait PartialOrdering[N]
trait Equiv[N]
trait Serializable
trait Comparator[N]
class Object
trait Matchable
class Any
Type members
Inherited classlikes
Value members
Abstract methods
Concrete methods
Converts a hierarchical ordering into a string on the basis of its parenthesized sequence
Converts a hierarchical ordering into a string on the basis of its parenthesized sequence
- Definition Classes
- GraphOrdering -> Any
Inherited methods
It returns whether n
is an head element.
It returns whether n
is an head element.
- Inherited from:
- GraphOrdering
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
- Inherited from:
- GraphOrdering
def thenComparing[U <: Comparable[_ >: U <: <FromJavaObject>]](x$0: Function[_ >: N <: <FromJavaObject>, _ <: U]): Comparator[N]
- Inherited from:
- Comparator
def thenComparing[U <: <FromJavaObject>](x$0: Function[_ >: N <: <FromJavaObject>, _ <: U], x$1: Comparator[_ >: U <: <FromJavaObject>]): Comparator[N]
- Inherited from:
- Comparator
Returns the elements which are part of the ordering in the correct order.
Returns the elements which are part of the ordering in the correct order.
- Inherited from:
- GraphOrdering