|
#define | nCopy(n) n_Copy(n, currRing->cf) |
|
#define | nDelete(n) n_Delete(n, currRing->cf) |
|
#define | nMult(n1, n2) n_Mult(n1, n2, currRing->cf) |
|
#define | nAdd(n1, n2) n_Add(n1, n2, currRing->cf) |
|
#define | nIsZero(n) n_IsZero(n, currRing->cf) |
|
#define | nEqual(n1, n2) n_Equal(n1, n2, currRing->cf) |
|
#define | nInpNeg(n) n_InpNeg(n, currRing->cf) |
|
#define | nSub(n1, n2) n_Sub(n1, n2, currRing->cf) |
|
#define | nGetChar() n_GetChar(currRing->cf) |
|
#define | nInit(i) n_Init(i, currRing->cf) |
|
#define | nIsOne(n) n_IsOne(n, currRing->cf) |
|
#define | nIsMOne(n) n_IsMOne(n, currRing->cf) |
|
#define | nGreaterZero(n) n_GreaterZero(n, currRing->cf) |
|
#define | nGreater(a, b) n_Greater (a,b,currRing->cf) |
|
#define | nWrite(n) n_Write(n, currRing->cf, rShortOut(currRing)) |
|
#define | nNormalize(n) n_Normalize(n,currRing->cf) |
|
#define | nGcd(a, b) n_Gcd(a,b,currRing->cf) |
|
#define | nDiv(a, b) n_Div(a,b,currRing->cf) |
|
#define | nInvers(a) n_Invers(a,currRing->cf) |
|
#define | nExactDiv(a, b) n_ExactDiv(a,b,currRing->cf) |
|
#define | nTest(a) n_Test(a,currRing->cf) |
|
#define | nInpMult(a, b) n_InpMult(a,b,currRing->cf) |
|
#define | nPower(a, b, res) n_Power(a,b,res,currRing->cf) |
|
#define | nSize(n) n_Size(n,currRing->cf) |
|
#define | nGetDenom(N) n_GetDenom((N),currRing->cf) |
|
#define | nGetNumerator(N) n_GetNumerator((N),currRing->cf) |
|
#define | nSetMap(R) n_SetMap(R,currRing->cf) |
|
#define | nPrint(a) n_Print(a,currRing->cf) |
| only for debug, over any initalized currRing More...
|
|
#define | SHORT_REAL_LENGTH 6 |
|
|
number | ndGcd (number a, number b, const coeffs) |
|
number | ndCopyMap (number a, const coeffs src, const coeffs dst) |
|
CanonicalForm | ndConvSingNFactoryN (number, BOOLEAN, const coeffs) |
|
BOOLEAN | n_IsZeroDivisor (number a, const coeffs r) |
| Test whether a is a zero divisor in r i.e. not coprime with char. of r very inefficient implementation: should ONLY be used for debug stuff /tests. More...
|
|
n_coeffType | nRegister (n_coeffType n, cfInitCharProc p) |
|
void | nRegisterCfByName (cfInitCfByNameProc p, n_coeffType n) |
|
coeffs | nFindCoeffByName (char *n) |
| find an existing coeff by its "CoeffName" More...
|
|
char * | nEati (char *s, int *i, int m) |
| divide by the first (leading) number and return it, i.e. make monic More...
|
|
char * | nEatLong (char *s, mpz_ptr i) |
| extracts a long integer from s, returns the rest More...
|
|