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

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. def comparison[A](x: A, y: A)(implicit ev: Order[A]): Comparison

    Definition Classes

    OrderFunctions

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

    Definition Classes

    AnyRef

15. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

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

    Definition Classes

    EqFunctions

17. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

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

19. def fromComparable[A <: Comparable[A]]: Order[A]

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

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

    Definition Classes

    AnyRef → Any

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

    Definition Classes

    PartialOrderFunctions

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

    Definition Classes

    PartialOrderFunctions

24. def hashCode(): Int

    Definition Classes

    AnyRef → Any

25. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    PartialOrderFunctions

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

    Definition Classes

    PartialOrderFunctions

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

    Definition Classes

    OrderFunctions

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

    Definition Classes

    OrderFunctions

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

    Definition Classes

    AnyRef

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

    Definition Classes

    EqFunctions

32. final def notify(): Unit

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    PartialOrderFunctions

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

    Definition Classes

    PartialOrderFunctions

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

    Definition Classes

    PartialOrderFunctions

37. def reverse[A](order: Order[A]): Order[A]

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

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

    Definition Classes

    AnyRef

39. def toString(): String

    Definition Classes

    AnyRef → Any

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

    Definition Classes

    PartialOrderFunctions

41. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

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