BigIntAlgebra

Value members

Inherited methods

override def abs(a: BigInt): BigInt
Definition Classes
Inherited from:
BigIntSigned
def ceil(a: BigInt): BigInt
Inherited from:
IsIntegral
def compare(x: BigInt, y: BigInt): Int
Inherited from:
BigIntOrder

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.

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.

Inherited from:
Order
Inherited from:
BigIntIsMetricSpace
def emod(a: BigInt, b: BigInt): BigInt
Inherited from:
BigIntIsEuclideanRing
def equot(a: BigInt, b: BigInt): BigInt
Inherited from:
BigIntIsEuclideanRing
override def equotmod(a: BigInt, b: BigInt): (BigInt, BigInt)
Definition Classes
Inherited from:
BigIntIsEuclideanRing
override def eqv(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
Inherited from:
IsIntegral
def fmod(x: BigInt, y: BigInt): BigInt
Inherited from:
forCommutativeRing
def fpow(a: BigInt, b: BigInt): BigInt
Inherited from:
BigIntIsNRoot
def fquot(x: BigInt, y: BigInt): BigInt
Inherited from:
forCommutativeRing
override def fquotmod(x: BigInt, y: BigInt): (BigInt, BigInt)
Definition Classes
Inherited from:
forCommutativeRing

Convert the given BigInt to an instance of A.

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.

Inherited from:
Ring
override def fromInt(n: Int): BigInt
Definition Classes
Inherited from:
BigIntIsEuclideanRing
override def gcd(a: BigInt, b: BigInt)(implicit ev: Eq[BigInt]): BigInt
override def gt(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
override def gteqv(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
def isOne(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

Tests if a is one.

Tests if a is one.

Inherited from:
MultiplicativeMonoid
Inherited from:
Signed
Inherited from:
Signed
Inherited from:
Signed
Inherited from:
Signed
Inherited from:
Signed
Inherited from:
Signed
Inherited from:
IsIntegral
def isZero(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

Tests if a is zero.

Tests if a is zero.

Inherited from:
AdditiveMonoid
override def lcm(a: BigInt, b: BigInt)(implicit ev: Eq[BigInt]): BigInt
override def lt(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
override def lteqv(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
override def max(x: BigInt, y: BigInt): BigInt
Definition Classes
Inherited from:
BigIntOrder
override def min(x: BigInt, y: BigInt): BigInt
Definition Classes
Inherited from:
BigIntOrder
override def minus(a: BigInt, b: BigInt): BigInt
Definition Classes
Inherited from:
BigIntIsEuclideanRing
Inherited from:
BigIntIsEuclideanRing
override def neqv(x: BigInt, y: BigInt): Boolean
Definition Classes
Inherited from:
BigIntOrder
def nroot(a: BigInt, k: Int): BigInt
Inherited from:
BigIntIsNRoot
Inherited from:
BigIntSigned
Inherited from:
Order

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.

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.

Inherited from:
PartialOrder
def plus(a: BigInt, b: BigInt): BigInt
Inherited from:
BigIntIsEuclideanRing

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.

Inherited from:
PartialOrder

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.

Inherited from:
PartialOrder
@nowarn("msg=deprecated")

Given a sequence of as, compute the product.

Given a sequence of as, compute the product.

Inherited from:
MultiplicativeMonoid
Inherited from:
IsIntegral
def sign(a: BigInt): Sign

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

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

Inherited from:
Signed
override def signum(a: BigInt): Int
Definition Classes
Inherited from:
BigIntSigned
def sqrt(a: BigInt): BigInt
Inherited from:
NRoot
@nowarn("msg=deprecated")

Given a sequence of as, compute the sum.

Given a sequence of as, compute the sum.

Inherited from:
AdditiveMonoid
override def sumN(a: BigInt, n: Int): BigInt
Definition Classes
Inherited from:
AdditiveGroup
override def times(a: BigInt, b: BigInt): BigInt
def tmod(a: BigInt, b: BigInt): BigInt
Inherited from:
IsRational
Inherited from:
BigIntIsReal
Inherited from:
BigIntIsReal

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

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

Inherited from:
Order
Inherited from:
IsIntegral
def toReal(a: BigInt): Real
Inherited from:
IsAlgebraic
def tquot(a: BigInt, b: BigInt): BigInt
override def tquotmod(a: BigInt, b: BigInt): (BigInt, BigInt)

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:

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
Inherited from:
PartialOrder
@nowarn("msg=deprecated")
@nowarn("msg=deprecated")
override def trySum(as: IterableOnce[BigInt]): Option[BigInt]
Definition Classes
Inherited from:
AdditiveMonoid

Inherited fields

val one: BigInt
Inherited from:
BigIntIsEuclideanRing
Inherited from:
BigIntIsEuclideanRing