| 1 | #ifndef RING_H |
|---|
| 2 | #define RING_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* |
|---|
| 7 | * ABSTRACT - the interpreter related ring operations |
|---|
| 8 | */ |
|---|
| 9 | /* $Id: ring.h,v 1.12 1998-04-03 17:38:42 Singular Exp $ */ |
|---|
| 10 | |
|---|
| 11 | /* includes */ |
|---|
| 12 | #include "structs.h" |
|---|
| 13 | #include "polys-impl.h" |
|---|
| 14 | |
|---|
| 15 | void rChangeCurrRing(ring r, BOOLEAN complete = TRUE); |
|---|
| 16 | void rSetHdl(idhdl h, BOOLEAN complete); |
|---|
| 17 | idhdl rInit(char *s, sleftv* pn, sleftv* rv, sleftv* ord, |
|---|
| 18 | BOOLEAN isDRing); |
|---|
| 19 | idhdl rDefault(char *s); |
|---|
| 20 | int rIsRingVar(char *n); |
|---|
| 21 | char * RingVar(short); |
|---|
| 22 | void rWrite(ring r); |
|---|
| 23 | void rKill(idhdl h); |
|---|
| 24 | void rKill(ring r); |
|---|
| 25 | ring rCopy(ring r); |
|---|
| 26 | idhdl rFindHdl(ring r, idhdl n); |
|---|
| 27 | #ifdef DRING |
|---|
| 28 | void rDSet(); |
|---|
| 29 | #endif |
|---|
| 30 | void rDInit(); |
|---|
| 31 | int rOrderName(char * ordername); |
|---|
| 32 | char * rOrdStr(ring r); |
|---|
| 33 | char * rVarStr(ring r); |
|---|
| 34 | char * rCharStr(ring r); |
|---|
| 35 | char * rString(ring r); |
|---|
| 36 | int rChar(ring r=currRing); |
|---|
| 37 | #define rPar(r) (r->P) |
|---|
| 38 | char * rParStr(ring r); |
|---|
| 39 | int rIsExtension(ring r); |
|---|
| 40 | int rIsExtension(); |
|---|
| 41 | int rSum(ring r1, ring r2, ring &sum); |
|---|
| 42 | void rComplete(ring r); |
|---|
| 43 | |
|---|
| 44 | |
|---|
| 45 | enum |
|---|
| 46 | { |
|---|
| 47 | ringorder_no = 0, |
|---|
| 48 | ringorder_a, |
|---|
| 49 | ringorder_c, |
|---|
| 50 | ringorder_C, |
|---|
| 51 | ringorder_M, |
|---|
| 52 | ringorder_lp, |
|---|
| 53 | ringorder_dp, |
|---|
| 54 | ringorder_Dp, |
|---|
| 55 | ringorder_wp, |
|---|
| 56 | ringorder_Wp, |
|---|
| 57 | ringorder_ls, |
|---|
| 58 | ringorder_ds, |
|---|
| 59 | ringorder_Ds, |
|---|
| 60 | ringorder_ws, |
|---|
| 61 | ringorder_Ws, |
|---|
| 62 | ringorder_unspec |
|---|
| 63 | }; |
|---|
| 64 | |
|---|
| 65 | typedef enum rOrderType_t |
|---|
| 66 | { |
|---|
| 67 | rOrderType_General = 0, // non-simple ordering as specified by currRing |
|---|
| 68 | rOrderType_CompExp, // simple ordering, component has priority |
|---|
| 69 | rOrderType_ExpComp, // simple ordering, exponent vector has priority |
|---|
| 70 | // component not compatible with exp-vector order |
|---|
| 71 | rOrderType_Exp, // simple ordering, exponent vector has priority |
|---|
| 72 | // component is compatible with exp-vector order |
|---|
| 73 | rOrderType_Syz, // syzygy ordering |
|---|
| 74 | rOrderType_Schreyer // Schreyer ordering |
|---|
| 75 | } rOrderType_t; |
|---|
| 76 | |
|---|
| 77 | BOOLEAN rHasSimpleOrder(ring r); |
|---|
| 78 | // returns TRUE, if simple lp or ls ordering |
|---|
| 79 | BOOLEAN rHasSimpleLexOrder(ring r); |
|---|
| 80 | rOrderType_t rGetOrderType(ring r); |
|---|
| 81 | |
|---|
| 82 | #ifdef RDEBUG |
|---|
| 83 | extern short rNumber; /* current ring id (r->no) */ |
|---|
| 84 | #endif |
|---|
| 85 | |
|---|
| 86 | #endif |
|---|
| 87 | |
|---|
