Order

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. def allEqual[A]: Order[A]

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

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

   Access an implicit Order[A].

   Access an implicit Order[A].

   Annotations

   @inline()

8. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

9. 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.

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

    Implicitly convert a Order[A] to a scala.math.Ordering[A] instance.

11. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. def compare[A](x: A, y: A)(implicit ev: Order[A]): Int

    Definition Classes

    OrderFunctions

13. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

15. def eqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    EqFunctions

16. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

17. def from[A](f: (A, A) ⇒ Int): Order[A]

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

18. def fromOrdering[A](implicit ev: Ordering[A]): Order[A]

19. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

20. def gt[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    PartialOrderFunctions

21. def gteqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    PartialOrderFunctions

22. def hashCode(): Int

    Definition Classes

    AnyRef → Any

23. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

24. def lt[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    PartialOrderFunctions

25. def lteqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    PartialOrderFunctions

26. def max[A](x: A, y: A)(implicit ev: Order[A]): A

    Definition Classes

    OrderFunctions

27. def min[A](x: A, y: A)(implicit ev: Order[A]): A

    Definition Classes

    OrderFunctions

28. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

29. def neqv[A](x: A, y: A)(implicit ev: Order[A]): Boolean

    Definition Classes

    EqFunctions

30. final def notify(): Unit

    Definition Classes

    AnyRef

31. final def notifyAll(): Unit

    Definition Classes

    AnyRef

32. def partialCompare[A](x: A, y: A)(implicit ev: Order[A]): Double

    Definition Classes

    PartialOrderFunctions

33. def pmax[A](x: A, y: A)(implicit ev: Order[A]): Option[A]

    Definition Classes

    PartialOrderFunctions

34. def pmin[A](x: A, y: A)(implicit ev: Order[A]): Option[A]

    Definition Classes

    PartialOrderFunctions

35. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

36. def toString(): String

    Definition Classes

    AnyRef → Any

37. def tryCompare[A](x: A, y: A)(implicit ev: Order[A]): Option[Int]

    Definition Classes

    PartialOrderFunctions

38. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

39. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

41. 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