Packages

sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

Ordering for the path dependent type NodeT.

Linear Supertypes
ElemOrdering, Ordering[NodeT], PartialOrdering[NodeT], Equiv[NodeT], Serializable, Comparator[NodeT], AnyRef, Any
Known Subclasses
None
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeOrdering
  2. ElemOrdering
  3. Ordering
  4. PartialOrdering
  5. Equiv
  6. Serializable
  7. Comparator
  8. AnyRef
  9. Any
Implicitly
  1. by EdgeAssoc
  2. by anyToNode
  3. by ChainingOps
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. class OrderingOps extends AnyRef
    Definition Classes
    Ordering

Abstract Value Members

  1. abstract def compare(x: NodeT, y: NodeT): Int
    Definition Classes
    Ordering → Comparator

Concrete Value Members

  1. def equiv(x: NodeT, y: NodeT): Boolean
    Definition Classes
    Ordering → PartialOrdering → Equiv
  2. def gt(x: NodeT, y: NodeT): Boolean
    Definition Classes
    Ordering → PartialOrdering
  3. def gteq(x: NodeT, y: NodeT): Boolean
    Definition Classes
    Ordering → PartialOrdering
  4. def isDefined: Boolean
    Definition Classes
    ElemOrdering
  5. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  6. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  7. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  8. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  9. def isReverseOf(other: Ordering[_]): Boolean
    Definition Classes
    Ordering
  10. def lt(x: NodeT, y: NodeT): Boolean
    Definition Classes
    Ordering → PartialOrdering
  11. def lteq(x: NodeT, y: NodeT): Boolean
    Definition Classes
    Ordering → PartialOrdering
  12. def max[U <: NodeT](x: U, y: U): U
    Definition Classes
    Ordering
  13. def min[U <: NodeT](x: U, y: U): U
    Definition Classes
    Ordering
  14. implicit def mkOrderingOps(lhs: NodeT): OrderingOps
    Definition Classes
    Ordering
  15. val n1: NodeOrdering
    Implicit
    This member is added by an implicit conversion from NodeOrdering toEdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  16. def on[U](f: (U) => NodeT): Ordering[U]
    Definition Classes
    Ordering
  17. def orElse(other: Ordering[NodeT]): Ordering[NodeT]
    Definition Classes
    Ordering
  18. def orElseBy[S](f: (NodeT) => S)(implicit ord: Ordering[S]): Ordering[NodeT]
    Definition Classes
    Ordering
  19. def pipe[B](f: (NodeOrdering) => B): B
    Implicit
    This member is added by an implicit conversion from NodeOrdering toChainingOps[NodeOrdering] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  20. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  21. def reverse: Ordering[NodeT]
    Definition Classes
    Ordering → PartialOrdering
  22. def reversed(): Comparator[NodeT]
    Definition Classes
    Comparator
  23. val self: NodeOrdering
    Implicit
    This member is added by an implicit conversion from NodeOrdering toChainingOps[NodeOrdering] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  24. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  25. def tap[U](f: (NodeOrdering) => U): NodeOrdering
    Implicit
    This member is added by an implicit conversion from NodeOrdering toChainingOps[NodeOrdering] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  26. def thenComparing[U <: Comparable[_ >: U <: AnyRef]](arg0: Function[_ >: NodeT <: AnyRef, _ <: U]): Comparator[NodeT]
    Definition Classes
    Comparator
  27. def thenComparing[U <: AnyRef](arg0: Function[_ >: NodeT <: AnyRef, _ <: U], arg1: Comparator[_ >: U <: AnyRef]): Comparator[NodeT]
    Definition Classes
    Comparator
  28. def thenComparing(arg0: Comparator[_ >: NodeT <: AnyRef]): Comparator[NodeT]
    Definition Classes
    Comparator
  29. def thenComparingDouble(arg0: ToDoubleFunction[_ >: NodeT <: AnyRef]): Comparator[NodeT]
    Definition Classes
    Comparator
  30. def thenComparingInt(arg0: ToIntFunction[_ >: NodeT <: AnyRef]): Comparator[NodeT]
    Definition Classes
    Comparator
  31. def thenComparingLong(arg0: ToLongFunction[_ >: NodeT <: AnyRef]): Comparator[NodeT]
    Definition Classes
    Comparator
  32. def tryCompare(x: NodeT, y: NodeT): Some[Int]
    Definition Classes
    Ordering → PartialOrdering
  33. val value: NodeOrdering
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  34. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeOrdering toEdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  35. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeOrdering toEdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeOrdering: OuterNode[NodeOrdering]).isDefined
    Definition Classes
    Param
  2. def toString(): String
    Implicit
    This member is added by an implicit conversion from NodeOrdering toOuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeOrdering: OuterNode[NodeOrdering]).toString()
    Definition Classes
    NodeParam → AnyRef → Any