| 1 | #ifndef SPOLYS0_H |
|---|
| 2 | #define SPOLYS0_H |
|---|
| 3 | /**************************************** |
|---|
| 4 | * Computer Algebra System SINGULAR * |
|---|
| 5 | ****************************************/ |
|---|
| 6 | /* $Id: spolys0.h,v 1.11 1999-09-27 14:43:44 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) pMonAddFast(a,m) |
|---|
| 20 | #define spMonSub(a,m) pMonSubFast(a,m) |
|---|
| 21 | |
|---|
| 22 | void spModuleToPoly(poly a1); |
|---|
| 23 | |
|---|
| 24 | /* reduction */ |
|---|
| 25 | poly spGSpolyRed(poly p1, poly p2,poly spNoether, |
|---|
| 26 | spSpolyLoopProc spSpolyLoop); |
|---|
| 27 | void spGSpolyTail(poly p1, poly q, poly q2, poly spNoether, |
|---|
| 28 | spSpolyLoopProc spSpolyLoop); |
|---|
| 29 | poly spGSpolyRedNew(poly p1, poly p2,poly spNoether, |
|---|
| 30 | spSpolyLoopProc spSpolyLoop); |
|---|
| 31 | |
|---|
| 32 | /* s-polynomial */ |
|---|
| 33 | poly spGSpolyCreate(poly p1, poly p2,poly spNoether, |
|---|
| 34 | spSpolyLoopProc spSpolyLoop); |
|---|
| 35 | |
|---|
| 36 | /* short s-polynomial for ordering in Bba and Mora */ |
|---|
| 37 | poly spGSpolyShortBba(poly p1, poly p2); |
|---|
| 38 | //poly spGSpolyShortMora(poly p1, poly p2, int *ecart); |
|---|
| 39 | |
|---|
| 40 | extern void spMultCopyX(poly p, poly m, poly n, number exp, poly spNoether); |
|---|
| 41 | extern void spGMultCopyX(poly p, poly m, poly n, number exp, poly spNoether); |
|---|
| 42 | |
|---|
| 43 | #endif |
|---|
| 44 | |
|---|
