source: git/libpolys/coeffs/numbers.h @ 0ef3f51

spielwiese
Last change on this file since 0ef3f51 was 0ef3f51, checked in by Hans Schoenemann <hannes@…>, 13 years ago
moved compatiblity stuff to number.h moved public stuff (tersts) to coeffs.h
  • Property mode set to 100644
File size: 3.1 KB
Line 
1#ifndef NUMBERS_H
2#define NUMBERS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id$ */
7/*
8* ABSTRACT: compatility interface to coeffs
9*/
10#include <coeffs/coeffs.h>
11
12// the access methods
13//
14// the routines w.r.t. currRing:
15// (should only be used in the context of currRing, i.e. in t
16#define nCopy(n)          n_Copy(n, currRing->cf)
17#define nDelete(n)        n_Delete(n, currRing->cf)
18#define nMult(n1, n2)     n_Mult(n1, n2, currRing->cf)
19#define nAdd(n1, n2)      n_Add(n1, n2, currRing->cf)
20#define nIsZero(n)        n_IsZero(n, currRing->cf)
21#define nEqual(n1, n2)    n_Equal(n1, n2, currRing->cf)
22#define nNeg(n)           n_Neg(n, currRing->cf)
23#define nSub(n1, n2)      n_Sub(n1, n2, currRing->cf)
24#define nGetChar()        nInternalChar(currRing->cf)
25#define nInit(i)          n_Init(i, currRing->cf)
26#define nIsOne(n)         n_IsOne(n, currRing->cf)
27#define nIsMOne(n)        n_IsMOne(n, currRing->cf)
28#define nGreaterZero(n)   n_GreaterZero(n, currRing->cf)
29#define nWrite(n)         n_Write(n,currRing->cf)
30#define nNormalize(n)     n_Normalize(n,currRing->cf)
31#define nGcd(a, b)        n_Gcd(a,b,currRing->cf)
32#define nIntDiv(a, b)     n_IntDiv(a,b,currRing->cf)
33#define nDiv(a, b)        n_Div(a,b,currRing->cf)
34#define nInvers(a)        n_Invers(a,currRing->cf)
35#define nExactDiv(a, b)   n_ExactDiv(a,b,currRing->cf)
36#define nTest(a)          n_Test(a,currRing->cf)
37
38#define nInpMult(a, b)    n_InpMult(a,b,currRing->cf)
39#define nPower(a, b, res) n_Power(a,b,res,currRing->cf)
40#define nSize(n)          n_Size(n,currRing->cf)
41#define nGetDenom(N)      n_GetDenom((N),currRing->cf)
42#define nGetNumerator(N)  n_GetNumerator((N),currRing->cf)
43
44#define nSetMap(R)        n_SetMap(R,currRing->cf)
45
46
47// --------------------------------------------------------------
48// internal to coeffs, but public for all realizations
49
50#define SHORT_REAL_LENGTH 6 // use short reals for real <= 6 digits
51
52/* the dummy routines: */
53void nDummy1(number* d);
54void ndDelete(number* d, const coeffs r);
55number ndGcd(number a, number b, const coeffs);
56number ndCopy(number a, const coeffs r);
57number ndCopyMap(number a, const coeffs src, const coeffs dst);
58int ndSize(number a, const coeffs r);
59char * ndName(number n, const coeffs r);
60number ndPar(int i, const coeffs r);
61int    ndParDeg(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
70#ifdef LDEBUG
71void nDBDummy1(number* d,char *f, int l);
72BOOLEAN ndDBTest(number a, const char *f, const int l, const coeffs r);
73#endif
74
75#define nDivBy0 "div by 0"
76
77// dummy routines
78void   ndNormalize(number& d, const coeffs); // nNormalize...
79
80/// initialize an object of type coeff, return FALSE in case of success
81typedef BOOLEAN (*cfInitCharProc)(coeffs, void *);
82n_coeffType nRegister(n_coeffType n, cfInitCharProc p);
83
84#endif
Note: See TracBrowser for help on using the repository browser.