BigIntAlgebra

Instance Constructors

new BigIntAlgebra()

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
def abs(a: BigInt): BigInt

An idempotent function that ensures an object has a non-negative sign.
An idempotent function that ensures an object has a non-negative sign.

Definition Classes
BigIntIsSigned → Signed
def additive: AbGroup[BigInt]

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

Definition Classes
Any
def ceil(a: BigInt): BigInt

Rounds a the nearest integer that is greater than or equal to a.
Rounds a the nearest integer that is greater than or equal to a.

Definition Classes
IsIntegral → IsReal
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compare(x: BigInt, y: BigInt): Int

Definition Classes
BigIntOrder → Order
def distance(v: BigInt, w: BigInt): BigInt

Definition Classes
BigIntIsMetricSpace → MetricSpace
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def eqv(x: BigInt, y: BigInt): Boolean

Returns true if x and y are equivalent, false otherwise.
Returns true if x and y are equivalent, false otherwise.

Definition Classes
BigIntOrder → Order → PartialOrder → Eq
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 floor(a: BigInt): BigInt

Rounds a the nearest integer that is less than or equal to a.
Rounds a the nearest integer that is less than or equal to a.

Definition Classes
IsIntegral → IsReal
def fpow(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsNRoot → NRoot
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 gt(x: BigInt, y: BigInt): Boolean

Definition Classes
BigIntOrder → Order → PartialOrder
def gteqv(x: BigInt, y: BigInt): Boolean

Definition Classes
BigIntOrder → Order → PartialOrder
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 isSignNegative(a: BigInt): Boolean

Definition Classes
Signed
def isSignNonNegative(a: BigInt): Boolean

Definition Classes
Signed
def isSignNonPositive(a: BigInt): Boolean

Definition Classes
Signed
def isSignNonZero(a: BigInt): Boolean

Definition Classes
Signed
def isSignPositive(a: BigInt): Boolean

Definition Classes
Signed
def isSignZero(a: BigInt): Boolean

Definition Classes
Signed
def isWhole(a: BigInt): Boolean

Returns true iff a is a an integer.
Returns true iff a is a an integer.

Definition Classes
IsIntegral → IsReal
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 lt(x: BigInt, y: BigInt): Boolean

Definition Classes
BigIntOrder → Order → PartialOrder
def lteqv(x: BigInt, y: BigInt): Boolean

Definition Classes
BigIntOrder → Order → PartialOrder
def max(x: BigInt, y: BigInt): BigInt

Definition Classes
BigIntOrder → Order
def min(x: BigInt, y: BigInt): BigInt

Definition Classes
BigIntOrder → Order
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
def neqv(x: BigInt, y: BigInt): Boolean

Returns false if x and y are equivalent, true otherwise.
Returns false if x and y are equivalent, true otherwise.

Definition Classes
BigIntOrder → Eq
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def nroot(a: BigInt, k: Int): BigInt

Definition Classes
BigIntIsNRoot → NRoot
def on[B](f: (B) ⇒ BigInt): Order[B]

Defines an order on B by mapping B to A using f and using As order to order B.
Defines an order on B by mapping B to A using f and using As order to order B.

Definition Classes
Order → PartialOrder → Eq
val one: BigInt

Definition Classes
BigIntIsEuclideanRing → MultiplicativeMonoid
def partialCompare(x: BigInt, y: BigInt): Double

Result of comparing x with y.
Result of comparing x with y. Returns NaN if operands are not comparable. If operands are comparable, returns a Double whose sign is: - negative iff x < y - zero iff x === y - positive iff x > y

Definition Classes
Order → PartialOrder
def plus(a: BigInt, b: BigInt): BigInt

Definition Classes
BigIntIsEuclideanRing → AdditiveSemigroup
def pmax(x: BigInt, y: BigInt): Option[BigInt]

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.

Definition Classes
PartialOrder
def pmin(x: BigInt, y: BigInt): Option[BigInt]

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.

Definition Classes
PartialOrder
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 reverse: Order[BigInt]

Defines an ordering on A where all arrows switch direction.
Defines an ordering on A where all arrows switch direction.

Definition Classes
Order → PartialOrder
def round(a: BigInt): BigInt

Rounds a to the nearest integer.
Rounds a to the nearest integer.

Definition Classes
IsIntegral → IsReal
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.

Definition Classes
Signed
def signum(a: BigInt): Int

Returns 0 if a is 0, > 0 if a is positive, and < 0 is a is negative.
Returns 0 if a is 0, > 0 if a is positive, and < 0 is a is negative.

Definition Classes
BigIntIsSigned → Signed
def sqrt(a: BigInt): BigInt

Definition Classes
NRoot
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 toAlgebraic(a: BigInt): Algebraic

Definition Classes
IsRational → IsAlgebraic
def toBigInt(n: BigInt): BigInt

Definition Classes
BigIntIsReal → IsIntegral
def toDouble(n: BigInt): Double

Approximates a as a Double.
Approximates a as a Double.

Definition Classes
BigIntIsReal → IsReal
def toRational(a: BigInt): Rational

Definition Classes
IsIntegral → IsRational
def toReal(a: BigInt): Real

Definition Classes
IsAlgebraic → IsReal
def toString(): String

Definition Classes
AnyRef → Any
def tryCompare(x: BigInt, y: BigInt): Option[Int]

Result of comparing x with y.
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

Definition Classes
PartialOrder
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

Related Doc: package std

class BigIntAlgebra extends BigIntIsEuclideanRing with BigIntIsNRoot with BigIntIsMetricSpace with BigIntIsReal with Serializable

Instance Constructors

new BigIntAlgebra()

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def abs(a: BigInt): BigInt

def additive: AbGroup[BigInt]

final def asInstanceOf[T0]: T0

def ceil(a: BigInt): BigInt

def clone(): AnyRef

def compare(x: BigInt, y: BigInt): Int

def distance(v: BigInt, w: BigInt): BigInt

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def eqv(x: BigInt, y: BigInt): Boolean

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

def finalize(): Unit

def floor(a: BigInt): BigInt

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

def fromInt(n: Int): BigInt

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

final def getClass(): Class[_]

def gt(x: BigInt, y: BigInt): Boolean

def gteqv(x: BigInt, y: BigInt): Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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

def isSignNegative(a: BigInt): Boolean

def isSignNonNegative(a: BigInt): Boolean

def isSignNonPositive(a: BigInt): Boolean

def isSignNonZero(a: BigInt): Boolean

def isSignPositive(a: BigInt): Boolean

def isSignZero(a: BigInt): Boolean

def isWhole(a: BigInt): Boolean

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

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

def lt(x: BigInt, y: BigInt): Boolean

def lteqv(x: BigInt, y: BigInt): Boolean

def max(x: BigInt, y: BigInt): BigInt

def min(x: BigInt, y: 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

def neqv(x: BigInt, y: BigInt): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def nroot(a: BigInt, k: Int): BigInt

def on[B](f: (B) ⇒ BigInt): Order[B]

val one: BigInt

def partialCompare(x: BigInt, y: BigInt): Double

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

def pmax(x: BigInt, y: BigInt): Option[BigInt]

def pmin(x: BigInt, y: BigInt): Option[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 reverse: Order[BigInt]

def round(a: BigInt): BigInt

def sign(a: BigInt): Sign

def signum(a: BigInt): Int

def sqrt(a: 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 toAlgebraic(a: BigInt): Algebraic

def toBigInt(n: BigInt): BigInt

def toDouble(n: BigInt): Double