1 | #ifndef LONGALG_H |
---|
2 | #define LONGALG_H |
---|
3 | /**************************************** |
---|
4 | * Computer Algebra System SINGULAR * |
---|
5 | ****************************************/ |
---|
6 | /* $Id: longalg.h,v 1.3 1997-04-09 12:19:56 Singular Exp $ */ |
---|
7 | /* |
---|
8 | * ABSTRACT: algebraic numbers |
---|
9 | */ |
---|
10 | #include "longrat.h" |
---|
11 | |
---|
12 | struct reca; |
---|
13 | struct slnumber; |
---|
14 | typedef struct reca * alg; |
---|
15 | typedef struct slnumber * lnumber; |
---|
16 | struct reca |
---|
17 | { |
---|
18 | alg ne; |
---|
19 | number ko; |
---|
20 | int e[1]; |
---|
21 | }; |
---|
22 | struct slnumber |
---|
23 | { |
---|
24 | alg z; |
---|
25 | alg n; |
---|
26 | BOOLEAN s; |
---|
27 | }; |
---|
28 | |
---|
29 | extern int naNumbOfPar; /* maximal number of parameters */ |
---|
30 | extern alg naMinimalPoly; |
---|
31 | extern char **naParNames; |
---|
32 | |
---|
33 | void naSetChar(int p, BOOLEAN complete, char ** param, int pars); |
---|
34 | #ifdef LDEBUG |
---|
35 | void naDBDelete (number *p,char *f, int l); |
---|
36 | #define naDelete(A) naDBDelete(A,__FILE__,__LINE__) |
---|
37 | #else |
---|
38 | void naDelete (number *p); |
---|
39 | #endif |
---|
40 | number naInit(int i); /* z := i */ |
---|
41 | number naPar(int i); /* z := par(i) */ |
---|
42 | int naParDeg(number n); /* i := deg(n) */ |
---|
43 | int naInt(number &n); |
---|
44 | void naNumberToInt(number n, int *i); |
---|
45 | void naNew(number *z); |
---|
46 | BOOLEAN naIsZero(number za); /* za = 0 ? */ |
---|
47 | BOOLEAN naIsOne(number za); /* za = 1 ? */ |
---|
48 | BOOLEAN naIsMOne(number za); /* za = -1 ? */ |
---|
49 | BOOLEAN naEqual(number a, number b); /* a = b ? */ |
---|
50 | BOOLEAN naGreater(number a, number b); /* dummy */ |
---|
51 | number naNeg(number za); /* za := - za */ |
---|
52 | number naInvers(number a); |
---|
53 | BOOLEAN naGreaterZero(number a); |
---|
54 | void naPower(number x, int exp, number *lo); |
---|
55 | BOOLEAN naGreaterZero(number a); |
---|
56 | number naCopy(number p); /* erg:= p */ |
---|
57 | number naAdd(number la, number li); /* lu := la+li */ |
---|
58 | number naMult(number la, number li); /* lo := la*li */ |
---|
59 | number naDiv(number la, number li); /* lo := la/li */ |
---|
60 | number naIntDiv(number la, number li); /* lo := la/li */ |
---|
61 | //number naIntMod(number la, number li); /* lo := la/li */ |
---|
62 | number naSub(number la, number li); /* lu := la-li */ |
---|
63 | void naNormalize(number &p); |
---|
64 | number naGcd(number a, number b); |
---|
65 | number naLcm(number a, number b); |
---|
66 | char * naRead(char * s, number * p); |
---|
67 | void naWrite(number &p); |
---|
68 | char * naName(number n); |
---|
69 | BOOLEAN naSetMap(int c, char ** par, int nop, number minpol); |
---|
70 | #ifdef LDEBUG |
---|
71 | BOOLEAN naDBTest(number a, char *f,int l); |
---|
72 | #endif |
---|
73 | |
---|
74 | void naSetIdeal(ideal I); |
---|
75 | |
---|
76 | // external access to the interna |
---|
77 | #define napoly alg |
---|
78 | #define RECA_SIZE (sizeof(alg)+sizeof(number)) |
---|
79 | alg napAdd(alg p1, alg p2); |
---|
80 | void napDelete(alg *p); |
---|
81 | poly naPermNumber(number z, int * par_perm, int P); |
---|
82 | #define napVariables naNumbOfPar |
---|
83 | #define napNext(p) (p->ne) |
---|
84 | #define napGetCoeff(p) (p->ko) |
---|
85 | #define napGetExp(p,i) (p->e[(i)-1]) |
---|
86 | #define napNew() ((alg)Alloc0(RECA_SIZE + naNumbOfPar * sizeof(int))) |
---|
87 | #define nanumber lnumber |
---|
88 | #define naGetNom(na) (((nanumber)(na))->z) |
---|
89 | #define naGetDenom(na) (((nanumber)(na))->n) |
---|
90 | extern number (*nacCopy)(number a); |
---|
91 | extern BOOLEAN (*nacIsZero)(number a); |
---|
92 | extern number (*nacInit)(int i); |
---|
93 | extern void (*nacNormalize)(number &a); |
---|
94 | |
---|
95 | #endif |
---|
96 | |
---|