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