core/it.unich.scalafix.finite/DFOrdering

DFOrdering

abstract class DFOrdering[N] extends GraphOrdering[N]

This class represents a depth-first ordering of a graph, as it appears in the Aho, Sehti, Ullman book on compilers. It extends the concept of graph ordering distinguishing between Advancing, Retreating and Cross edges.

Type parameters:
N

the type of the nodes of the graph

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

class OrderingOps
Inherited from:
Ordering

Value members

Abstract methods

def edgeType(u: N, v: N): EdgeType

It returns the type of an edge u -> v.

It returns the type of an edge u -> v.

Value parameters:
u

source node

v

target node

Inherited methods

def compare(x: N, y: N): Int
Inherited from:
Ordering
override def equiv(x: N, y: N): Boolean
Definition Classes
Ordering -> PartialOrdering -> Equiv
Inherited from:
Ordering
override def gt(x: N, y: N): Boolean
Definition Classes
Ordering -> PartialOrdering
Inherited from:
Ordering
override def gteq(x: N, y: N): Boolean
Definition Classes
Ordering -> PartialOrdering
Inherited from:
Ordering
def isHead(n: N): Boolean

It returns whether n is an head element.

It returns whether n is an head element.

Inherited from:
GraphOrdering
def isReverseOf(other: Ordering[_]): Boolean
Inherited from:
Ordering
override def lt(x: N, y: N): Boolean
Definition Classes
Ordering -> PartialOrdering
Inherited from:
Ordering
override def lteq(x: N, y: N): Boolean
Definition Classes
Ordering -> PartialOrdering
Inherited from:
Ordering
def max[U <: N](x: U, y: U): U
Inherited from:
Ordering
def min[U <: N](x: U, y: U): U
Inherited from:
Ordering
def on[U](f: U => N): Ordering[U]
Inherited from:
Ordering
def orElse(other: Ordering[N]): Ordering[N]
Inherited from:
Ordering
def orElseBy[S](f: N => S)(implicit ord: Ordering[S]): Ordering[N]
Inherited from:
Ordering
override def reverse: Ordering[N]
Definition Classes
Ordering -> PartialOrdering
Inherited from:
Ordering
def reversed(): Comparator[N]
Inherited from:
Comparator
def stringPrefix: String

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
def thenComparing(x$0: Comparator[_ >: N <: <FromJavaObject>]): Comparator[N]
Inherited from:
Comparator
def thenComparingDouble(x$0: ToDoubleFunction[_ >: N <: <FromJavaObject>]): Comparator[N]
Inherited from:
Comparator
def thenComparingInt(x$0: ToIntFunction[_ >: N <: <FromJavaObject>]): Comparator[N]
Inherited from:
Comparator
def thenComparingLong(x$0: ToLongFunction[_ >: N <: <FromJavaObject>]): Comparator[N]
Inherited from:
Comparator
def toSeq: Seq[N]

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
override def toString: String

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

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
Inherited from:
GraphOrdering
def tryCompare(x: N, y: N): Some[Int]
Inherited from:
Ordering

Implicits

Inherited implicits

implicit def mkOrderingOps(lhs: N): OrderingOps
Inherited from:
Ordering