source: git/kernel/numbers.h @ 873b57

spielwiese
Last change on this file since 873b57 was 873b57, checked in by Hans Schönemann <hannes@…>, 15 years ago
*hannes: removed n__Delete git-svn-id: file:///usr/local/Singular/svn/trunk@12137 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 4.0 KB
Line 
1#ifndef NUMBERS_H
2#define NUMBERS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: numbers.h,v 1.21 2009-09-28 13:29:03 Singular Exp $ */
7/*
8* ABSTRACT: interface to coefficient aritmetics
9*/
10#include "structs.h"
11
12#define n_Copy(n, r)          (r)->cf->cfCopy(n,r)
13#define n_Delete(n, r)        (r)->cf->cfDelete(n,r)
14#define n_Mult(n1, n2, r)     (r)->cf->nMult(n1, n2)
15#define n_Add(n1, n2, r)      (r)->cf->nAdd(n1, n2)
16#define n_IsZero(n, r)        (r)->cf->nIsZero(n)
17#define n_Equal(n1, n2, r)    (r)->cf->nEqual(n1, n2)
18#define n_Neg(n, r)           (r)->cf->nNeg(n)
19#define n_Sub(n1, n2, r)      (r)->cf->nSub(n1, n2)
20//#define n_GetChar(r)          ((r)->cf->nChar)
21#define n_GetChar(r)          ((r)->ch)
22#define n_Init(i, r)          (r)->cf->cfInit(i,r)
23#define n_IsOne(n, r)         (r)->cf->nIsOne(n)
24#define n_IsMOne(n, r)        (r)->cf->nIsMOne(n)
25#define n_GreaterZero(n, r)   (r)->cf->nGreaterZero(n)
26#define n_Write(n, r)         (r)->cf->nWrite(n)
27#define n_Normalize(n, r)     (r)->cf->nNormalize(n)
28#define n_Gcd(a, b, r)        (r)->cf->nGcd(a,b,r)
29#define n_IntDiv(a, b, r)     (r)->cf->nIntDiv(a,b)
30#define n_Div(a, b, r)        (r)->cf->nDiv(a,b)
31#define n_ExactDiv(a, b, r)   (r)->cf->nExactDiv(a,b)
32#define n_Test(a,r)           (r)->cf->nDBTest(a,__FILE__,__LINE__)
33
34#define n_InpMult(a, b, r)    (r)->cf->nInpMult(a,b,r)
35#define n_Power(a, b, res, r) (r)->cf->nPower(a,b,res)
36#define n_Size(n,r)           (r)->cf->nSize(n)
37#define n_GetDenom(N,r)       (r)->cf->cfGetDenom((N),r)
38#define n_GetNumerator(N,r)   (r)->cf->cfGetNumerator((N),r)
39
40#define n_New(n, r)           (r)->cf->nNew(n)
41
42/* variables */
43extern unsigned short fftable[];
44
45/* prototypes */
46extern numberfunc nMult, nSub ,nAdd ,nDiv, nIntDiv, nIntMod, nExactDiv;
47extern void    (*nNew)(number * a);
48extern number  (*nInit_bigint)(number i);
49#define        nInit(i) n_Init(i,currRing)
50extern number  (*nPar)(int i);
51extern int     (*nParDeg)(number n);
52extern int     (*nSize)(number n);
53extern int     (*n_Int)(number &n, const ring r);
54#ifdef HAVE_RINGS
55extern int     (*nDivComp)(number a,number b);
56extern BOOLEAN (*nIsUnit)(number a);
57extern number  (*nGetUnit)(number a);
58extern number  (*nExtGcd)(number a, number b, number *s, number *t);
59#endif
60// always use in the form    n=nNeg(n) !
61extern number  (*nNeg)(number a);
62extern number  (*nInvers)(number a);
63extern number  (*nCopy)(number a);
64extern number  (*nRePart)(number a);
65extern number  (*nImPart)(number a);
66extern void    (*nWrite)(number &a);
67extern const char *  (*nRead)(const char * s, number * a);
68extern void    (*nNormalize)(number &a);
69extern BOOLEAN (*nGreater)(number a,number b),
70#ifdef HAVE_RINGS
71               (*nDivBy)(number a,number b),
72#endif
73               (*nEqual)(number a,number b),
74               (*nIsZero)(number a),
75               (*nIsOne)(number a),
76               (*nIsMOne)(number a),
77               (*nGreaterZero)(number a);
78extern void    (*nPower)(number a, int i, number * result);
79extern number (*nGcd)(number a, number b, const ring r);
80extern number (*nLcm)(number a, number b, const ring r);
81
82extern number nNULL; /* the 0 as constant */
83
84#define nTest(a) (1)
85#define nDelete(A) (currRing)->cf->cfDelete(A,currRing)
86#define nGetDenom(N) (currRing->cf->cfGetDenom((N),currRing))
87#define nGetNumerator(N) (currRing->cf->cfGetNumerator((N),currRing))
88
89#define nSetMap(R) (currRing->cf->cfSetMap(R,currRing))
90extern char *  (*nName)(number n);
91
92void nDummy1(number* d);
93void ndDelete(number* d, const ring r);
94void nDummy2(number &d);
95number ndGcd(number a, number b, const ring);
96number ndCopy(number a);
97void   ndInpMult(number &a, number b, const ring r);
98number ndInpAdd(number &a, number b, const ring r);
99
100#ifdef LDEBUG
101void nDBDummy1(number* d,char *f, int l);
102#endif
103#define nGetChar() n_GetChar(currRing)
104
105void nInitChar(ring r);
106void nKillChar(ring r);
107void nSetChar(ring r);
108
109#define nDivBy0 "div by 0"
110
111// dummy routines
112void   nDummy2(number& d); // nNormalize...
113#endif
Note: See TracBrowser for help on using the repository browser.