object Order extends OrderFunctions[Order] with OrderToOrderingConversion with Serializable

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Order
  2. Serializable
  3. Serializable
  4. OrderToOrderingConversion
  5. OrderFunctions
  6. PartialOrderFunctions
  7. EqFunctions
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def allEqual[A]: Order[A]

    An Order instance that considers all A instances to be equal.

  5. final def apply[A](implicit ev: Order[A]): Order[A]

    Access an implicit Order[A].

    Access an implicit Order[A].

    Annotations
    @inline()
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def by[A, B](f: (A) ⇒ B)(implicit ev: Order[B]): Order[A]

    Convert an implicit Order[B] to an Order[A] using the given function f.

  8. implicit def catsKernelOrderingForOrder[A](implicit ev: Order[A]): Ordering[A]

    Implicitly derive a scala.math.Ordering[A] from a Order[A] instance.

    Implicitly derive a scala.math.Ordering[A] from a Order[A] instance.

    Definition Classes
    OrderToOrderingConversion
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  10. def compare[A](x: A, y: A)(implicit ev: Order[A]): Int
    Definition Classes
    OrderFunctions
  11. def comparison[A](x: A, y: A)(implicit ev: Order[A]): Comparison
    Definition Classes
    OrderFunctions
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def eqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    EqFunctions
  15. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def from[A](f: (A, A) ⇒ Int): Order[A]

    Define an Order[A] using the given function f.

  17. def fromComparable[A <: Comparable[A]]: Order[A]
  18. def fromLessThan[A](f: (A, A) ⇒ Boolean): Order[A]

    Define an Order[A] using the given 'less than' function f.

  19. def fromOrdering[A](implicit ev: Ordering[A]): Order[A]
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def gt[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    PartialOrderFunctions
  22. def gteqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    PartialOrderFunctions
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def lt[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    PartialOrderFunctions
  26. def lteqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    PartialOrderFunctions
  27. def max[A](x: A, y: A)(implicit ev: Order[A]): A
    Definition Classes
    OrderFunctions
  28. def min[A](x: A, y: A)(implicit ev: Order[A]): A
    Definition Classes
    OrderFunctions
  29. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. def neqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean
    Definition Classes
    EqFunctions
  31. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  32. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  33. def partialCompare[A](x: A, y: A)(implicit ev: Order[A]): Double
    Definition Classes
    PartialOrderFunctions
  34. def pmax[A](x: A, y: A)(implicit ev: Order[A]): Option[A]
    Definition Classes
    PartialOrderFunctions
  35. def pmin[A](x: A, y: A)(implicit ev: Order[A]): Option[A]
    Definition Classes
    PartialOrderFunctions
  36. def reverse[A](order: Order[A]): Order[A]

    Defines an ordering on A from the given order such that all arrows switch direction.

  37. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  38. def toString(): String
    Definition Classes
    AnyRef → Any
  39. def tryCompare[A](x: A, y: A)(implicit ev: Order[A]): Option[Int]
    Definition Classes
    PartialOrderFunctions
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  43. def whenEqual[A](first: Order[A], second: Order[A]): Order[A]

    Returns a new Order[A] instance that first compares by the first Order instance and uses the second Order instance to "break ties".

    Returns a new Order[A] instance that first compares by the first Order instance and uses the second Order instance to "break ties".

    That is, Order.whenEqual(x, y) creates an Order that first orders by x and then (if two elements are equal) falls back to y for the comparison.

  44. def whenEqualMonoid[A]: Monoid[Order[A]] with Band[Order[A]]

    A Monoid[Order[A]] can be generated for all A with the following properties:

    A Monoid[Order[A]] can be generated for all A with the following properties:

    empty returns a trivial Order[A] which considers all A instances to be equal.

    combine(x: Order[A], y: Order[A]) creates an Order[A] that first orders by x and then (if two elements are equal) falls back to y.

    This monoid is also a Band[Order[A]] since its combine operations is idempotent.

    See also

    Order.whenEqual

Inherited from Serializable

Inherited from Serializable

Inherited from OrderToOrderingConversion

Inherited from OrderFunctions[Order]

Inherited from PartialOrderFunctions[Order]

Inherited from EqFunctions[Order]

Inherited from AnyRef

Inherited from Any

Ungrouped