#include <Value.h>
Inheritance diagram for mcIntegerValue:
Definition at line 509 of file Value.h.
Public Member Functions | |
mcVALUE_DEFINE_CONSTRUCTORS (mcIntegerValue, mcMPZ) | |
mcIntegerValue (const mcRationalValue &m) | |
mcIntegerValue (const mcRealValue &m) | |
mcVALUE_DEFINE_GETSET (mcIntegerValue, mpz) | |
mcVALUE_DEFINE_ALLOPERATORS (mcIntegerValue, mcMPZ, mpz) | |
mcIntegerValue | abs () const |
Returns the absolute value of this number. | |
mcIntegerValue | pow (unsigned long int exp) const |
Raise this number to the given one. | |
mcIntegerValue | GetMax (const mcIntegerValue &n) const |
mcIntegerValue | GetMin (const mcIntegerValue &n) const |
wxString | GetStr () const |
See mcValue::GetStr. | |
bool | isInteger () const |
mcIntegerValues are always integer... :-) | |
bool | isPrimeTo (const mcIntegerValue &n) const |
Returns TRUE if this number and the given one are prime. | |
mcIntegerValue | GCD (const mcIntegerValue &n) const |
Returns the highest common factor between the two numbers supplied. | |
mcIntegerValue | LCM (const mcIntegerValue &n) const |
Returns the least common multiple between the two numbers supplied. | |
Static Public Member Functions | |
static mcIntegerValue | GetComb (const mcIntegerValue &n1, const mcIntegerValue &n2) |
Static Public Attributes | |
static mcIntegerValue * | pOne = NULL |
static mcIntegerValue * | pZero = NULL |
static mcIntegerValue * | pNAN = NULL |
Not a number. See isNAN(). | |
static mcIntegerValue * | pPosInf = NULL |
Positive infinite. See math_isFinite(). | |
static mcIntegerValue * | pNegInf = NULL |
Negative infinite. See math_isFinite(). | |
Private Member Functions | |
mcVALUE_DEFINE_COW (mcMPZ, mpz) |
|
|
|
|
|
Returns the absolute value of this number.
|
|
Returns the highest common factor between the two numbers supplied. If we have two integers, GCD is the largest integer that divides evenly both numbers Euclid's GCD Algorithm is as follows - GCD(0, 0) = 1 GCD(x, 0) = x GCD(x, y) = GCD(y, x mod y) Definition at line 566 of file Value.h. Referenced by isPrimeTo(), and mcNumberHelpers::math_CanBeDivBy(). |
|
Definition at line 555 of file Value.h. References mcValue::GetLong(). Referenced by mcPolynomialHelpers::math_RaiseGetCoeff(). |
|
Definition at line 540 of file Value.h. Referenced by mcPolynomialHelpers::math_GetMaxDegreeFor(), and mcMonomialHelpers::math_GetMaxDegreeFor(). |
|
|
|
See mcValue::GetStr.
Implements mcValue. Definition at line 151 of file Value.cpp. References GMP2WX. Referenced by mcNumberHelpers::math_CanBeDivBy(), mcMonomialHelpers::math_GetMaxDegreeFor(), and mcPolynomialHelpers::math_RaiseTo(). |
|
mcIntegerValues are always integer... :-)
Implements mcValue. |
|
Returns TRUE if this number and the given one are prime.
Definition at line 553 of file Value.h. References GCD(). Referenced by mcNumberHelpers::math_CanBeDivBy(). |
|
Returns the least common multiple between the two numbers supplied. If we have two numbers, LCM is the smallest integer that both of them divide evenly into. LCM Algorithm is as follows - LCM(x, y) |
|
|
|
|
|
|
|
|
|
Raise this number to the given one.
|
|
Not a number. See isNAN().
|
|
Negative infinite. See math_isFinite().
|
|
|
|
Positive infinite. See math_isFinite().
|
|
|
[ Top ] |