scalax.collection.GraphDegree

DegreeOrdering

final class DegreeOrdering extends Ordering[(GraphDegree.this)#NodeT]

Decreasing ordering of nodes with respect to their degree.

Linear Supertypes
Ordering[(GraphDegree.this)#NodeT], PartialOrdering[(GraphDegree.this)#NodeT], Equiv[(GraphDegree.this)#NodeT], Serializable, Serializable, Comparator[(GraphDegree.this)#NodeT], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DegreeOrdering
  2. Ordering
  3. PartialOrdering
  4. Equiv
  5. Serializable
  6. Serializable
  7. Comparator
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DegreeOrdering(f: (GraphDegree.this)#DegreeFunction)

Type Members

  1. class Ops extends AnyRef

    Definition Classes
    Ordering

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

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

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

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def compare(n1: (GraphDegree.this)#NodeT, n2: (GraphDegree.this)#NodeT): Int

    Definition Classes
    DegreeOrdering → Ordering → Comparator
  9. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  11. def equiv(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean

    Definition Classes
    Ordering → PartialOrdering → Equiv
  12. val f: (GraphDegree.this)#DegreeFunction

  13. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  15. def gt(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean

    Definition Classes
    Ordering → PartialOrdering
  16. def gteq(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean

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

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

    Definition Classes
    Any
  19. def lt(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean

    Definition Classes
    Ordering → PartialOrdering
  20. def lteq(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Boolean

    Definition Classes
    Ordering → PartialOrdering
  21. def max(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): (GraphDegree.this)#NodeT

    Definition Classes
    Ordering
  22. def min(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): (GraphDegree.this)#NodeT

    Definition Classes
    Ordering
  23. implicit def mkOrderingOps(lhs: (GraphDegree.this)#NodeT): Ops

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

    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  27. def on[U](f: (U) ⇒ (GraphDegree.this)#NodeT): Ordering[U]

    Definition Classes
    Ordering
  28. def reverse: Ordering[(GraphDegree.this)#NodeT]

    Definition Classes
    Ordering → PartialOrdering
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  30. def toString(): String

    Definition Classes
    AnyRef → Any
  31. def tryCompare(x: (GraphDegree.this)#NodeT, y: (GraphDegree.this)#NodeT): Some[Int]

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Ordering[(GraphDegree.this)#NodeT]

Inherited from PartialOrdering[(GraphDegree.this)#NodeT]

Inherited from Equiv[(GraphDegree.this)#NodeT]

Inherited from Serializable

Inherited from Serializable

Inherited from Comparator[(GraphDegree.this)#NodeT]

Inherited from AnyRef

Inherited from Any

Ungrouped