source: git/kernel/longrat.h @ 87beab7

spielwiese
Last change on this file since 87beab7 was e8a0aa, checked in by Hans Schönemann <hannes@…>, 16 years ago
*hannes: nlInpAdd git-svn-id: file:///usr/local/Singular/svn/trunk@10950 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 3.0 KB
Line 
1#ifndef LONGRAT_H
2#define LONGRAT_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: longrat.h,v 1.13 2008-08-06 13:55:42 Singular Exp $ */
7/*
8* ABSTRACT: computation with long rational numbers
9*/
10#include "structs.h"
11
12#include "si_gmp.h"
13
14typedef MP_INT lint;
15
16#define SR_HDL(A) ((long)(A))
17
18#define SR_INT    1L
19#define INT_TO_SR(INT)  ((number) (((long)INT << 2) + SR_INT))
20#define SR_TO_INT(SR)   (((long)SR) >> 2)
21
22
23#define MP_SMALL 1
24
25#define mpz_size1(A) (ABS((A)->_mp_size))
26//#define mpz_size1(A) mpz_size(A)
27
28struct snumber;
29typedef struct snumber  *number;
30struct snumber
31{
32  lint z;
33  lint n;
34#if defined(LDEBUG)
35  int debug;
36#endif
37  BOOLEAN s;
38};
39
40// allow inlining only from p_Numbers.h and if ! LDEBUG
41
42#if defined(DO_LINLINE) && defined(P_NUMBERS_H) && !defined(LDEBUG)
43#define LINLINE static inline
44#else
45#define LINLINE
46#undef DO_LINLINE
47#endif // DO_LINLINE
48
49LINLINE BOOLEAN  nlEqual(number a, number b);
50LINLINE number   nlInit(int i);
51number nlRInit (int i);
52LINLINE BOOLEAN  nlIsOne(number a);
53LINLINE BOOLEAN  nlIsZero(number za);
54LINLINE number   nlCopy(number a);
55LINLINE void     nlNew(number *r);
56LINLINE void     nlDelete(number *a, const ring r);
57LINLINE number   nlNeg(number za);
58LINLINE number   nlAdd(number la, number li);
59LINLINE number   nlSub(number la, number li);
60LINLINE number   nlMult(number a, number b);
61
62number   nlInit2 (int i, int j);
63number   nlInit2gmp (mpz_t i, mpz_t j);
64number   nlGcd(number a, number b, const ring r);
65number   nlLcm(number a, number b, const ring r);   /*special routine !*/
66BOOLEAN  nlGreater(number a, number b);
67BOOLEAN  nlIsMOne(number a);
68int      nlInt(number &n);
69number   nlBigInt(number &n);
70#ifdef HAVE_RINGS
71void     nlGMP(number &i, number n);
72#endif
73BOOLEAN  nlGreaterZero(number za);
74number   nlInvers(number a);
75void     nlNormalize(number &x);
76number   nlDiv(number a, number b);
77number   nlExactDiv(number a, number b);
78number   nlIntDiv(number a, number b);
79number   nlIntMod(number a, number b);
80void     nlPower(number x, int exp, number *lu);
81const char *   nlRead (const char *s, number *a);
82void     nlWrite(number &a);
83int      nlModP(number n, int p);
84int      nlSize(number n);
85number   nlGetDenom(number &n, const ring r);
86number   nlGetNom(number &n, const ring r);
87number   nlChineseRemainder(number *x, number *q,int rl);
88#ifdef LDEBUG
89BOOLEAN  nlDBTest(number a, const char *f, const int l);
90#endif
91extern number nlOne;
92
93nMapFunc nlSetMap(ring src, ring dst);
94#ifdef HAVE_RINGS
95number nlMapGMP(number from);
96#endif
97
98#ifndef OM_ALLOC_H
99struct omBin_s;
100#endif
101extern omBin_s* rnumber_bin;
102
103// in-place operations
104void nlInpGcd(number &a, number b, const ring r);
105void nlInpIntDiv(number &a, number b, const ring r);
106void nlInpAdd_(number &a, number b, const ring r);
107LINLINE number   nlInpAdd(number la, number li, const ring r);
108void nlInpMult(number &a, number b, ring r);
109
110#ifdef LDEBUG
111#define nlTest(a) nlDBTest(a,__FILE__,__LINE__)
112BOOLEAN nlDBTest(number a, char *f,int l);
113#else
114#define nlTest(a) ((void)0)
115#endif
116
117#endif
118
119
Note: See TracBrowser for help on using the repository browser.