[35aab3] | 1 | #ifndef POLYS_H |
---|
| 2 | #define POLYS_H |
---|
| 3 | /**************************************** |
---|
| 4 | * Computer Algebra System SINGULAR * |
---|
| 5 | ****************************************/ |
---|
[341696] | 6 | /* $Id$ */ |
---|
[35aab3] | 7 | /* |
---|
| 8 | * ABSTRACT - all basic methods to manipulate polynomials of the |
---|
| 9 | currRing |
---|
| 10 | */ |
---|
| 11 | |
---|
| 12 | #include "p_polys.h" |
---|
| 13 | /* |
---|
| 14 | Some general remarks: |
---|
| 15 | We divide poly operations into roughly 4 categories: |
---|
| 16 | Level 2: operations on monomials/polynomials with constant time, |
---|
| 17 | or operations which are just dispatchers to other |
---|
| 18 | poly routines |
---|
| 19 | - implemented in: pInline2.h |
---|
| 20 | - debugging only if PDEBUG >= 2 |
---|
| 21 | - normally inlined, unless PDEBUG >= 2 || NO_INLINE2 |
---|
| 22 | Level 1: operations on monomials with time proportional to length |
---|
| 23 | - implemented in: pInline1.h |
---|
| 24 | - debugging only if PDEBUG >= 1 |
---|
| 25 | - normally inlined, unless PDEBUG >= 1 || NO_INLINE1 |
---|
| 26 | Level 0: short operations on polynomials with time proportional to |
---|
| 27 | length of poly |
---|
| 28 | - implemented in pInline0.cc |
---|
| 29 | - debugging if PDEBUG |
---|
| 30 | - normally _not_ inlined: can be forced with |
---|
| 31 | #define DO_PINLINE0 |
---|
| 32 | #include "pInline0.h" |
---|
| 33 | Misc : operations on polynomials which do not fit in any of the |
---|
| 34 | above categories |
---|
| 35 | - implemented in: polys*.cc |
---|
| 36 | - never inlined |
---|
| 37 | - debugging if PDEBUG >= 0 |
---|
| 38 | |
---|
| 39 | You can set PDEBUG on a per-file basis, before including "mod2.h" like |
---|
| 40 | #define PDEBUG 2 |
---|
| 41 | #include "mod2.h" |
---|
| 42 | However, PDEBUG will only be in effect, if !NDEBUG. |
---|
| 43 | |
---|
| 44 | All p_* operations take as last argument a ring |
---|
| 45 | and are ring independent. Their corresponding p* operations are usually |
---|
| 46 | just macros to the respective p_*(..,currRing). |
---|
| 47 | |
---|
| 48 | */ |
---|
| 49 | |
---|
| 50 | /*************************************************************** |
---|
| 51 | * |
---|
| 52 | * Primitives for accessing and setting fields of a poly |
---|
| 53 | * poly must be != NULL |
---|
| 54 | * |
---|
| 55 | ***************************************************************/ |
---|
| 56 | // deletes old coeff before setting the new one |
---|
| 57 | #define pSetCoeff(p,n) p_SetCoeff(p,n,currRing) |
---|
| 58 | |
---|
| 59 | // Order |
---|
| 60 | #define pGetOrder(p) p_GetOrder(p, currRing) |
---|
| 61 | // don't use this |
---|
| 62 | #define pSetOrder(p, o) p_SetOrder(p, o, currRing) |
---|
| 63 | |
---|
| 64 | // Component |
---|
| 65 | #define pGetComp(p) _p_GetComp(p, currRing) |
---|
| 66 | #define pSetComp(p,v) p_SetComp(p,v, currRing) |
---|
| 67 | #define pIncrComp(p) p_IncrComp(p,currRing) |
---|
| 68 | #define pDecrComp(p) p_DecrComp(p,currRing) |
---|
| 69 | #define pAddComp(p,v) p_AddComp(p,v,currRing) |
---|
| 70 | #define pSubComp(p,v) p_SubComp(p,v,currRing) |
---|
| 71 | |
---|
| 72 | // Exponent |
---|
| 73 | #define pGetExp(p,i) p_GetExp(p, i, currRing) |
---|
| 74 | #define pSetExp(p,i,v) p_SetExp(p, i, v, currRing) |
---|
| 75 | #define pIncrExp(p,i) p_IncrExp(p,i, currRing) |
---|
| 76 | #define pDecrExp(p,i) p_DecrExp(p,i, currRing) |
---|
| 77 | #define pAddExp(p,i,v) p_AddExp(p,i,v, currRing) |
---|
| 78 | #define pSubExp(p,i,v) p_SubExp(p,i,v, currRing) |
---|
| 79 | #define pMultExp(p,i,v) p_MultExp(p,i,v, currRing) |
---|
| 80 | #define pGetExpSum(p1, p2, i) p_GetExpSum(p1, p2, i, currRing) |
---|
| 81 | #define pGetExpDiff(p1, p2, i) p_GetExpDiff(p1, p2, i, currRing) |
---|
| 82 | |
---|
| 83 | /*************************************************************** |
---|
| 84 | * |
---|
| 85 | * Allocation/Initalization/Deletion |
---|
| 86 | * except for pDeleteLm and pHead, all polys must be != NULL |
---|
| 87 | * |
---|
| 88 | ***************************************************************/ |
---|
| 89 | // allocates the space for a new monomial -- no initialization !!! |
---|
| 90 | #define pNew() p_New(currRing) |
---|
| 91 | // allocates a new monomial and initializes everything to 0 |
---|
| 92 | #define pInit() p_Init(currRing) |
---|
| 93 | // like pInit, except that expvector is initialized to that of p, |
---|
| 94 | // p must be != NULL |
---|
| 95 | #define pLmInit(p) p_LmInit(p, currRing) |
---|
| 96 | // returns newly allocated copy of Lm(p), coef is copied, next=NULL, |
---|
| 97 | // p might be NULL |
---|
| 98 | #define pHead(p) p_Head(p, currRing) |
---|
| 99 | // if *p_ptr != NULL, delete p_ptr->coef, *p_ptr, and set *p_ptr to |
---|
| 100 | // pNext(*p_ptr) |
---|
| 101 | static inline void pDeleteLm(poly *p) {p_DeleteLm(p, currRing);} |
---|
| 102 | // if (p!=NULL) delete p-coef and p |
---|
| 103 | static inline void pDeleteLm(poly p) {p_DeleteLm(p, currRing);} |
---|
| 104 | // frees the space of the monomial m, assumes m != NULL |
---|
| 105 | // coef is not freed, m is not advanced |
---|
| 106 | static inline void pLmFree(poly p) {p_LmFree(p, currRing);} |
---|
| 107 | // like pLmFree, but advances p |
---|
| 108 | static inline void pLmFree(poly *p) {p_LmFree(p, currRing);} |
---|
| 109 | // assumes p != NULL, deletes p, returns pNext(p) |
---|
| 110 | #define pLmFreeAndNext(p) p_LmFreeAndNext(p, currRing) |
---|
| 111 | // assume p != NULL, deletes Lm(p)->coef and Lm(p) |
---|
| 112 | #define pLmDelete(p) p_LmDelete(p, currRing) |
---|
| 113 | // like pLmDelete, returns pNext(p) |
---|
| 114 | #define pLmDeleteAndNext(p) p_LmDeleteAndNext(p, currRing) |
---|
| 115 | // used by iparith.cc |
---|
| 116 | extern poly pHeadProc(poly p); |
---|
| 117 | |
---|
| 118 | /*************************************************************** |
---|
| 119 | * |
---|
| 120 | * Operation on ExpVectors: assumes polys != NULL |
---|
| 121 | * |
---|
| 122 | ***************************************************************/ |
---|
| 123 | |
---|
| 124 | #define pExpVectorCopy(d_p, s_p) p_ExpVectorCopy(d_p, s_p, currRing) |
---|
| 125 | #define pExpVectorAdd(p1, p2) p_ExpVectorAdd(p1, p2, currRing) |
---|
| 126 | #define pExpVectorSub(p1, p2) p_ExpVectorSub(p1, p2, currRing) |
---|
| 127 | #define pExpVectorAddSub(p1, p2, p3)p_ExpVectorAddSub(p1, p2, p3, currRing) |
---|
| 128 | #define pExpVectorSum(pr, p1, p2) p_ExpVectorSum(pr, p1, p2, currRing) |
---|
| 129 | #define pExpVectorDiff(pr, p1, p2) p_ExpVectorDiff(pr, p1, p2, currRing) |
---|
| 130 | #define pExpVectorEqual(p1, p2) p_ExpVectorEqual(p1, p2, currRing) |
---|
| 131 | #define pExpVectorQuerSum(p) p_ExpVectorQuerSum(p, currRing) |
---|
| 132 | |
---|
| 133 | // Gets a copy of (resp. set) the exponent vector, where e is assumed |
---|
| 134 | // to point to (r->N +1)*sizeof(Exponent_t) memory. Exponents are |
---|
| 135 | // filled in as follows: comp, e_1, .., e_n |
---|
| 136 | #define pGetExpV(p, e) p_GetExpV(p, e, currRing) |
---|
| 137 | #define pSetExpV(p, e) p_SetExpV(p, e, currRing) |
---|
| 138 | |
---|
| 139 | /*************************************************************** |
---|
| 140 | * |
---|
| 141 | * Comparisons: they are all done without regarding coeffs |
---|
| 142 | * |
---|
| 143 | ***************************************************************/ |
---|
| 144 | // returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering |
---|
| 145 | #define pLmCmp(p,q) p_LmCmp(p,q,currRing) |
---|
| 146 | // executes axtionE|actionG|actionS if p=q|p>q|p<q w.r.t monomial ordering |
---|
| 147 | // action should be a "goto ..." |
---|
| 148 | #define pLmCmpAction(p,q, actionE, actionG, actionS) \ |
---|
| 149 | _p_LmCmpAction(p,q,currRing, actionE, actionG,actionS) |
---|
| 150 | |
---|
| 151 | #define pLmEqual(p1, p2) pExpVectorEqual(p1, p2) |
---|
| 152 | |
---|
| 153 | // pCmp: args may be NULL |
---|
| 154 | // returns: (p2==NULL ? 1 : (p1 == NULL ? -1 : p_LmCmp(p1, p2))) |
---|
| 155 | #define pCmp(p1, p2) p_Cmp(p1, p2, currRing) |
---|
| 156 | |
---|
| 157 | |
---|
| 158 | /*************************************************************** |
---|
| 159 | * |
---|
| 160 | * Divisiblity tests, args must be != NULL, except for |
---|
| 161 | * pDivisbleBy |
---|
| 162 | * |
---|
| 163 | ***************************************************************/ |
---|
| 164 | // returns TRUE, if leading monom of a divides leading monom of b |
---|
| 165 | // i.e., if there exists a expvector c > 0, s.t. b = a + c; |
---|
| 166 | #define pDivisibleBy(a, b) p_DivisibleBy(a,b,currRing) |
---|
| 167 | // like pDivisibleBy, except that it is assumed that a!=NULL, b!=NULL |
---|
| 168 | #define pLmDivisibleBy(a,b) p_LmDivisibleBy(a,b,currRing) |
---|
| 169 | // like pLmDivisibleBy, does not check components |
---|
| 170 | #define pLmDivisibleByNoComp(a, b) p_LmDivisibleByNoComp(a,b,currRing) |
---|
| 171 | // Divisibility tests based on Short Exponent vectors |
---|
| 172 | // sev_a == pGetShortExpVector(a) |
---|
| 173 | // not_sev_b == ~ pGetShortExpVector(b) |
---|
| 174 | #define pLmShortDivisibleBy(a, sev_a, b, not_sev_b) \ |
---|
| 175 | p_LmShortDivisibleBy(a, sev_a, b, not_sev_b, currRing) |
---|
[cea6f3] | 176 | #define pLmRingShortDivisibleBy(a, sev_a, b, not_sev_b) \ |
---|
| 177 | p_LmRingShortDivisibleBy(a, sev_a, b, not_sev_b, currRing) |
---|
[35aab3] | 178 | // returns the "Short Exponent Vector" -- used to speed up divisibility |
---|
| 179 | // tests (see polys-impl.cc ) |
---|
| 180 | #define pGetShortExpVector(a) p_GetShortExpVector(a, currRing) |
---|
| 181 | |
---|
| 182 | /*************************************************************** |
---|
| 183 | * |
---|
| 184 | * Copying/Deleteion of polys: args may be NULL |
---|
| 185 | * |
---|
| 186 | ***************************************************************/ |
---|
| 187 | // return a copy of the poly |
---|
| 188 | #define pCopy(p) p_Copy(p, currRing) |
---|
| 189 | #define pDelete(p_ptr) p_Delete(p_ptr, currRing) |
---|
| 190 | |
---|
| 191 | /*************************************************************** |
---|
| 192 | * |
---|
[95450e] | 193 | * Copying/Deletion of polys: args may be NULL |
---|
[35aab3] | 194 | * - p/q as arg mean a poly |
---|
| 195 | * - m a monomial |
---|
| 196 | * - n a number |
---|
| 197 | * - pp (resp. qq, mm, nn) means arg is constant |
---|
| 198 | * - p (resp, q, m, n) means arg is destroyed |
---|
| 199 | * |
---|
| 200 | ***************************************************************/ |
---|
| 201 | #define pNeg(p) p_Neg(p, currRing) |
---|
| 202 | #define ppMult_nn(p, n) pp_Mult_nn(p, n, currRing) |
---|
| 203 | #define pMult_nn(p, n) p_Mult_nn(p, n, currRing) |
---|
| 204 | #define ppMult_mm(p, m) pp_Mult_mm(p, m, currRing) |
---|
| 205 | #define pMult_mm(p, m) p_Mult_mm(p, m, currRing) |
---|
| 206 | #define pAdd(p, q) p_Add_q(p, q, currRing) |
---|
| 207 | #define pMinus_mm_Mult_qq(p, m, q) p_Minus_mm_Mult_qq(p, m, q, currRing) |
---|
| 208 | #define pPlus_mm_Mult_qq(p, m, q) p_Plus_mm_Mult_qq(p, m, q, currRing) |
---|
| 209 | #define pMult(p, q) p_Mult_q(p, q, currRing) |
---|
| 210 | #define ppMult_qq(p, q) pp_Mult_qq(p, q, currRing) |
---|
| 211 | // p*Coeff(m) for such monomials pm of p, for which m is divisble by pm |
---|
| 212 | #define ppMult_Coeff_mm_DivSelect(p, m) pp_Mult_Coeff_mm_DivSelect(p, m, currRing) |
---|
| 213 | /************************************************************************* |
---|
| 214 | * |
---|
| 215 | * Sort routines |
---|
| 216 | * |
---|
| 217 | *************************************************************************/ |
---|
| 218 | // sorts p, assumes all monomials in p are different |
---|
| 219 | #define pSortMerger(p) pSort(p) |
---|
| 220 | #define pSort(p) p_SortMerge(p, currRing) |
---|
| 221 | |
---|
| 222 | // sorts p, p may have equal monomials |
---|
| 223 | #define pSortAdd(p) p_SortAdd(p, currRing) |
---|
| 224 | |
---|
| 225 | |
---|
| 226 | // Assume: If considerd only as poly in any component of p |
---|
| 227 | // (say, monomials of other components of p are set to 0), |
---|
| 228 | // then p is already sorted correctly |
---|
| 229 | #define pSortCompCorrect(p) pSort(p) |
---|
| 230 | |
---|
| 231 | /*************************************************************** |
---|
| 232 | * |
---|
| 233 | * Predicates on polys/Lm's |
---|
| 234 | * |
---|
| 235 | ***************************************************************/ |
---|
| 236 | // return true if all p is eihter NULL, or if all exponents |
---|
| 237 | // of p are 0 and Comp of p is zero |
---|
| 238 | #define pIsConstantComp(p) p_IsConstantComp(p, currRing) |
---|
| 239 | // like above, except that Comp might be != 0 |
---|
| 240 | #define pIsConstant(p) p_IsConstant(p,currRing) |
---|
| 241 | // return true if the Lm is a constant <>0 |
---|
| 242 | #define pIsUnit(p) p_IsUnit(p,currRing) |
---|
| 243 | // like above, except that p must be != NULL |
---|
| 244 | #define pLmIsConstantComp(p) p_LmIsConstantComp(p, currRing) |
---|
| 245 | #define pLmIsConstant(p) p_LmIsConstant(p,currRing) |
---|
| 246 | |
---|
| 247 | // return TRUE if all monomials of p are constant |
---|
| 248 | #define pIsConstantPoly(p) p_IsConstantPoly(p, currRing) |
---|
| 249 | |
---|
| 250 | #define pIsPurePower(p) p_IsPurePower(p, currRing) |
---|
[2f0d83f] | 251 | #define pIsUnivariate(p) p_IsUnivariate(p, currRing) |
---|
[35aab3] | 252 | #define pIsVector(p) (pGetComp(p)>0) |
---|
[95450e] | 253 | #define pGetVariables(p,e) p_GetVariables(p, e, currRing) |
---|
[35aab3] | 254 | |
---|
| 255 | /*************************************************************** |
---|
| 256 | * |
---|
| 257 | * Old stuff |
---|
| 258 | * |
---|
| 259 | ***************************************************************/ |
---|
| 260 | |
---|
| 261 | #define pFetchCopy(r,p) _pFetchCopy(r,p) |
---|
| 262 | // Similar to pFetchCopy, except that poly p is deleted |
---|
| 263 | #define pFetchCopyDelete(r, p) _pFetchCopyDelete(r, p) |
---|
| 264 | |
---|
| 265 | typedef poly* polyset; |
---|
| 266 | extern int pVariables; |
---|
| 267 | extern int pOrdSgn; |
---|
| 268 | extern BOOLEAN pLexOrder; |
---|
| 269 | extern poly ppNoether; |
---|
| 270 | extern BOOLEAN pVectorOut; |
---|
| 271 | |
---|
| 272 | /*-------------predicate on polys ----------------------*/ |
---|
| 273 | BOOLEAN pHasNotCF(poly p1, poly p2); /*has no common factor ?*/ |
---|
| 274 | void pSplit(poly p, poly * r); /*p => IN(p), r => REST(p) */ |
---|
| 275 | |
---|
| 276 | |
---|
| 277 | |
---|
| 278 | /*-------------ring management:----------------------*/ |
---|
| 279 | //extern void pChangeRing(ring newRing); |
---|
[8c5988] | 280 | extern void pSetGlobals(const ring r, BOOLEAN complete = TRUE); |
---|
[35aab3] | 281 | // resets the pFDeg and pLDeg: if pLDeg is not given, it is |
---|
| 282 | // set to currRing->pLDegOrig, i.e. to the respective LDegProc which |
---|
| 283 | // only uses pFDeg (and not pDeg, or pTotalDegree, etc). |
---|
| 284 | // If you use this, make sure your procs does not make any assumptions |
---|
| 285 | // on oredering and/or OrdIndex -- otherwise they might return wrong results |
---|
| 286 | // on strat->tailRing |
---|
| 287 | extern void pSetDegProcs(pFDegProc new_FDeg, pLDegProc new_lDeg = NULL); |
---|
| 288 | // restores pFDeg and pLDeg: |
---|
| 289 | extern void pRestoreDegProcs(pFDegProc old_FDeg, pLDegProc old_lDeg); |
---|
| 290 | |
---|
| 291 | /*-----------the ordering of monomials:-------------*/ |
---|
| 292 | #define pSetm(p) p_Setm(p, currRing) |
---|
| 293 | // TODO: |
---|
| 294 | #define pSetmComp pSetm |
---|
| 295 | |
---|
| 296 | /*************************************************************** |
---|
| 297 | * |
---|
| 298 | * Degree stuff -- see p_polys.cc for explainations |
---|
| 299 | * |
---|
| 300 | ***************************************************************/ |
---|
| 301 | extern pLDegProc pLDeg; |
---|
| 302 | extern pFDegProc pFDeg; |
---|
[8c5988] | 303 | int pWeight(int c, const ring r = currRing); |
---|
[107986] | 304 | long pDeg(poly p,const ring r = currRing); |
---|
| 305 | long pTotaldegree(poly p,const ring r = currRing); |
---|
| 306 | long pWTotaldegree(poly p,const ring r = currRing); |
---|
| 307 | long pWDegree(poly p,const ring r = currRing); |
---|
| 308 | long pLDeg0(poly p,int *l,const ring r = currRing); |
---|
| 309 | long pLDeg0c(poly p,int *l,const ring r = currRing); |
---|
| 310 | long pLDegb(poly p,int *l,const ring r = currRing); |
---|
| 311 | long pLDeg1(poly p,int *l,const ring r = currRing); |
---|
| 312 | long pLDeg1c(poly p,int *l,const ring r = currRing); |
---|
| 313 | long pLDeg1_Deg(poly p,int *l,const ring r = currRing); |
---|
| 314 | long pLDeg1c_Deg(poly p,int *l,const ring r = currRing); |
---|
| 315 | long pLDeg1_Totaldegree(poly p,int *l,const ring r = currRing); |
---|
| 316 | long pLDeg1c_Totaldegree(poly p,int *l,const ring r = currRing); |
---|
| 317 | long pLDeg1_WFirstTotalDegree(poly p,int *l,const ring r=currRing); |
---|
| 318 | long pLDeg1c_WFirstTotalDegree(poly p,int *l,const ring r=currRing); |
---|
[35aab3] | 319 | |
---|
| 320 | /*-------------pComp for syzygies:-------------------*/ |
---|
| 321 | |
---|
| 322 | void pSetModDeg(intvec *w); |
---|
| 323 | |
---|
| 324 | |
---|
| 325 | |
---|
| 326 | |
---|
[85e68dd] | 327 | poly pmInit(const char *s, BOOLEAN &ok); /* monom -> poly, interpreter */ |
---|
[107986] | 328 | const char * p_Read(const char *s, poly &p,const ring r); /* monom -> poly */ |
---|
| 329 | void ppDelete(poly * a,const ring r); |
---|
[35aab3] | 330 | |
---|
| 331 | /*-------------operations on polynomials:------------*/ |
---|
| 332 | poly pSub(poly a, poly b); |
---|
| 333 | poly pPower(poly p, int i); |
---|
| 334 | |
---|
| 335 | // ----------------- define to enable new p_procs -----*/ |
---|
| 336 | |
---|
| 337 | poly pDivide(poly a, poly b); |
---|
| 338 | poly pDivideM(poly a, poly b); |
---|
| 339 | void pLcm(poly a, poly b, poly m); |
---|
| 340 | poly pDiff(poly a, int k); |
---|
| 341 | poly pDiffOp(poly a, poly b,BOOLEAN multiply); |
---|
| 342 | |
---|
| 343 | #define pMaxComp(p) p_MaxComp(p, currRing) |
---|
| 344 | #define pMinComp(p) p_MinComp(p, currRing) |
---|
| 345 | int pMaxCompProc(poly p); |
---|
| 346 | |
---|
| 347 | #define pOneComp(p) p_OneComp(p, currRing) |
---|
| 348 | #define pSetCompP(a,i) p_SetCompP(a, i, currRing) |
---|
| 349 | |
---|
| 350 | // let's inline those, so that we can call them from the debugger |
---|
| 351 | inline char* pString(poly p) {return p_String(p, currRing, currRing);} |
---|
| 352 | inline char* pString0(poly p) {return p_String0(p, currRing, currRing);} |
---|
| 353 | inline void pWrite(poly p) {p_Write(p, currRing, currRing);} |
---|
| 354 | inline void pWrite0(poly p) {p_Write0(p, currRing, currRing);} |
---|
| 355 | inline void wrp(poly p) {p_wrp(p, currRing, currRing);} |
---|
| 356 | |
---|
| 357 | void pEnlargeSet(polyset *p, int length, int increment); |
---|
| 358 | #define pISet(i) p_ISet(i,currRing) |
---|
| 359 | #define pNSet(n) p_NSet(n,currRing) |
---|
[1c33e0d] | 360 | |
---|
| 361 | poly p_One(const ring r); |
---|
[a88544] | 362 | #define pOne() p_One(currRing) |
---|
[35aab3] | 363 | |
---|
| 364 | void pContent(poly p); |
---|
[56153ef] | 365 | void pSimpleContent(poly p, int s); |
---|
[d0207e9] | 366 | poly pCleardenom(poly p); |
---|
[cf5fc11] | 367 | void pCleardenom_n(poly p,number &c); |
---|
[107986] | 368 | void p_Normalize(poly p,const ring r); |
---|
[967a9d] | 369 | number p_GetAllDenom(poly ph, const ring r); |
---|
[35aab3] | 370 | #define pNormalize(p) p_Normalize(p,currRing) |
---|
[7ba059] | 371 | int pSize( poly p ); |
---|
| 372 | |
---|
[35aab3] | 373 | |
---|
| 374 | // homogenizes p by multiplying certain powers of the varnum-th variable |
---|
| 375 | poly pHomogen (poly p, int varnum); |
---|
| 376 | |
---|
| 377 | // replaces the maximal powers of the leading monomial of p2 in p1 by |
---|
| 378 | // the same powers of n, utility for dehomogenization |
---|
| 379 | poly pDehomogen (poly p1,poly p2,number n); |
---|
| 380 | BOOLEAN pIsHomogeneous (poly p); |
---|
| 381 | |
---|
| 382 | // returns the leading monomial of p1 divided by the maximal power of |
---|
| 383 | // that of p2 |
---|
| 384 | poly pDivByMonom (poly p1,poly p2); |
---|
| 385 | |
---|
| 386 | // Returns as i-th entry of P the coefficient of the (i-1) power of |
---|
| 387 | // the leading monomial of p2 in p1 |
---|
| 388 | void pCancelPolyByMonom (poly p1,poly p2,polyset * P,int * SizeOfSet); |
---|
| 389 | |
---|
[107986] | 390 | poly pPermPoly (poly p, int * perm,const ring OldRing, nMapFunc nMap, |
---|
[35aab3] | 391 | int *par_perm=NULL, int OldPar=0); |
---|
| 392 | |
---|
| 393 | /*BOOLEAN pVectorHasUnitM(poly p, int * k);*/ |
---|
| 394 | BOOLEAN pVectorHasUnitB(poly p, int * k); |
---|
| 395 | void pVectorHasUnit(poly p, int * k, int * len); |
---|
| 396 | poly pTakeOutComp1(poly * p, int k); |
---|
| 397 | // Splits *p into two polys: *q which consists of all monoms with |
---|
| 398 | // component == comp and *p of all other monoms *lq == pLength(*q) |
---|
| 399 | // On return all components pf *q == 0 |
---|
| 400 | void pTakeOutComp(poly *p, Exponent_t comp, poly *q, int *lq); |
---|
| 401 | // Similar to pTakeOutComp, except that only those components are |
---|
| 402 | // taken out whose Order == order |
---|
| 403 | // ASSUME: monomial ordering is Order compatible, i.e., if m1, m2 Monoms then |
---|
| 404 | // m1 >= m2 ==> pGetOrder(m1) >= pGetOrder(m2) |
---|
[b07ba77] | 405 | void pDecrOrdTakeOutComp(poly *p, Exponent_t comp, long order, |
---|
[35aab3] | 406 | poly *q, int *lq); |
---|
| 407 | // This is something weird -- Don't use it, unless you know what you are doing |
---|
| 408 | poly pTakeOutComp(poly * p, int k); |
---|
| 409 | void pSetPolyComp(poly p, int comp); |
---|
| 410 | void pDeleteComp(poly * p,int k); |
---|
| 411 | void pNorm(poly p); |
---|
| 412 | poly pSubst(poly p, int n, poly e); |
---|
| 413 | poly ppJet(poly p, int m); |
---|
| 414 | poly pJet(poly p, int m); |
---|
| 415 | poly ppJetW(poly p, int m, short * iv); |
---|
| 416 | poly pJetW(poly p, int m, short * iv); |
---|
| 417 | int pMinDeg(poly p,intvec *w=NULL); |
---|
| 418 | poly pSeries(int n,poly p,poly u=NULL,intvec *w=NULL); |
---|
| 419 | poly pInvers(int n, poly p,intvec *w=NULL); |
---|
| 420 | // maximum weigthed degree of all monomials of p, w is indexed from |
---|
| 421 | // 1..pVariables |
---|
[2318f07] | 422 | long pDegW(poly p, const short *w); |
---|
[35aab3] | 423 | |
---|
| 424 | /*-----------type conversions ----------------------------*/ |
---|
| 425 | poly pPolys2Vec(polyset p, int len); |
---|
| 426 | void pVec2Polys(poly v, polyset *p, int *len); |
---|
[891692] | 427 | int p_Var(poly mi,const ring r); |
---|
| 428 | #define pVar(m) p_Var(m,currRing) |
---|
[35aab3] | 429 | |
---|
| 430 | /*-----------specials for spoly-computations--------------*/ |
---|
| 431 | BOOLEAN pCompareChain (poly p,poly p1,poly p2,poly lcm); |
---|
[107986] | 432 | BOOLEAN pCompareChainPart (poly p,poly p1,poly p2,poly lcm); |
---|
[14d732] | 433 | #define pEqualPolys(p1,p2) p_EqualPolys(p1,p2,currRing) |
---|
[35aab3] | 434 | BOOLEAN pComparePolys(poly p1,poly p2); |
---|
| 435 | |
---|
| 436 | |
---|
| 437 | |
---|
| 438 | /*************************************************************** |
---|
| 439 | * |
---|
| 440 | * PDEBUG stuff |
---|
| 441 | * |
---|
| 442 | ***************************************************************/ |
---|
| 443 | #ifdef PDEBUG |
---|
| 444 | #define pTest(p) _p_Test(p, currRing, PDEBUG) |
---|
| 445 | #define pLmTest(p) _p_LmTest(p, currRing, PDEBUG) |
---|
| 446 | |
---|
| 447 | #else // ! PDEBUG |
---|
| 448 | |
---|
| 449 | #define pTest(p) ((void)0) |
---|
| 450 | #define pLmTest(p) ((void)0) |
---|
| 451 | #endif |
---|
| 452 | |
---|
| 453 | #endif // POLYS_H |
---|