source: git/kernel/numbers.h @ 35aab3

spielwiese
Last change on this file since 35aab3 was 35aab3, checked in by Hans Schönemann <hannes@…>, 21 years ago
This commit was generated by cvs2svn to compensate for changes in r6879, which included commits to RCS files with non-trunk default branches. git-svn-id: file:///usr/local/Singular/svn/trunk@6880 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 3.0 KB
Line 
1#ifndef NUMBERS_H
2#define NUMBERS_H
3/****************************************
4*  Computer Algebra System SINGULAR     *
5****************************************/
6/* $Id: numbers.h,v 1.1.1.1 2003-10-06 12:15:58 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->nInit(i)
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_InpMult(a, b, r)    (r)->cf->nInpMult(a,b,r)
31
32/* variables */
33extern short fftable[];
34
35/* prototypes */
36extern numberfunc nMult, nSub ,nAdd ,nDiv, nIntDiv, nIntMod, nExactDiv;
37extern void    (*nNew)(number * a);
38extern number  (*nInit)(int i);
39extern number  (*nPar)(int i);
40extern int     (*nParDeg)(number n);
41extern int     (*nSize)(number n);
42extern int     (*nInt)(number &n);
43extern number  (*nNeg)(number a);
44extern number  (*nInvers)(number a);
45extern number  (*nCopy)(number a);
46extern number  (*nRePart)(number a);
47extern number  (*nImPart)(number a);
48extern void    (*nWrite)(number &a);
49extern char *  (*nRead)(char * s, number * a);
50extern void    (*nNormalize)(number &a);
51extern BOOLEAN (*nGreater)(number a,number b),
52               (*nEqual)(number a,number b),
53               (*nIsZero)(number a),
54               (*nIsOne)(number a),
55               (*nIsMOne)(number a),
56               (*nGreaterZero)(number a);
57extern void    (*nPower)(number a, int i, number * result);
58extern number (*nGcd)(number a, number b, const ring r);
59extern number (*nLcm)(number a, number b, const ring r);
60
61extern number nNULL; /* the 0 as constant */
62
63extern void    (*n__Delete)(number * a, const ring r);
64#define nTest(a) (1)
65#define nDelete(A) (currRing)->cf->cfDelete(A,currRing)
66#define nGetDenom(N) (currRing->cf->n_GetDenom((N),currRing))
67
68#define nSetMap(R) (currRing->cf->cfSetMap(R,currRing))
69extern char *  (*nName)(number n);
70
71void nDummy1(number* d);
72void ndDelete(number* d, const ring r);
73void nDummy2(number &d);
74number ndGcd(number a, number b, const ring);
75number ndCopy(number a);
76void   ndInpMult(number &a, number b, const ring r);
77
78#ifdef LDEBUG
79void nDBDummy1(number* d,char *f, int l);
80#endif
81#define nGetChar() n_GetChar(currRing)
82
83void nInitChar(ring r);
84void nKillChar(ring r);
85void nSetChar(ring r);
86
87#endif
Note: See TracBrowser for help on using the repository browser.