Trait/Object

scalax.collection.GraphBase

NodeOrdering

Related Docs: object NodeOrdering | package GraphBase

Permalink

sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

Ordering for the path dependent type NodeT.

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

Type Members

  1. class Ops extends AnyRef

    Permalink
    Definition Classes
    Ordering

Abstract Value Members

  1. abstract def compare(x: NodeT, y: NodeT): Int

    Permalink
    Definition Classes
    Ordering → Comparator

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to any2stringadd[NodeOrdering] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (NodeOrdering, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to ArrowAssoc[NodeOrdering] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def ensuring(cond: (NodeOrdering) ⇒ Boolean, msg: ⇒ Any): NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to Ensuring[NodeOrdering] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  9. def ensuring(cond: (NodeOrdering) ⇒ Boolean): NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to Ensuring[NodeOrdering] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: Boolean, msg: ⇒ Any): NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to Ensuring[NodeOrdering] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean): NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to Ensuring[NodeOrdering] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def equiv(x: NodeT, y: NodeT): Boolean

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to StringFormat[NodeOrdering] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def gt(x: NodeT, y: NodeT): Boolean

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  19. def gteq(x: NodeT, y: NodeT): Boolean

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  20. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  21. def isDefined: Boolean

    Permalink
    Definition Classes
    ElemOrdering
  22. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  23. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  24. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  25. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  26. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  27. def lt(x: NodeT, y: NodeT): Boolean

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  28. def lteq(x: NodeT, y: NodeT): Boolean

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  29. def max(x: NodeT, y: NodeT): NodeT

    Permalink
    Definition Classes
    Ordering
  30. def min(x: NodeT, y: NodeT): NodeT

    Permalink
    Definition Classes
    Ordering
  31. implicit def mkOrderingOps(lhs: NodeT): Ops

    Permalink
    Definition Classes
    Ordering
  32. val n1: NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to EdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  33. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  34. def noneCompare: Int

    Permalink
    Attributes
    protected
    Definition Classes
    ElemOrdering
  35. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  37. def on[U](f: (U) ⇒ NodeT): Ordering[U]

    Permalink
    Definition Classes
    Ordering
  38. def reverse: Ordering[NodeT]

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  39. def reversed(): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  40. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  41. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  42. def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: NodeT, _ <: U]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  43. def thenComparing[U](arg0: Function[_ >: NodeT, _ <: U], arg1: Comparator[_ >: U]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  44. def thenComparing(arg0: Comparator[_ >: NodeT]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  45. def thenComparingDouble(arg0: ToDoubleFunction[_ >: NodeT]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  46. def thenComparingInt(arg0: ToIntFunction[_ >: NodeT]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  47. def thenComparingLong(arg0: ToLongFunction[_ >: NodeT]): Comparator[NodeT]

    Permalink
    Definition Classes
    Comparator
  48. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to CollectionsHaveToParArray[NodeOrdering, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (NodeOrdering) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  49. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  50. def tryCompare(x: NodeT, y: NodeT): Some[Int]

    Permalink
    Definition Classes
    Ordering → PartialOrdering
  51. val value: NodeOrdering

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[NodeOrdering] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  52. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  55. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to EdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  56. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to EdgeAssoc[NodeOrdering] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  57. def [B](y: B): (NodeOrdering, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to ArrowAssoc[NodeOrdering] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[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

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeOrdering to OuterNode[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

Inherited from ElemOrdering

Inherited from Ordering[NodeT]

Inherited from PartialOrdering[NodeT]

Inherited from Equiv[NodeT]

Inherited from Serializable

Inherited from Serializable

Inherited from Comparator[NodeT]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from NodeOrdering to OuterNode[NodeOrdering]

Inherited by implicit conversion EdgeAssoc from NodeOrdering to EdgeAssoc[NodeOrdering]

Inherited by implicit conversion CollectionsHaveToParArray from NodeOrdering to CollectionsHaveToParArray[NodeOrdering, T]

Inherited by implicit conversion any2stringadd from NodeOrdering to any2stringadd[NodeOrdering]

Inherited by implicit conversion StringFormat from NodeOrdering to StringFormat[NodeOrdering]

Inherited by implicit conversion Ensuring from NodeOrdering to Ensuring[NodeOrdering]

Inherited by implicit conversion ArrowAssoc from NodeOrdering to ArrowAssoc[NodeOrdering]

Ungrouped