[4f8867] | 1 | #ifndef RMODULO2M_H |
---|
| 2 | #define RMODULO2M_H |
---|
[35b1d7] | 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
[341696] | 6 | /* $Id$ */ |
---|
[35b1d7] | 7 | /* |
---|
| 8 | * ABSTRACT: numbers modulo 2^m |
---|
| 9 | */ |
---|
[c90b43] | 10 | #ifdef HAVE_RINGS |
---|
[599326] | 11 | #include <kernel/structs.h> |
---|
[35b1d7] | 12 | |
---|
| 13 | extern int nr2mExp; |
---|
[76e501] | 14 | extern NATNUMBER nr2mModul; /* for storing 2^m - 1, i.e., the |
---|
| 15 | bit pattern '11..1' of length m */ |
---|
[35b1d7] | 16 | |
---|
| 17 | BOOLEAN nr2mGreaterZero (number k); |
---|
| 18 | number nr2mMult (number a, number b); |
---|
[8391d8] | 19 | number nr2mInit (int i, const ring r); |
---|
[cf74cd6] | 20 | int nr2mInt (number &n, const ring r); |
---|
[35b1d7] | 21 | number nr2mAdd (number a, number b); |
---|
| 22 | number nr2mSub (number a, number b); |
---|
| 23 | void nr2mPower (number a, int i, number * result); |
---|
| 24 | BOOLEAN nr2mIsZero (number a); |
---|
| 25 | BOOLEAN nr2mIsOne (number a); |
---|
| 26 | BOOLEAN nr2mIsMOne (number a); |
---|
[1e579c6] | 27 | BOOLEAN nr2mIsUnit (number a); |
---|
| 28 | number nr2mGetUnit (number a); |
---|
[35b1d7] | 29 | number nr2mDiv (number a, number b); |
---|
[206e158] | 30 | number nr2mIntDiv (number a,number b); |
---|
[6ea941] | 31 | number nr2mMod (number a,number b); |
---|
[35b1d7] | 32 | number nr2mNeg (number c); |
---|
| 33 | number nr2mInvers (number c); |
---|
| 34 | BOOLEAN nr2mGreater (number a, number b); |
---|
[009d80] | 35 | BOOLEAN nr2mDivBy (number a, number b); |
---|
[d351d8] | 36 | int nr2mDivComp (number a, number b); |
---|
[35b1d7] | 37 | BOOLEAN nr2mEqual (number a, number b); |
---|
[206e158] | 38 | number nr2mLcm (number a,number b, ring r); |
---|
| 39 | number nr2mGcd (number a,number b,ring r); |
---|
[1e579c6] | 40 | number nr2mExtGcd (number a, number b, number *s, number *t); |
---|
[208e0c] | 41 | nMapFunc nr2mSetMap (const ring src, const ring dst); |
---|
[493225] | 42 | void nr2mWrite (number &a, const ring r); |
---|
[85e68dd] | 43 | const char * nr2mRead (const char *s, number *a); |
---|
[35b1d7] | 44 | char * nr2mName (number n); |
---|
| 45 | #ifdef LDEBUG |
---|
[85e68dd] | 46 | BOOLEAN nr2mDBTest (number a, const char *f, const int l); |
---|
[35b1d7] | 47 | #endif |
---|
[b064be] | 48 | void nr2mSetExp(int c, const ring r); |
---|
| 49 | void nr2mInitExp(int c, const ring r); |
---|
[35b1d7] | 50 | |
---|
| 51 | |
---|
| 52 | static inline number nr2mMultM(number a, number b) |
---|
| 53 | { |
---|
[76e501] | 54 | return (number) |
---|
| 55 | ((((NATNUMBER) a) * ((NATNUMBER) b)) & ((NATNUMBER) currRing->nr2mModul)); |
---|
[35b1d7] | 56 | } |
---|
| 57 | |
---|
| 58 | static inline number nr2mAddM(number a, number b) |
---|
| 59 | { |
---|
[76e501] | 60 | return (number) |
---|
| 61 | ((((NATNUMBER) a) + ((NATNUMBER) b)) & ((NATNUMBER) currRing->nr2mModul)); |
---|
[35b1d7] | 62 | } |
---|
| 63 | |
---|
| 64 | static inline number nr2mSubM(number a, number b) |
---|
| 65 | { |
---|
[76e501] | 66 | return (number)((NATNUMBER)a < (NATNUMBER)b ? |
---|
| 67 | currRing->nr2mModul - (NATNUMBER)b + (NATNUMBER)a + 1 : |
---|
| 68 | (NATNUMBER)a - (NATNUMBER)b); |
---|
[35b1d7] | 69 | } |
---|
| 70 | |
---|
[76e501] | 71 | #define nr2mNegM(A) (number)(currRing->nr2mModul - (NATNUMBER)(A) + 1) |
---|
[35b1d7] | 72 | #define nr2mEqualM(A,B) ((A)==(B)) |
---|
[4f8867] | 73 | |
---|
[c81a40] | 74 | number nr2mMapQ(number from); |
---|
[4f8867] | 75 | #endif |
---|
| 76 | #endif |
---|