| 1 | #ifndef MODULOP_H |
|---|
| 2 | #define MODULOP_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id: modulop.h,v 1.5 1999-05-26 16:23:57 obachman Exp $ */ |
|---|
| 7 | /* |
|---|
| 8 | * ABSTRACT: numbers modulo p (<=32003) |
|---|
| 9 | */ |
|---|
| 10 | #include "structs.h" |
|---|
| 11 | |
|---|
| 12 | extern int npPrimeM; |
|---|
| 13 | extern int npGen; |
|---|
| 14 | extern int npMapPrime; |
|---|
| 15 | |
|---|
| 16 | BOOLEAN npGreaterZero (number k); |
|---|
| 17 | number npMult (number a, number b); |
|---|
| 18 | number npInit (int i); |
|---|
| 19 | int npInt (number &n); |
|---|
| 20 | number npCopy (number k1); |
|---|
| 21 | number npAdd (number a, number b); |
|---|
| 22 | number npSub (number a, number b); |
|---|
| 23 | void npPower (number a, int i, number * result); |
|---|
| 24 | BOOLEAN npIsZero (number a); |
|---|
| 25 | BOOLEAN npIsOne (number a); |
|---|
| 26 | BOOLEAN npIsMOne (number a); |
|---|
| 27 | number npDiv (number a, number b); |
|---|
| 28 | number npNeg (number c); |
|---|
| 29 | number npInvers (number c); |
|---|
| 30 | BOOLEAN npGreater (number a, number b); |
|---|
| 31 | BOOLEAN npEqual (number a, number b); |
|---|
| 32 | void npWrite (number &a); |
|---|
| 33 | char * npRead (char *s, number *a); |
|---|
| 34 | #ifdef LDEBUG |
|---|
| 35 | BOOLEAN npDBTest (number a, char *f, int l); |
|---|
| 36 | #endif |
|---|
| 37 | void npSetChar(int c); |
|---|
| 38 | //int npGetChar(); |
|---|
| 39 | |
|---|
| 40 | BOOLEAN npSetMap(int c, char ** par, int nop, number minpol); |
|---|
| 41 | number npMapP(number from); |
|---|
| 42 | /*-------specials for spolys, do NOT use otherwise--------------------------*/ |
|---|
| 43 | /* for npMultM, npSubM, npNegM, npEqualM : */ |
|---|
| 44 | extern int npPminus1M; |
|---|
| 45 | extern CARDINAL *npExpTable; |
|---|
| 46 | extern CARDINAL *npLogTable; |
|---|
| 47 | |
|---|
| 48 | inline number npMultM(number a, number b) |
|---|
| 49 | { |
|---|
| 50 | int x = npLogTable[(int)a]+npLogTable[(int)b]; |
|---|
| 51 | return (number)npExpTable[x<npPminus1M ? x : x-npPminus1M]; |
|---|
| 52 | } |
|---|
| 53 | |
|---|
| 54 | inline number npAddM(number a, number b) |
|---|
| 55 | { |
|---|
| 56 | int ka = (int)a + (int)b; |
|---|
| 57 | if (ka >= npPrimeM) ka -= npPrimeM; |
|---|
| 58 | return (number)ka; |
|---|
| 59 | } |
|---|
| 60 | |
|---|
| 61 | inline BOOLEAN npIsZeroM (number a) |
|---|
| 62 | { |
|---|
| 63 | return 0 == (int)a; |
|---|
| 64 | } |
|---|
| 65 | |
|---|
| 66 | /* |
|---|
| 67 | *inline number npMultM(number a, number b) |
|---|
| 68 | *{ |
|---|
| 69 | * return (number)(((int)a*(int)b) % npPrimeM); |
|---|
| 70 | *} |
|---|
| 71 | */ |
|---|
| 72 | #define npSubM(a,b) (number)((int)a<(int)b ?\ |
|---|
| 73 | npPrimeM-(int)b+(int)a : (int)a-(int)b) |
|---|
| 74 | #define npNegM(A) (number)(npPrimeM-(int)(A)) |
|---|
| 75 | #define npEqualM(A,B) ((int)A==(int)B) |
|---|
| 76 | |
|---|
| 77 | #endif |
|---|
| 78 | |
|---|
