source: git/kernel/rmodulo2m.h @ 009d80

spielwiese
Last change on this file since 009d80 was 009d80, checked in by Oliver Wienand <wienand@…>, 17 years ago
new compile switch: HAVE_RINGS at total there are now: HAVE_RINGS, HAVE_RING2TOM, HAVE_RINGMODN kspoly.cc, kstd1.cc, kstd2.cc, kutil.cc, kspoly.cc, polys.cc, ring.*: adaption of new switches and rField_is_Ring method numbers.*: introduced new operation: nDivBy(a, b) = Is a divisible by b? pDebig.cc, pInline1.h: use of new nDivBy method p_Mult_q: new routine for rings p_*, pp_*: template switch HAVE_ZERODIVISOR polys1.cc: poly exponentation, switches rmodulo*: nDivBy implementation, DBTest structs.h: nDivBy, ringtype, ringflaga, ringflagb git-svn-id: file:///usr/local/Singular/svn/trunk@10029 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 2.0 KB
Line 
1#ifndef RMODULO2M_H
2#define RMODULO2M_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: rmodulo2m.h,v 1.5 2007-05-10 08:12:43 wienand Exp $ */
7/*
8* ABSTRACT: numbers modulo 2^m
9*/
10#ifdef HAVE_RING2TOM
11#include "structs.h"
12
13extern int nr2mExp;
14extern NATNUMBER nr2mModul;
15
16BOOLEAN nr2mGreaterZero (number k);
17number  nr2mMult        (number a, number b);
18number  nr2mInit        (int i);
19int     nr2mInt         (number &n);
20number  nr2mAdd         (number a, number b);
21number  nr2mSub         (number a, number b);
22void    nr2mPower       (number a, int i, number * result);
23BOOLEAN nr2mIsZero      (number a);
24BOOLEAN nr2mIsOne       (number a);
25BOOLEAN nr2mIsMOne      (number a);
26number  nr2mDiv         (number a, number b);
27number   nr2mIntDiv      (number a,number b);
28number  nr2mNeg         (number c);
29number  nr2mInvers      (number c);
30BOOLEAN nr2mGreater     (number a, number b);
31BOOLEAN nr2mDivBy       (number a, number b);
32BOOLEAN nr2mEqual       (number a, number b);
33number   nr2mLcm         (number a,number b, ring r);
34number   nr2mGcd         (number a,number b,ring r);
35nMapFunc nr2mSetMap(ring src, ring dst);
36void    nr2mWrite       (number &a);
37char *  nr2mRead        (char *s, number *a);
38char *  nr2mName        (number n);
39#ifdef LDEBUG
40BOOLEAN nr2mDBTest      (number a, char *f, int l);
41#endif
42void    nr2mSetExp(int c, ring r);
43void    nr2mInitExp(int c, ring r);
44
45
46static inline number nr2mMultM(number a, number b)
47{
48  return (number) 
49    ((((NATNUMBER) a)*((NATNUMBER) b)) % ((NATNUMBER) nr2mModul));
50}
51
52static inline number nr2mAddM(number a, number b)
53{
54  NATNUMBER r = (NATNUMBER)a + (NATNUMBER)b;
55  return (number) (r >= nr2mModul ? r - nr2mModul : r);
56}
57
58static inline number nr2mSubM(number a, number b)
59{
60  return (number)((NATNUMBER)a<(NATNUMBER)b ?
61                       nr2mModul-(NATNUMBER)b+(NATNUMBER)a : (NATNUMBER)a-(NATNUMBER)b);
62}
63
64#define nr2mNegM(A) (number)(nr2mModul-(NATNUMBER)(A))
65#define nr2mEqualM(A,B)  ((A)==(B))
66
67#endif
68#endif
Note: See TracBrowser for help on using the repository browser.