source: git/libpolys/coeffs/numbers.h @ 45cc512

spielwiese
Last change on this file since 45cc512 was 6ce030f, checked in by Oleksandr Motsak <motsak@…>, 12 years ago
removal of the $Id$ svn tag from everywhere NOTE: the git SHA1 may be used instead (only on special places) NOTE: the libraries Singular/LIB/*.lib still contain the marker due to our current use of svn
  • Property mode set to 100644
File size: 3.8 KB
Line 
1#ifndef NUMBERS_H
2#define NUMBERS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/*
7* ABSTRACT: compatility interface to coeffs
8*/
9#include <coeffs/coeffs.h>
10
11// the access methods
12//
13// the routines w.r.t. currRing:
14// (should only be used in the context of currRing, i.e. in t
15#define nCopy(n)          n_Copy(n, currRing->cf)
16#define nDelete(n)        n_Delete(n, currRing->cf)
17#define nMult(n1, n2)     n_Mult(n1, n2, currRing->cf)
18#define nAdd(n1, n2)      n_Add(n1, n2, currRing->cf)
19#define nIsZero(n)        n_IsZero(n, currRing->cf)
20#define nEqual(n1, n2)    n_Equal(n1, n2, currRing->cf)
21#define nNeg(n)           n_Neg(n, currRing->cf)
22#define nSub(n1, n2)      n_Sub(n1, n2, currRing->cf)
23#define nGetChar()        n_GetChar(currRing->cf)
24#define nInit(i)          n_Init(i, currRing->cf)
25#define nIsOne(n)         n_IsOne(n, currRing->cf)
26#define nIsMOne(n)        n_IsMOne(n, currRing->cf)
27#define nGreaterZero(n)   n_GreaterZero(n, currRing->cf)
28#define nGreater(a, b)    n_Greater (a,b,currRing->cf)
29#define nWrite(n)         n_Write(n, currRing->cf, rShortOut(currRing))
30#define nNormalize(n)     n_Normalize(n,currRing->cf)
31
32inline number nGcd(number a, number b, const coeffs cf) { return n_Gcd(a, b, cf); }
33
34#define nIntDiv(a, b)     n_IntDiv(a,b,currRing->cf)
35#define nDiv(a, b)        n_Div(a,b,currRing->cf)
36#define nInvers(a)        n_Invers(a,currRing->cf)
37#define nExactDiv(a, b)   n_ExactDiv(a,b,currRing->cf)
38#define nTest(a)          n_Test(a,currRing->cf)
39
40#define nInpMult(a, b)    n_InpMult(a,b,currRing->cf)
41#define nPower(a, b, res) n_Power(a,b,res,currRing->cf)
42#define nSize(n)          n_Size(n,currRing->cf)
43#define nGetDenom(N)      n_GetDenom((N),currRing->cf)
44#define nGetNumerator(N)  n_GetNumerator((N),currRing->cf)
45
46#define nSetMap(R)        n_SetMap(R,currRing->cf)
47
48
49// --------------------------------------------------------------
50// internal to coeffs, but public for all realizations
51
52#define SHORT_REAL_LENGTH 6 // use short reals for real <= 6 digits
53
54/* the dummy routines: */
55void nDummy1(number* d);
56void ndDelete(number* d, const coeffs r);
57number ndGcd(number a, number b, const coeffs);
58number ndCopy(number a, const coeffs r);
59number ndCopyMap(number a, const coeffs src, const coeffs dst);
60int ndSize(number a, const coeffs r);
61char * ndName(number n, const coeffs r);
62number ndGetDenom(number &n, const coeffs r);
63number ndGetNumerator(number &a,const coeffs r);
64number ndReturn0(number n, const coeffs r);
65number ndIntMod(number a, number b, const coeffs r);
66
67void   ndInpMult(number &a, number b, const coeffs r);
68void   ndInpAdd(number &a, number b, const coeffs r);
69
70void ndKillChar(coeffs);
71
72number  ndInit_bigint(number i, const coeffs dummy, const coeffs dst);
73
74BOOLEAN ndCoeffIsEqual(const coeffs r, n_coeffType n, void * parameter);
75
76/// Test whether a is a zero divisor in r
77/// i.e. not coprime with char. of r
78/// very inefficient implementation:
79/// should ONLY be used for debug stuff /tests
80BOOLEAN n_IsZeroDivisor( number a, const coeffs r);
81
82#ifdef LDEBUG
83void nDBDummy1(number* d,char *f, int l);
84BOOLEAN ndDBTest(number a, const char *f, const int l, const coeffs r);
85#endif
86
87#define nDivBy0 "div by 0"
88
89// dummy routines
90void   ndNormalize(number& d, const coeffs); // nNormalize...
91
92/// initialize an object of type coeff, return FALSE in case of success
93typedef BOOLEAN (*cfInitCharProc)(coeffs, void *);
94n_coeffType nRegister(n_coeffType n, cfInitCharProc p);
95
96/// divide by the first (leading) number and return it, i.e. make monic
97void ndClearContent(ICoeffsEnumerator& numberCollectionEnumerator, number& c, const coeffs r);
98
99/// does nothing (just returns a dummy one number)
100void ndClearDenominators(ICoeffsEnumerator& numberCollectionEnumerator, number& d, const coeffs r);
101
102#endif
Note: See TracBrowser for help on using the repository browser.