IntTruncatedDivision

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.

Convert the given BigInt to an instance of A.

This is equivalent to 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.

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.

Tests if a is one.

Tests if a is zero.

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

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

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