BigIntIsEuclideanRing

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def additive: AbGroup[BigInt]

Definition Classes
AdditiveAbGroup → AdditiveCMonoid → AdditiveCSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def euclid(a: BigInt, b: BigInt)(implicit eq: Eq[BigInt]): BigInt

Attributes
protected[this]
Definition Classes
EuclideanRing
Annotations
@tailrec()
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromInt(n: Int): BigInt

Defined to be equivalent to additive.sumn(one, n).
Defined to be equivalent to additive.sumn(one, n). That is, n repeated summations of this ring's one, or -one if n is negative.

Definition Classes
BigIntIsEuclideanRing → Ring
def gcd(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → EuclideanRing
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isOne(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

Definition Classes
MultiplicativeMonoid
def isZero(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

Tests if a is zero.
Tests if a is zero.

Definition Classes
AdditiveMonoid
def lcm(a: BigInt, b: BigInt): BigInt

Definition Classes
EuclideanRing
def minus(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → AdditiveGroup
def mod(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → EuclideanRing
def multiplicative: CMonoid[BigInt]

Definition Classes
MultiplicativeCMonoid → MultiplicativeCSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negate(a: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → AdditiveGroup
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val one: BigInt

Definition Classes
BigIntIsEuclideanRing → MultiplicativeMonoid
def plus(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → AdditiveSemigroup
def pow(a: BigInt, b: Int): BigInt

This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.
This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.

Definition Classes
BigIntIsEuclideanRing → Rig → Semiring
def prod(as: TraversableOnce[BigInt]): BigInt

Given a sequence of as, sum them using the monoid and return the total.
Given a sequence of as, sum them using the monoid and return the total.

Definition Classes
MultiplicativeMonoid
def prodOption(as: TraversableOnce[BigInt]): Option[BigInt]

Given a sequence of as, sum them using the semigroup and return the total.
Given a sequence of as, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).

Definition Classes
MultiplicativeSemigroup
def prodn(a: BigInt, n: Int): BigInt

Return a multiplied with itself n times.
Return a multiplied with itself n times.

Definition Classes
MultiplicativeMonoid → MultiplicativeSemigroup
def prodnAboveOne(a: BigInt, n: Int): BigInt

Attributes
protected
Definition Classes
MultiplicativeSemigroup
def quot(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → EuclideanRing
def quotmod(a: BigInt, b: BigInt): (BigInt, BigInt)

Definition Classes
BigIntIsEuclideanRing → EuclideanRing
def sum(as: TraversableOnce[BigInt]): BigInt

Given a sequence of as, sum them using the monoid and return the total.
Given a sequence of as, sum them using the monoid and return the total.

Definition Classes
AdditiveMonoid
def sumOption(as: TraversableOnce[BigInt]): Option[BigInt]

Given a sequence of as, sum them using the semigroup and return the total.
Given a sequence of as, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).

Definition Classes
AdditiveSemigroup
def sumn(a: BigInt, n: Int): BigInt

Return a added with itself n times.
Return a added with itself n times.

Definition Classes
AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
def sumnAboveOne(a: BigInt, n: Int): BigInt

Attributes
protected
Definition Classes
AdditiveSemigroup
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def times(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → MultiplicativeSemigroup
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
val zero: BigInt

Definition Classes
BigIntIsEuclideanRing → AdditiveMonoid

trait BigIntIsEuclideanRing extends EuclideanRing[BigInt]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def additive: AbGroup[BigInt]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def euclid(a: BigInt, b: BigInt)(implicit eq: Eq[BigInt]): BigInt

def finalize(): Unit

def fromInt(n: Int): BigInt

def gcd(a: BigInt, b: BigInt): BigInt

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isOne(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

def isZero(a: BigInt)(implicit ev: Eq[BigInt]): Boolean

def lcm(a: BigInt, b: BigInt): BigInt

def minus(a: BigInt, b: BigInt): BigInt

def mod(a: BigInt, b: BigInt): BigInt

def multiplicative: CMonoid[BigInt]

final def ne(arg0: AnyRef): Boolean

def negate(a: BigInt): BigInt

final def notify(): Unit

final def notifyAll(): Unit

val one: BigInt

def plus(a: BigInt, b: BigInt): BigInt

def pow(a: BigInt, b: Int): BigInt

def prod(as: TraversableOnce[BigInt]): BigInt

def prodOption(as: TraversableOnce[BigInt]): Option[BigInt]

def prodn(a: BigInt, n: Int): BigInt

def prodnAboveOne(a: BigInt, n: Int): BigInt

def quot(a: BigInt, b: BigInt): BigInt

def quotmod(a: BigInt, b: BigInt): (BigInt, BigInt)

def sum(as: TraversableOnce[BigInt]): BigInt

def sumOption(as: TraversableOnce[BigInt]): Option[BigInt]

def sumn(a: BigInt, n: Int): BigInt

def sumnAboveOne(a: BigInt, n: Int): BigInt

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

def times(a: BigInt, b: BigInt): BigInt

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val zero: BigInt

Inherited from EuclideanRing[BigInt]

Inherited from CRing[BigInt]

Inherited from MultiplicativeCMonoid[BigInt]

Inherited from MultiplicativeCSemigroup[BigInt]

Inherited from Ring[BigInt]

Inherited from Rng[BigInt]

Inherited from AdditiveAbGroup[BigInt]

Inherited from AdditiveCMonoid[BigInt]

Inherited from AdditiveCSemigroup[BigInt]

Inherited from AdditiveGroup[BigInt]

Inherited from Rig[BigInt]

Inherited from MultiplicativeMonoid[BigInt]

Inherited from Semiring[BigInt]

Inherited from MultiplicativeSemigroup[BigInt]

Inherited from AdditiveMonoid[BigInt]

Inherited from AdditiveSemigroup[BigInt]

Inherited from AnyRef

Inherited from Any

Ungrouped