1 | #ifndef SPOLYS0_H |
---|
2 | #define SPOLYS0_H |
---|
3 | /**************************************** |
---|
4 | * Computer Algebra System SINGULAR * |
---|
5 | ****************************************/ |
---|
6 | /* $Id: spolys0.h,v 1.9 1998-03-23 22:51:10 obachman Exp $ */ |
---|
7 | /* |
---|
8 | * ABSTRACT: s-polynomials, internal header |
---|
9 | */ |
---|
10 | #include "polys.h" |
---|
11 | #include "binom.h" |
---|
12 | #include "polys-impl.h" |
---|
13 | #include "spSpolyLoop.h" |
---|
14 | |
---|
15 | |
---|
16 | #define spMemcpy(A,B) pCopy2(A,B) |
---|
17 | |
---|
18 | |
---|
19 | #define spMonAdd(a,m) \ |
---|
20 | {for(int ii=pVarLowIndex; ii<=pVarHighIndex; ii++) (a)->exp[ii] += (m)->exp[ii];\ |
---|
21 | pGetOrder(a) += pGetOrder(m);} |
---|
22 | #define spMonSub(a,b) \ |
---|
23 | {for(int ii=pVarLowIndex; ii<=pVarHighIndex; ii++) (a)->exp[ii] -= (b)->exp[ii];\ |
---|
24 | pGetOrder(a) -= pGetOrder(b);} |
---|
25 | |
---|
26 | void spModuleToPoly(poly a1); |
---|
27 | |
---|
28 | /* reduction */ |
---|
29 | poly spGSpolyRed(poly p1, poly p2,poly spNoether, |
---|
30 | spSpolyLoopProc spSpolyLoop); |
---|
31 | void spGSpolyTail(poly p1, poly q, poly q2, poly spNoether, |
---|
32 | spSpolyLoopProc spSpolyLoop); |
---|
33 | poly spGSpolyRedNew(poly p1, poly p2,poly spNoether, |
---|
34 | spSpolyLoopProc spSpolyLoop); |
---|
35 | |
---|
36 | /* s-polynomial */ |
---|
37 | poly spGSpolyCreate(poly p1, poly p2,poly spNoether); |
---|
38 | |
---|
39 | /* short s-polynomial for ordering in Bba and Mora */ |
---|
40 | poly spGSpolyShortBba(poly p1, poly p2); |
---|
41 | //poly spGSpolyShortMora(poly p1, poly p2, int *ecart); |
---|
42 | |
---|
43 | extern void spMultCopyX(poly p, poly m, poly n, number exp, poly spNoether); |
---|
44 | extern void spGMultCopyX(poly p, poly m, poly n, number exp, poly spNoether); |
---|
45 | |
---|
46 | #endif |
---|
47 | |
---|