| 1 | #ifndef NUMBERS_H |
|---|
| 2 | #define NUMBERS_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id$ */ |
|---|
| 7 | /* |
|---|
| 8 | * ABSTRACT: interface to coefficient aritmetics |
|---|
| 9 | */ |
|---|
| 10 | #include "structs.h" |
|---|
| 11 | |
|---|
| 12 | #define n_Copy(n, r) (r)->cf->cfCopy(n,r) |
|---|
| 13 | #define n_Delete(n, r) (r)->cf->cfDelete(n,r) |
|---|
| 14 | #define n_Mult(n1, n2, r) (r)->cf->nMult(n1, n2) |
|---|
| 15 | #define n_Add(n1, n2, r) (r)->cf->nAdd(n1, n2) |
|---|
| 16 | #define n_IsZero(n, r) (r)->cf->nIsZero(n) |
|---|
| 17 | #define n_Equal(n1, n2, r) (r)->cf->nEqual(n1, n2) |
|---|
| 18 | #define n_Neg(n, r) (r)->cf->nNeg(n) |
|---|
| 19 | #define n_Sub(n1, n2, r) (r)->cf->nSub(n1, n2) |
|---|
| 20 | //#define n_GetChar(r) ((r)->cf->nChar) |
|---|
| 21 | #define n_GetChar(r) ((r)->ch) |
|---|
| 22 | #define n_Init(i, r) (r)->cf->cfInit(i,r) |
|---|
| 23 | #define n_IsOne(n, r) (r)->cf->nIsOne(n) |
|---|
| 24 | #define n_IsMOne(n, r) (r)->cf->nIsMOne(n) |
|---|
| 25 | #define n_GreaterZero(n, r) (r)->cf->nGreaterZero(n) |
|---|
| 26 | #define n_Write(n, r) (r)->cf->cfWrite(n,r) |
|---|
| 27 | #define n_Normalize(n, r) (r)->cf->nNormalize(n) |
|---|
| 28 | #define n_Gcd(a, b, r) (r)->cf->nGcd(a,b,r) |
|---|
| 29 | #define n_IntDiv(a, b, r) (r)->cf->nIntDiv(a,b) |
|---|
| 30 | #define n_Div(a, b, r) (r)->cf->nDiv(a,b) |
|---|
| 31 | #define n_Invers(a, r) (r)->cf->nInvers(a) |
|---|
| 32 | #define n_ExactDiv(a, b, r) (r)->cf->nExactDiv(a,b) |
|---|
| 33 | #define n_Test(a,r) (r)->cf->nDBTest(a,__FILE__,__LINE__) |
|---|
| 34 | |
|---|
| 35 | #define n_InpMult(a, b, r) (r)->cf->nInpMult(a,b,r) |
|---|
| 36 | #define n_Power(a, b, res, r) (r)->cf->nPower(a,b,res) |
|---|
| 37 | #define n_Size(n,r) (r)->cf->nSize(n) |
|---|
| 38 | #define n_GetDenom(N,r) (r)->cf->cfGetDenom((N),r) |
|---|
| 39 | #define n_GetNumerator(N,r) (r)->cf->cfGetNumerator((N),r) |
|---|
| 40 | |
|---|
| 41 | #define n_New(n, r) nNew(n) |
|---|
| 42 | |
|---|
| 43 | /* variables */ |
|---|
| 44 | extern unsigned short fftable[]; |
|---|
| 45 | |
|---|
| 46 | /* prototypes */ |
|---|
| 47 | extern numberfunc nMult, nSub ,nAdd ,nDiv, nIntDiv, nIntMod, nExactDiv; |
|---|
| 48 | void nNew(number * a); |
|---|
| 49 | extern number (*nInit_bigint)(number i); |
|---|
| 50 | #define nInit(i) n_Init(i,currRing) |
|---|
| 51 | extern number (*nPar)(int i); |
|---|
| 52 | extern int (*nParDeg)(number n); |
|---|
| 53 | /* size: a measure for the complexity of the represented number n; |
|---|
| 54 | zero should have size zero; larger size means more complex */ |
|---|
| 55 | extern int (*nSize)(number n); |
|---|
| 56 | extern int (*n_Int)(number &n, const ring r); |
|---|
| 57 | #ifdef HAVE_RINGS |
|---|
| 58 | extern int (*nDivComp)(number a,number b); |
|---|
| 59 | extern BOOLEAN (*nIsUnit)(number a); |
|---|
| 60 | extern number (*nGetUnit)(number a); |
|---|
| 61 | extern number (*nExtGcd)(number a, number b, number *s, number *t); |
|---|
| 62 | #endif |
|---|
| 63 | // always use in the form n=nNeg(n) ! |
|---|
| 64 | extern number (*nNeg)(number a); |
|---|
| 65 | extern number (*nInvers)(number a); |
|---|
| 66 | extern number (*nCopy)(number a); |
|---|
| 67 | extern number (*nRePart)(number a); |
|---|
| 68 | extern number (*nImPart)(number a); |
|---|
| 69 | #define nWrite(A) n_Write(A,currRing) |
|---|
| 70 | extern const char * (*nRead)(const char * s, number * a); |
|---|
| 71 | extern void (*nNormalize)(number &a); |
|---|
| 72 | extern BOOLEAN (*nGreater)(number a,number b), |
|---|
| 73 | #ifdef HAVE_RINGS |
|---|
| 74 | (*nDivBy)(number a,number b), |
|---|
| 75 | #endif |
|---|
| 76 | (*nEqual)(number a,number b), |
|---|
| 77 | (*nIsZero)(number a), |
|---|
| 78 | (*nIsOne)(number a), |
|---|
| 79 | (*nIsMOne)(number a), |
|---|
| 80 | (*nGreaterZero)(number a); |
|---|
| 81 | extern void (*nPower)(number a, int i, number * result); |
|---|
| 82 | extern number (*nGcd)(number a, number b, const ring r); |
|---|
| 83 | extern number (*nLcm)(number a, number b, const ring r); |
|---|
| 84 | |
|---|
| 85 | extern number nNULL; /* the 0 as constant */ |
|---|
| 86 | |
|---|
| 87 | #define nTest(a) (1) |
|---|
| 88 | #define nDelete(A) (currRing)->cf->cfDelete(A,currRing) |
|---|
| 89 | #define nGetDenom(N) (currRing->cf->cfGetDenom((N),currRing)) |
|---|
| 90 | #define nGetNumerator(N) (currRing->cf->cfGetNumerator((N),currRing)) |
|---|
| 91 | |
|---|
| 92 | #define nSetMap(R) (currRing->cf->cfSetMap(R,currRing)) |
|---|
| 93 | extern char * (*nName)(number n); |
|---|
| 94 | |
|---|
| 95 | void nDummy1(number* d); |
|---|
| 96 | void ndDelete(number* d, const ring r); |
|---|
| 97 | void nDummy2(number &d); |
|---|
| 98 | number ndGcd(number a, number b, const ring); |
|---|
| 99 | number ndCopy(number a); |
|---|
| 100 | void ndInpMult(number &a, number b, const ring r); |
|---|
| 101 | number ndInpAdd(number &a, number b, const ring r); |
|---|
| 102 | |
|---|
| 103 | #ifdef LDEBUG |
|---|
| 104 | void nDBDummy1(number* d,char *f, int l); |
|---|
| 105 | #endif |
|---|
| 106 | #define nGetChar() n_GetChar(currRing) |
|---|
| 107 | |
|---|
| 108 | void nInitChar(ring r); |
|---|
| 109 | void nKillChar(ring r); |
|---|
| 110 | void nSetChar(ring r); |
|---|
| 111 | |
|---|
| 112 | #define nDivBy0 "div by 0" |
|---|
| 113 | |
|---|
| 114 | // dummy routines |
|---|
| 115 | void nDummy2(number& d); // nNormalize... |
|---|
| 116 | #endif |
|---|
