| 1 | #ifndef LONGRAT_H |
|---|
| 2 | #define LONGRAT_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id: longrat.h,v 1.25 2001-08-24 14:10:09 Singular Exp $ */ |
|---|
| 7 | /* |
|---|
| 8 | * ABSTRACT: computation with long rational numbers |
|---|
| 9 | */ |
|---|
| 10 | #include "structs.h" |
|---|
| 11 | |
|---|
| 12 | extern "C" { |
|---|
| 13 | #include <gmp.h> |
|---|
| 14 | } |
|---|
| 15 | #ifdef HAVE_SMALLGMP |
|---|
| 16 | # define HAVE_LIBGMP2 |
|---|
| 17 | #else |
|---|
| 18 | #if (__GNU_MP_VERSION > 1) && (__GNU_MP_VERSION_MINOR >= 0) |
|---|
| 19 | # define HAVE_LIBGMP2 |
|---|
| 20 | #else |
|---|
| 21 | # define HAVE_LIBGMP1 |
|---|
| 22 | #endif |
|---|
| 23 | #endif |
|---|
| 24 | |
|---|
| 25 | typedef MP_INT lint; |
|---|
| 26 | |
|---|
| 27 | #define SR_INT 1 |
|---|
| 28 | #define INT_TO_SR(INT) ((number) (((long)INT << 2) + SR_INT)) |
|---|
| 29 | #define SR_TO_INT(SR) (((long)SR) >> 2) |
|---|
| 30 | |
|---|
| 31 | |
|---|
| 32 | #define MP_SMALL 1 |
|---|
| 33 | |
|---|
| 34 | #ifdef HAVE_LIBGMP1 |
|---|
| 35 | #define mpz_size1(A) (ABS((A)->size)) |
|---|
| 36 | #else |
|---|
| 37 | #define mpz_size1(A) (ABS((A)->_mp_size)) |
|---|
| 38 | #endif |
|---|
| 39 | //#define mpz_size1(A) mpz_size(A) |
|---|
| 40 | |
|---|
| 41 | struct snumber; |
|---|
| 42 | typedef struct snumber rnumber; |
|---|
| 43 | struct snumber |
|---|
| 44 | { |
|---|
| 45 | lint z; |
|---|
| 46 | lint n; |
|---|
| 47 | #if defined(LDEBUG) |
|---|
| 48 | int debug; |
|---|
| 49 | #endif |
|---|
| 50 | BOOLEAN s; |
|---|
| 51 | }; |
|---|
| 52 | |
|---|
| 53 | // allow inlining only from p_Numbers.h and if ! LDEBUG |
|---|
| 54 | |
|---|
| 55 | #if defined(DO_LINLINE) && defined(P_NUMBERS_H) && !defined(LDEBUG) |
|---|
| 56 | #define LINLINE static inline |
|---|
| 57 | #else |
|---|
| 58 | #define LINLINE |
|---|
| 59 | #undef DO_LINLINE |
|---|
| 60 | #endif // DO_LINLINE |
|---|
| 61 | |
|---|
| 62 | LINLINE BOOLEAN nlEqual(number a, number b); |
|---|
| 63 | LINLINE number nlInit(int i); |
|---|
| 64 | LINLINE BOOLEAN nlIsOne(number a); |
|---|
| 65 | LINLINE BOOLEAN nlIsZero(number za); |
|---|
| 66 | LINLINE number nlCopy(number a); |
|---|
| 67 | LINLINE number nl_Copy(number a, ring r); |
|---|
| 68 | LINLINE void nlNew(number *r); |
|---|
| 69 | LINLINE void nlDelete(number *a, const ring r); |
|---|
| 70 | LINLINE number nlNeg(number za); |
|---|
| 71 | LINLINE number nlAdd(number la, number li); |
|---|
| 72 | LINLINE number nlSub(number la, number li); |
|---|
| 73 | LINLINE number nlMult(number a, number b); |
|---|
| 74 | |
|---|
| 75 | number nlGcd(number a, number b, const ring r); |
|---|
| 76 | number nlLcm(number a, number b, const ring r); /*special routine !*/ |
|---|
| 77 | BOOLEAN nlGreater(number a, number b); |
|---|
| 78 | BOOLEAN nlIsMOne(number a); |
|---|
| 79 | number nlInit(number i); |
|---|
| 80 | int nlInt(number &n); |
|---|
| 81 | BOOLEAN nlGreaterZero(number za); |
|---|
| 82 | number nlInvers(number a); |
|---|
| 83 | void nlNormalize(number &x); |
|---|
| 84 | number nlDiv(number a, number b); |
|---|
| 85 | number nlExactDiv(number a, number b); |
|---|
| 86 | number nlIntDiv(number a, number b); |
|---|
| 87 | number nlIntMod(number a, number b); |
|---|
| 88 | void nlPower(number x, int exp, number *lu); |
|---|
| 89 | char * nlRead (char *s, number *a); |
|---|
| 90 | void nlWrite(number &a); |
|---|
| 91 | int nlModP(number n, int p); |
|---|
| 92 | int nlSize(number n); |
|---|
| 93 | number nlGetDenom(number &n); |
|---|
| 94 | #ifdef LDEBUG |
|---|
| 95 | BOOLEAN nlDBTest(number a, char *f, int l); |
|---|
| 96 | #endif |
|---|
| 97 | |
|---|
| 98 | nMapFunc nlSetMap(ring src, ring dst); |
|---|
| 99 | |
|---|
| 100 | #ifndef OM_ALLOC_H |
|---|
| 101 | struct omBin_s; |
|---|
| 102 | #endif |
|---|
| 103 | extern omBin_s* rnumber_bin; |
|---|
| 104 | |
|---|
| 105 | #endif |
|---|
| 106 | |
|---|
| 107 | |
|---|
