| 1 | #ifndef LONGALG_H |
|---|
| 2 | #define LONGALG_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id$ */ |
|---|
| 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 | struct slnumber |
|---|
| 18 | { |
|---|
| 19 | napoly z; |
|---|
| 20 | napoly n; |
|---|
| 21 | BOOLEAN s; |
|---|
| 22 | }; |
|---|
| 23 | |
|---|
| 24 | extern napoly naMinimalPoly; |
|---|
| 25 | extern ring nacRing; |
|---|
| 26 | |
|---|
| 27 | |
|---|
| 28 | void naSetChar(int p, ring r); |
|---|
| 29 | void naDelete (number *p, const ring r); |
|---|
| 30 | number naInit(int i, const ring r); /* z := i */ |
|---|
| 31 | number naPar(int i); /* z := par(i) */ |
|---|
| 32 | int naParDeg(number n); /* i := deg(n) */ |
|---|
| 33 | int naSize(number n); /* size desc. */ |
|---|
| 34 | int naInt(number &n, const ring r); |
|---|
| 35 | void naNew(number *z); |
|---|
| 36 | BOOLEAN naIsZero(number za); /* za = 0 ? */ |
|---|
| 37 | BOOLEAN naIsOne(number za); /* za = 1 ? */ |
|---|
| 38 | BOOLEAN naIsMOne(number za); /* za = -1 ? */ |
|---|
| 39 | BOOLEAN naEqual(number a, number b); /* a = b ? */ |
|---|
| 40 | BOOLEAN naGreater(number a, number b); /* dummy */ |
|---|
| 41 | number naNeg(number za); /* za := - za */ |
|---|
| 42 | number naInvers(number a); |
|---|
| 43 | void naPower(number x, int exp, number *lo); |
|---|
| 44 | BOOLEAN naGreaterZero(number a); |
|---|
| 45 | number naCopy(number p); /* erg:= p */ |
|---|
| 46 | number na_Copy(number p, const ring r); /* erg:= p */ |
|---|
| 47 | number naAdd(number la, number li); /* lu := la+li */ |
|---|
| 48 | number naMult(number la, number li); /* lo := la*li */ |
|---|
| 49 | number naDiv(number la, number li); /* lo := la/li */ |
|---|
| 50 | number naIntDiv(number la, number li); /* lo := la/li */ |
|---|
| 51 | //number naIntMod(number la, number li); /* lo := la/li */ |
|---|
| 52 | number naSub(number la, number li); /* lu := la-li */ |
|---|
| 53 | void naNormalize(number &p); |
|---|
| 54 | number naGcd(number a, number b, const ring r); |
|---|
| 55 | number naLcm(number a, number b, const ring r); |
|---|
| 56 | const char * naRead(const char * s, number * p); |
|---|
| 57 | void naWrite(number &p); |
|---|
| 58 | char * naName(number n); |
|---|
| 59 | nMapFunc naSetMap(ring src, ring dst); |
|---|
| 60 | number naMap0P(number c); |
|---|
| 61 | number naMap00(number c); |
|---|
| 62 | #ifdef LDEBUG |
|---|
| 63 | BOOLEAN naDBTest(number a, const char *f,const int l); |
|---|
| 64 | #endif |
|---|
| 65 | |
|---|
| 66 | void naSetIdeal(ideal I); |
|---|
| 67 | |
|---|
| 68 | // external access to the interna |
|---|
| 69 | poly naPermNumber(number z, int * par_perm, int P, ring r); |
|---|
| 70 | #define napAddExp(p,i,e) (p_AddExp(p,i,e,currRing->algring)) |
|---|
| 71 | #define napLength(p) pLength(p) |
|---|
| 72 | #define napNeg(p) (p_Neg(p,currRing->algring)) |
|---|
| 73 | #define napVariables naNumbOfPar |
|---|
| 74 | #define napGetCoeff(p) pGetCoeff(p) |
|---|
| 75 | #define napGetExpFrom(p,i,r) (p_GetExp(p,i,r->algring)) |
|---|
| 76 | #define napSetExp(p,i,e) (p_SetExp(p,i,e,currRing->algring)) |
|---|
| 77 | #define napNew() (p_Init(currRing->algring)) |
|---|
| 78 | #define napAdd(p1,p2) (p_Add_q(p1,p2,currRing->algring)) |
|---|
| 79 | #define napSetm(p) p_Setm(p,currRing->algring) |
|---|
| 80 | #define nanumber lnumber |
|---|
| 81 | napoly napRemainder(napoly f, const napoly g); |
|---|
| 82 | void napWrite(napoly l,const BOOLEAN denom=TRUE); |
|---|
| 83 | number naGetDenom(number &n, const ring r); |
|---|
| 84 | number naGetNumerator(number &n, const ring r); |
|---|
| 85 | #endif |
|---|
| 86 | |
|---|
