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