RealIsFractional

Like compare, but returns a cats.kernel.Comparison instead of an Int. Has the benefit of being able to pattern match on, but not as performant.

This is implemented in terms of basic Field ops. However, this is probably significantly less efficient than can be done with a specific type. So, it is recommended that this method be overriden.

This is possible because a Double is a rational number.

Convert the given integer to an instance of A.

Defined to be equivalent to sumN(one, n).

That is, n repeated summations of this ring's one, or -n summations of -one if n is negative.

Most type class instances should consider overriding this method for performance reasons.

Returns true if x > y, false otherwise.

Returns true if x >= y, false otherwise.

Tests if a is one.

Tests if a is zero.

Returns true if x < y, false otherwise.

Returns true if x <= y, false otherwise.

If x > y, return x, else return y.

If x < y, return x, else return y.

Returns true if x != y, false otherwise.

Note: this default implementation provided by Order is the same as the one defined in Eq, but for purposes of binary compatibility, the override in Order has not yet been removed. See this discussion.

Like partialCompare, but returns a cats.kernel.Comparison instead of an Double. Has the benefit of being able to pattern match on, but not as performant.

Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.

Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.

Given a sequence of as, compute the product.

Returns Zero if a is 0, Positive if a is positive, and Negative is a is negative.

Given a sequence of as, compute the sum.

Convert a Order[A] to a scala.math.Ordering[A] instance.

Result of comparing x with y. Returns None if operands are not comparable. If operands are comparable, returns Some[Int] where the Int sign is:

• negative iff x < y
• zero iff x = y
• positive iff x > y