1 | #ifndef LONGALG_H |
---|
2 | #define LONGALG_H |
---|
3 | /**************************************** |
---|
4 | * Computer Algebra System SINGULAR * |
---|
5 | ****************************************/ |
---|
6 | /* $Id: longalg.h,v 1.3 2004-09-28 09:36:49 Singular Exp $ */ |
---|
7 | /* |
---|
8 | * ABSTRACT: algebraic numbers |
---|
9 | */ |
---|
10 | #include "structs.h" |
---|
11 | #include "longrat.h" |
---|
12 | #include "polys-impl.h" |
---|
13 | |
---|
14 | struct slnumber; |
---|
15 | typedef struct slnumber * lnumber; |
---|
16 | |
---|
17 | #ifndef LONGALGNEW |
---|
18 | //make parameter type same as exponent type |
---|
19 | #define PARAMETER_TYPE short |
---|
20 | #define SIZEOF_PARAMETER SIZEOF_SHORT |
---|
21 | |
---|
22 | struct reca |
---|
23 | { |
---|
24 | napoly ne; |
---|
25 | number ko; |
---|
26 | PARAMETER_TYPE e[1]; |
---|
27 | }; |
---|
28 | #endif /* not LONGALGNEW */ |
---|
29 | |
---|
30 | struct slnumber |
---|
31 | { |
---|
32 | napoly z; |
---|
33 | napoly n; |
---|
34 | BOOLEAN s; |
---|
35 | }; |
---|
36 | |
---|
37 | extern int naNumbOfPar; /* maximal number of parameters */ |
---|
38 | extern napoly naMinimalPoly; |
---|
39 | #ifndef LONGALGNEW |
---|
40 | extern char **naParNames; |
---|
41 | extern int napMonomSize; |
---|
42 | #endif /* LONGALGNEW */ |
---|
43 | |
---|
44 | void naSetChar(int p, ring r); |
---|
45 | #ifndef LONGALGNEW |
---|
46 | #define napAddExp(P,I,E) ((P)->e[I-1]+=(E)) |
---|
47 | #define napLength(p) pLength((poly)p) |
---|
48 | napoly napNeg(napoly a); |
---|
49 | #endif /* LONGALGNEW */ |
---|
50 | void naDelete (number *p, const ring r); |
---|
51 | number naInit(int i); /* z := i */ |
---|
52 | number naPar(int i); /* z := par(i) */ |
---|
53 | int naParDeg(number n); /* i := deg(n) */ |
---|
54 | int naSize(number n); /* size desc. */ |
---|
55 | int naInt(number &n); |
---|
56 | void naNumberToInt(number n, int *i); |
---|
57 | void naNew(number *z); |
---|
58 | BOOLEAN naIsZero(number za); /* za = 0 ? */ |
---|
59 | BOOLEAN naIsOne(number za); /* za = 1 ? */ |
---|
60 | BOOLEAN naIsMOne(number za); /* za = -1 ? */ |
---|
61 | BOOLEAN naEqual(number a, number b); /* a = b ? */ |
---|
62 | BOOLEAN naGreater(number a, number b); /* dummy */ |
---|
63 | number naNeg(number za); /* za := - za */ |
---|
64 | number naInvers(number a); |
---|
65 | BOOLEAN naGreaterZero(number a); |
---|
66 | void naPower(number x, int exp, number *lo); |
---|
67 | BOOLEAN naGreaterZero(number a); |
---|
68 | number naCopy(number p); /* erg:= p */ |
---|
69 | number na_Copy(number p, const ring r); /* erg:= p */ |
---|
70 | number naAdd(number la, number li); /* lu := la+li */ |
---|
71 | number naMult(number la, number li); /* lo := la*li */ |
---|
72 | number naDiv(number la, number li); /* lo := la/li */ |
---|
73 | number naIntDiv(number la, number li); /* lo := la/li */ |
---|
74 | //number naIntMod(number la, number li); /* lo := la/li */ |
---|
75 | number naSub(number la, number li); /* lu := la-li */ |
---|
76 | void naNormalize(number &p); |
---|
77 | number naGcd(number a, number b, const ring r); |
---|
78 | number naLcm(number a, number b, const ring r); |
---|
79 | char * naRead(char * s, number * p); |
---|
80 | void naWrite(number &p); |
---|
81 | char * naName(number n); |
---|
82 | nMapFunc naSetMap(ring src, ring dst); |
---|
83 | #ifdef LDEBUG |
---|
84 | BOOLEAN naDBTest(number a, char *f,int l); |
---|
85 | #endif |
---|
86 | |
---|
87 | void naSetIdeal(ideal I); |
---|
88 | |
---|
89 | // external access to the interna |
---|
90 | #ifndef LONGALGNEW |
---|
91 | #define RECA_SIZE (sizeof(napoly)+sizeof(number)) |
---|
92 | napoly napAdd(napoly p1, napoly p2); |
---|
93 | void napDelete(napoly *p); |
---|
94 | void nap_Delete(napoly *p, ring r); |
---|
95 | #endif /* not LONGALGNEW */ |
---|
96 | poly naPermNumber(number z, int * par_perm, int P, ring r); |
---|
97 | #ifndef LONGALGNEW |
---|
98 | #define napVariables naNumbOfPar |
---|
99 | #define napNext(p) (p->ne) |
---|
100 | #define napIter(p) ((p) = (p)->ne) |
---|
101 | #define napGetCoeff(p) (p->ko) |
---|
102 | #define napGetExp(p,i) ((p)->e[(i)-1]) |
---|
103 | #define napGetExpFrom(p,i,r) ((p)->e[(i)-1]) |
---|
104 | #define napSetExp(p,i,ee) ((p)->e[(i)-1]=ee) |
---|
105 | #define napNew() ((napoly)omAlloc0(napMonomSize)) |
---|
106 | #define nanumber lnumber |
---|
107 | #define naGetNom0(na) (((nanumber)(na))->z) |
---|
108 | #define naGetDenom0(na) (((nanumber)(na))->n) |
---|
109 | #else /* LONGALGNEW */ |
---|
110 | #define napAddExp(p,i,e) (p_AddExp(p,i,e,currRing->algring)) |
---|
111 | #define napLength(p) pLength(p) |
---|
112 | #define napNeg(p) (p_Neg(p,currRing->algring)) |
---|
113 | #define napVariables naNumbOfPar |
---|
114 | #define napNext(p) pNext(p) |
---|
115 | #define napIter(p) pIter(p) |
---|
116 | #define napGetCoeff(p) pGetCoeff(p) |
---|
117 | #define napGetExp(p,i) (p_GetExp(p,i,currRing->algring)) |
---|
118 | #define napGetExpFrom(p,i,r) (p_GetExp(p,i,r->algring)) |
---|
119 | #define napSetExp(p,i,e) (p_SetExp(p,i,e,currRing->algring)) |
---|
120 | #define napDelete(p) p_Delete(p, currRing->algring) |
---|
121 | #define nap_Delete(p,r) p_Delete(p, (r)->algring) |
---|
122 | #define napNew() (p_Init(currRing->algring)) |
---|
123 | #define napAdd(p1,p2) (p_Add_q(p1,p2,currRing->algring)) |
---|
124 | #define napSetm(p) p_Setm(p,currRing->algring) |
---|
125 | #define nanumber lnumber |
---|
126 | #define naGetNom0(na) (((nanumber)(na))->z) |
---|
127 | #define naGetDenom0(na) (((nanumber)(na))->n) |
---|
128 | napoly napRemainder(napoly f, const napoly g); |
---|
129 | #endif /* LONGALGNEW */ |
---|
130 | extern number (*nacCopy)(number a); |
---|
131 | extern BOOLEAN (*nacIsZero)(number a); |
---|
132 | extern number (*nacInit)(int i); |
---|
133 | extern void (*nacNormalize)(number &a); |
---|
134 | extern void napWrite(napoly l); |
---|
135 | extern number naGetDenom(number &n, const ring r); |
---|
136 | #endif |
---|
137 | |
---|