IdealInt

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def %(that: IdealInt): IdealInt

Remainder of IdealInt.
Remainder of IdealInt. We use euclidian division with remainder, i.e., the property this == (this / that) * that + (this % that) holds, and this % that >= 0 and this % that < that.abs.
TODO: make this more efficient
def &(that: IdealInt): IdealInt

Bit-wise and.
def *(that: IdealInt): IdealInt

Multiplication of IdealInt
Multiplication of IdealInt
def +(that: IdealInt): IdealInt

Addition of IdealInt
Addition of IdealInt
def -(that: IdealInt): IdealInt

Subtraction of IdealInt
Subtraction of IdealInt
def /(that: IdealInt): IdealInt

Division of IdealInt.
Division of IdealInt. We use euclidian division with remainder, i.e., the property this == (this / that) * that + (this % that) holds, and this % that >= 0 and this % that < that.abs.
TODO: make this more efficient
def /%(that: IdealInt): (IdealInt, IdealInt)

Returns a pair of two IdealInt containing (this / that) and (this % that).
Returns a pair of two IdealInt containing (this / that) and (this % that). We use euclidian division with remainder, i.e., the property this == (this / that) * that + (this % that) holds, and this % that >= 0 and this % that < that.abs.
def <(that: IdealInt): Boolean

Less-than of IdealInt
Less-than of IdealInt
def <=(that: IdealInt): Boolean

Less-than-or-equals comparison of IdealInt
Less-than-or-equals comparison of IdealInt
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def >(that: IdealInt): Boolean

Greater-than comparison of IdealInt
Greater-than comparison of IdealInt
def >=(that: IdealInt): Boolean

Greater-than-or-equals comparison of IdealInt
Greater-than-or-equals comparison of IdealInt
def ^(that: IdealInt): IdealInt

Bit-wise xor.
def abs: IdealInt

Returns the absolute value of this IdealInt
Returns the absolute value of this IdealInt
def anyDivideAndRemainder(that: IdealInt): (IdealInt, IdealInt)

Returns a pair of two IdealInt containing (this / that) and (this % that).
Returns a pair of two IdealInt containing (this / that) and (this % that). This operation only guarantees this == (this / that) * that + (this % that), and that the absolute value of (this % that) is less than the absolute value of that.
final def asInstanceOf[T0]: T0

Definition Classes
Any
def bigIntValue: BigInteger

Converts this IdealInt to an BigInt.
Converts this IdealInt to an BigInt.
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
def compare(that: IdealInt): Int

Compares this IdealInt with the specified IdealInt
Compares this IdealInt with the specified IdealInt
def compareAbs(that: IdealInt): Int

A total order on integers that first compares the absolute value and then the sign: 0 < 1 < -1 < 2 < -2 < 3 < -3 < ...
def divides(that: IdealInt): Boolean

Return whether this divides that
def doubleValue: Double
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: IdealInt): Boolean

Compares this IdealInt with the specified IdealInt for equality.
Compares this IdealInt with the specified IdealInt for equality.
def equals(that: Any): Boolean

Compares this IdealInt with the specified value for equality.
Compares this IdealInt with the specified value for equality.

Definition Classes
IdealInt → AnyRef → Any
def floatValue: Float
def gcd(that: IdealInt): IdealInt

Returns the greatest common divisor of abs(this) and abs(that)
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def getHighestSetBit: Int
def hashCode(): Int

Returns the hash code for this IdealInt.
Returns the hash code for this IdealInt.

Definition Classes
IdealInt → AnyRef → Any
def intValue: Int

Converts this IdealInt to an int.
Converts this IdealInt to an int. If the IdealInt is too big to fit in a char, only the low-order 32 bits are returned. Note that this conversion can lose information about the overall magnitude of the IdealInt value as well as return a result with the opposite sign.
def intValueSafe: Int
def isAbsMinMod(that: IdealInt): Boolean

Return whether this is minimal (in the compareAbs order) modulo that, i.e., if that is zero or if (this compareAbs (this + a*that)) <= 0 for all non-zero a
Return whether this is minimal (in the compareAbs order) modulo that, i.e., if that is zero or if (this compareAbs (this + a*that)) <= 0 for all non-zero a
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isMinusOne: Boolean

Returns true iff this IdealInt is -one
Returns true iff this IdealInt is -one
def isOne: Boolean

Returns true iff this IdealInt is one
Returns true iff this IdealInt is one
def isProbablePrime(certainty: Int): Boolean

Function corresponding to BigInteger.isProbablePrime
Function corresponding to BigInteger.isProbablePrime
def isUnit: Boolean

Returns true iff this IdealInt is one or -one
Returns true iff this IdealInt is one or -one
def isZero: Boolean

Returns true iff this IdealInt is zero
Returns true iff this IdealInt is zero
def lcm(that: IdealInt): IdealInt

Returns the least common multiple of abs(this) and abs(that)
def longValue: Long

Converts this IdealInt to a long.
Converts this IdealInt to a long. If the IdealInt is too big to fit in a char, only the low-order 64 bits are returned. Note that this conversion can lose information about the overall magnitude of the IdealInt value as well as return a result with the opposite sign.
def max(that: IdealInt): IdealInt

Returns the maximum of this and that
def min(that: IdealInt): IdealInt

Returns the minimum of this and that
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def pow(exp: Int): IdealInt

Returns a IdealInt whose value is (this raised to the power of exp).
Returns a IdealInt whose value is (this raised to the power of exp).
def powMod(exp: IdealInt, modulus: IdealInt): IdealInt

Returns a IdealInt whose value is (this raised to the power of exp), modulo modulus.
Returns a IdealInt whose value is (this raised to the power of exp), modulo modulus.
def reduceAbs(that: IdealInt): (IdealInt, IdealInt)

Reduce this by adding a multiple of that and return the quotient and the remainder.
Reduce this by adding a multiple of that and return the quotient and the remainder. In contrast to /%, reduction is done so that the remainder becomes minimal in the order compareAbs. The result has the properties this == quot * that + rem and (rem compareAbs (rem + a*that)) < 0 for all non-zero a.
def signum: Int

Returns the sign of this IdealInt, i.e.
Returns the sign of this IdealInt, i.e. -1 if it is less than 0, +1 if it is greater than 0 0 if it is equal to 0
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Returns the decimal String representation of this IdealInt.
Returns the decimal String representation of this IdealInt.

Definition Classes
IdealInt → AnyRef → Any
def unary_-: IdealInt

Returns a IdealInt whose value is the negation of this IdealInt
Returns a IdealInt whose value is the negation of this IdealInt
final def wait(arg0: Long, arg1: Int): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def |(that: IdealInt): IdealInt

Bit-wise or.

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object IdealInt | package basetypes

final class IdealInt extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def %(that: IdealInt): IdealInt

def &(that: IdealInt): IdealInt

def *(that: IdealInt): IdealInt

def +(that: IdealInt): IdealInt

def -(that: IdealInt): IdealInt

def /(that: IdealInt): IdealInt

def /%(that: IdealInt): (IdealInt, IdealInt)

def <(that: IdealInt): Boolean

def <=(that: IdealInt): Boolean

final def ==(arg0: Any): Boolean

def >(that: IdealInt): Boolean

def >=(that: IdealInt): Boolean

def ^(that: IdealInt): IdealInt

def abs: IdealInt

def anyDivideAndRemainder(that: IdealInt): (IdealInt, IdealInt)

final def asInstanceOf[T0]: T0

def bigIntValue: BigInteger

def clone(): AnyRef

def compare(that: IdealInt): Int

def compareAbs(that: IdealInt): Int

def divides(that: IdealInt): Boolean

def doubleValue: Double

final def eq(arg0: AnyRef): Boolean

def equals(that: IdealInt): Boolean

def equals(that: Any): Boolean

def floatValue: Float

def gcd(that: IdealInt): IdealInt

final def getClass(): Class[_]

def getHighestSetBit: Int

def hashCode(): Int

def intValue: Int

def intValueSafe: Int

def isAbsMinMod(that: IdealInt): Boolean

final def isInstanceOf[T0]: Boolean

def isMinusOne: Boolean

def isOne: Boolean

def isProbablePrime(certainty: Int): Boolean

def isUnit: Boolean

def isZero: Boolean

def lcm(that: IdealInt): IdealInt

def longValue: Long

def max(that: IdealInt): IdealInt

def min(that: IdealInt): IdealInt

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pow(exp: Int): IdealInt

def powMod(exp: IdealInt, modulus: IdealInt): IdealInt

def reduceAbs(that: IdealInt): (IdealInt, IdealInt)

def signum: Int

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

def toString(): String

def unary_-: IdealInt

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def |(that: IdealInt): IdealInt

Deprecated Value Members

def finalize(): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped