[cbc372] | 1 | #ifndef RATGRING_H |
---|
| 2 | #define RATGRING_H |
---|
[2381568] | 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
| 6 | /* |
---|
| 7 | * ABSTRACT additional defines etc for --with-plural |
---|
| 8 | */ |
---|
[ac4b53] | 9 | // #define HAVE_RATGRING to activate |
---|
[2381568] | 10 | |
---|
[ac4b53] | 11 | #ifdef HAVE_RATGRING |
---|
[599326] | 12 | #include <kernel/structs.h> |
---|
[210e07] | 13 | #include <polys/nc/nc.h> |
---|
[2381568] | 14 | |
---|
| 15 | /* MACROS */ |
---|
| 16 | |
---|
[a9c298] | 17 | /* the part, related to the interface */ |
---|
[2381568] | 18 | |
---|
[cbc372] | 19 | /* ring nc_rCreateNCcomm(ring r); */ |
---|
| 20 | |
---|
| 21 | void pLcmRat(poly a, poly b, poly m, int rat_shift); |
---|
| 22 | |
---|
[43cbc0] | 23 | poly p_LcmRat(const poly a, const poly b, const long lCompM, const ring r); |
---|
[cbc372] | 24 | |
---|
| 25 | poly p_GetCoeffRat(poly p, int ishift, ring r); |
---|
| 26 | |
---|
| 27 | poly p_HeadRat(poly p, int ishift, ring r); |
---|
| 28 | |
---|
[9fb610] | 29 | void p_LmDeleteAndNextRat(poly *p, int ishift, ring r); |
---|
| 30 | |
---|
| 31 | void p_ExpVectorDiffRat(poly pr, poly p1, poly p2, int ishift, ring r); |
---|
[cbc372] | 32 | |
---|
[326434] | 33 | ideal ncGCD2(poly p, poly q, ring r); // real nc stuff |
---|
| 34 | |
---|
| 35 | ideal ncGCD(poly p, poly q, ring r); // for p,q from a commutative ring |
---|
[cbc372] | 36 | |
---|
[4732f8] | 37 | poly nc_rat_CreateSpoly(poly p1, poly p2, int ishift, ring r); |
---|
[cbc372] | 38 | |
---|
| 39 | poly nc_rat_ReduceSpolyNew(poly p1, poly p2, int ishift, ring r); |
---|
| 40 | |
---|
[2381568] | 41 | |
---|
| 42 | /* poly functions defined in p_Procs : */ |
---|
[cbc372] | 43 | // poly nc_pp_Mult_mm(poly p, poly m, const ring r, poly &last); |
---|
| 44 | // poly nc_p_Mult_mm(poly p, const poly m, const ring r); |
---|
| 45 | // poly nc_p_Minus_mm_Mult_qq(poly p, const poly m, poly q, const ring r); |
---|
| 46 | // poly nc_p_Minus_mm_Mult_qq_ign(poly p, const poly m, poly q, int & d1, poly d2, const ring ri, poly &d3); |
---|
[2381568] | 47 | |
---|
| 48 | /* other routines we need in addition : */ |
---|
[cbc372] | 49 | // poly nc_p_Mult_mm_Common(poly p, const poly m, int side, const ring r); |
---|
| 50 | // poly nc_mm_Mult_p(const poly m, poly p, const ring r); |
---|
[a9c298] | 51 | // poly nc_mm_Mult_nn (int *F, int *G, const ring r); |
---|
[cbc372] | 52 | // poly nc_mm_Mult_uu (int *F,int jG,int bG, const ring r); |
---|
| 53 | |
---|
| 54 | // /* subst: */ |
---|
| 55 | // poly nc_pSubst(poly p, int n, poly e); |
---|
| 56 | |
---|
| 57 | // /* copy : */ |
---|
| 58 | // poly nc_p_CopyGet(poly a, const ring r); |
---|
| 59 | // poly nc_p_CopyPut(poly a, const ring r); |
---|
| 60 | |
---|
| 61 | // /* syzygies : */ |
---|
| 62 | // /* former nc_spGSpolyCreate */ |
---|
| 63 | // poly nc_CreateSpoly(poly p1, poly p2, poly spNoether, const ring r); |
---|
| 64 | // /* former nc_spGSpolyRed */ |
---|
| 65 | // poly nc_ReduceSpoly(poly p1, poly p2, poly spNoether, const ring r); |
---|
| 66 | // /* former nc_spGSpolyRedNew */ |
---|
| 67 | // poly nc_ReduceSpolyNew(poly p1, poly p2, poly spNoether, const ring r); |
---|
| 68 | // /* former nc_spGSpolyRedTail */ |
---|
| 69 | // void nc_ReduceSpolyTail(poly p1, poly q, poly q2, poly spNoether, const ring r); |
---|
| 70 | // /* former nc_spShort */ |
---|
| 71 | // poly nc_CreateShortSpoly(poly p1, poly p2, const ring r=currRing); |
---|
| 72 | |
---|
| 73 | // ideal gr_bba (ideal F, ideal Q,kStrategy strat); |
---|
| 74 | |
---|
| 75 | // /* brackets: */ |
---|
| 76 | // poly nc_p_Bracket_qq(poly p, poly q); |
---|
| 77 | // poly nc_mm_Bracket_nn(poly m1, poly m2); |
---|
| 78 | |
---|
| 79 | // /* twostd: */ |
---|
| 80 | // ideal twostd(ideal I); |
---|
| 81 | // /* Ann: */ |
---|
| 82 | // ideal Approx_Step(ideal L); |
---|
| 83 | |
---|
| 84 | // /* complete reduction routines */ |
---|
| 85 | |
---|
| 86 | // /* void nc_kBucketPolyRed(kBucket_pt b, poly p); */ |
---|
| 87 | // void nc_kBucketPolyRed(kBucket_pt b, poly p, number *c); |
---|
| 88 | // void nc_kBucketPolyRed_Z(kBucket_pt b, poly p, number *c); |
---|
| 89 | // void nc_PolyPolyRed(poly &b, poly p, number *c); |
---|
| 90 | |
---|
| 91 | // matrix nc_PrintMat(int a, int b, ring r, int metric); |
---|
| 92 | |
---|
| 93 | // poly p_CopyEmbed(poly p, ring srcRing, int shift, int par_shift); |
---|
| 94 | // poly pOppose(ring Rop, poly p); |
---|
| 95 | // ideal idOppose(ring Rop, ideal I); |
---|
| 96 | |
---|
| 97 | // #else |
---|
| 98 | // /* dummy definition to make gcc happy */ |
---|
| 99 | // #define nc_kBucketPolyRed(A,B,C) 0 |
---|
| 100 | // #define nc_PolyPolyRed(A,B,C) 0 |
---|
[2381568] | 101 | |
---|
[fb6d7b] | 102 | // return: FALSE, if there exists i in ishift..r->N, |
---|
| 103 | // such that a->exp[i] > b->exp[i] |
---|
| 104 | // TRUE, otherwise |
---|
| 105 | BOOLEAN p_DivisibleByRat(poly a, poly b, int ishift, const ring r); |
---|
| 106 | |
---|
| 107 | /*2 |
---|
| 108 | *reduces h with elements from reducer choosing the best possible |
---|
| 109 | * element in t with respect to the given red_length |
---|
| 110 | * arrays reducer and red_length are [0..(rl-1)] |
---|
| 111 | */ |
---|
| 112 | int redRat (poly* h,poly *reducer, int *red_length,int rl, int ishift, ring r); |
---|
[f613e44] | 113 | |
---|
| 114 | // Content stuff |
---|
| 115 | |
---|
[4751d7] | 116 | void pContentRat(poly &ph); |
---|
[f613e44] | 117 | |
---|
[0ffc823] | 118 | BOOLEAN p_LmIsConstantRat(const poly p, const ring r); |
---|
| 119 | |
---|
| 120 | BOOLEAN p_LmIsConstantCompRat(const poly p, const ring r); |
---|
| 121 | |
---|
[e044528] | 122 | BOOLEAN pCompareChainPart (poly p,poly p1,poly p2,poly lcm); |
---|
| 123 | |
---|
[2381568] | 124 | #endif /* HAVE_PLURAL */ |
---|
| 125 | #endif |
---|