source: git/libpolys/coeffs/rmodulo2m.h @ 014b65

fieker-DuValspielwiese
Last change on this file since 014b65 was 014b65, checked in by Mohamed Barakat <mohamed.barakat@…>, 13 years ago
- moved misc,reporter,resources,coeffs,polys -> (new) libpolys (Hans agreed) - migrated to automake in coeffs, misc status: everything builds (except polys) todo: . migrate resources and reporter to automake . create autoconf macros for omalloc, factory, and libpolys
  • Property mode set to 100644
File size: 3.0 KB
Line 
1#ifndef RMODULO2M_H
2#define RMODULO2M_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id$ */
7/*
8* ABSTRACT: numbers modulo 2^m such that 2^m - 1
9*           fits in an unsigned long
10*/
11#ifdef HAVE_RINGS
12#include <coeffs/coeffs.h>
13#include <coeffs/rintegers.h>
14
15#ifndef NATNUMBER
16#define NATNUMBER unsigned long
17#endif
18
19BOOLEAN nr2mInitChar    (coeffs r, void*);
20
21number  nr2mCopy        (number a, const coeffs r);
22BOOLEAN nr2mGreaterZero (number k, const coeffs r);
23number  nr2mMult        (number a, number b, const coeffs r);
24number  nr2mInit        (int i, const coeffs r);
25int     nr2mInt         (number &n, const coeffs r);
26number  nr2mAdd         (number a, number b, const coeffs r);
27number  nr2mSub         (number a, number b, const coeffs r);
28void    nr2mPower       (number a, int i, number * result, const coeffs r);
29BOOLEAN nr2mIsZero      (number a, const coeffs r);
30BOOLEAN nr2mIsOne       (number a, const coeffs r);
31BOOLEAN nr2mIsMOne      (number a, const coeffs r);
32BOOLEAN nr2mIsUnit      (number a, const coeffs r);
33number  nr2mGetUnit     (number a, const coeffs r);
34number  nr2mDiv         (number a, number b, const coeffs r);
35number  nr2mIntDiv      (number a,number b, const coeffs r);
36number  nr2mMod         (number a,number b, const coeffs r);
37number  nr2mNeg         (number c, const coeffs r);
38number  nr2mInvers      (number c, const coeffs r);
39BOOLEAN nr2mGreater     (number a, number b, const coeffs r);
40BOOLEAN nr2mDivBy       (number a, number b, const coeffs r);
41int     nr2mDivComp     (number a, number b, const coeffs r);
42BOOLEAN nr2mEqual       (number a, number b, const coeffs r);
43number  nr2mLcm         (number a, number b, const coeffs r);
44number  nr2mGcd         (number a, number b, const coeffs r);
45number  nr2mExtGcd      (number a, number b, number *s, number *t, const coeffs r);
46nMapFunc nr2mSetMap     (const coeffs src, const coeffs dst);
47void    nr2mWrite       (number &a, const coeffs r);
48const char *  nr2mRead  (const char *s, number *a, const coeffs r);
49char *  nr2mName        (number n, const coeffs r);
50#ifdef LDEBUG
51BOOLEAN nr2mDBTest      (number a, const char *f, const int l, const coeffs r);
52#endif
53void    nr2mSetExp(int c, const coeffs r);
54void    nr2mInitExp(int c, const coeffs r);
55
56
57static inline number nr2mMultM(number a, number b, const coeffs r)
58{
59  return (number)
60    ((((NATNUMBER) a) * ((NATNUMBER) b)) & ((NATNUMBER)r->mod2mMask));
61}
62
63static inline number nr2mAddM(number a, number b, const coeffs r)
64{
65  return (number)
66    ((((NATNUMBER) a) + ((NATNUMBER) b)) & ((NATNUMBER)r->mod2mMask));
67}
68
69static inline number nr2mSubM(number a, number b, const coeffs r)
70{
71  return (number)((NATNUMBER)a < (NATNUMBER)b ?
72                       r->mod2mMask - (NATNUMBER)b + (NATNUMBER)a + 1:
73                       (NATNUMBER)a - (NATNUMBER)b);
74}
75
76#define nr2mNegM(A,r) (number)((r->mod2mMask - (NATNUMBER)(A) + 1) & r->mod2mMask)
77#define nr2mEqualM(A,B)  ((A)==(B))
78
79#endif
80#endif
Note: See TracBrowser for help on using the repository browser.