source: git/kernel/rmodulo2m.h @ 18ff4c

spielwiese
Last change on this file since 18ff4c was 1e579c6, checked in by Oliver Wienand <wienand@…>, 17 years ago
kutil.cc: * use nExtGcd, nIsUnit * extended spolys only for non-domains numbers.cc, numbers.h, structs.h: * new Functions: nIsUnit, nGetUnit, nExtGcd * new Field: the Integers polys.cc, polys.h: * nGetUnit hack removed * minor memory glitch polys1.cc: * no pContent for Integers ring.h: new rField methos for Integers and p^n rintegers.*: implementation of the whole numbers using gmp rmodulo*: added funcs: nIsUnit, nGetUnit, nExtGcd git-svn-id: file:///usr/local/Singular/svn/trunk@10125 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 2.2 KB
Line 
1#ifndef RMODULO2M_H
2#define RMODULO2M_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: rmodulo2m.h,v 1.7 2007-06-20 09:39:25 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);
26BOOLEAN nr2mIsUnit      (number a);
27number  nr2mGetUnit     (number a);
28number  nr2mDiv         (number a, number b);
29number  nr2mIntDiv      (number a,number b);
30number  nr2mNeg         (number c);
31number  nr2mInvers      (number c);
32BOOLEAN nr2mGreater     (number a, number b);
33BOOLEAN nr2mDivBy       (number a, number b);
34int     nr2mComp        (number a, number b);
35BOOLEAN nr2mEqual       (number a, number b);
36number  nr2mLcm         (number a,number b, ring r);
37number  nr2mGcd         (number a,number b,ring r);
38number  nr2mExtGcd      (number a, number b, number *s, number *t);
39nMapFunc nr2mSetMap     (ring src, ring dst);
40void    nr2mWrite       (number &a);
41char *  nr2mRead        (char *s, number *a);
42char *  nr2mName        (number n);
43#ifdef LDEBUG
44BOOLEAN nr2mDBTest      (number a, char *f, int l);
45#endif
46void    nr2mSetExp(int c, ring r);
47void    nr2mInitExp(int c, ring r);
48
49
50static inline number nr2mMultM(number a, number b)
51{
52  return (number) 
53    ((((NATNUMBER) a)*((NATNUMBER) b)) % ((NATNUMBER) nr2mModul));
54}
55
56static inline number nr2mAddM(number a, number b)
57{
58  NATNUMBER r = (NATNUMBER)a + (NATNUMBER)b;
59  return (number) (r >= nr2mModul ? r - nr2mModul : r);
60}
61
62static inline number nr2mSubM(number a, number b)
63{
64  return (number)((NATNUMBER)a<(NATNUMBER)b ?
65                       nr2mModul-(NATNUMBER)b+(NATNUMBER)a : (NATNUMBER)a-(NATNUMBER)b);
66}
67
68#define nr2mNegM(A) (number)(nr2mModul-(NATNUMBER)(A))
69#define nr2mEqualM(A,B)  ((A)==(B))
70
71#endif
72#endif
Note: See TracBrowser for help on using the repository browser.