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