executes axtionE|actionG|actionS if p=q|p>q|p<q w.r.t monomial ordering action should be a "goto ..."
283#define pWTotaldegree(p) p_WTotaldegree(p,currRing)
284#define pWDegree(p) p_WDegree(p,currRing)
285
286
287#define pSub(a,b) p_Sub(a,b,currRing)
288
289#define pmInit(a,b) p_mInit(a,b,currRing)
290
291
292
293#define pMDivide(a,b) p_MDivide(a,b,currRing)
294#define pDivideM(a,b) p_DivideM(a,b,currRing)
295#define pLcm(a,b,m) p_Lcm(a,b,m,currRing)
296#define pDiff(a,b) p_Diff(a,b,currRing)
297#define pDiffOp(a,b,m) p_DiffOp(a,b,m,currRing)
298
299#define pMaxComp(p) p_MaxComp(p, currRing)
300#define pMinComp(p) p_MinComp(p, currRing)
301
302#define pOneComp(p) p_OneComp(p, currRing)
303#define pSetCompP(a,i) p_SetCompP(a, i, currRing)
304
305
311
312#define pISet(i) p_ISet(i,currRing)
313#define pNSet(n) p_NSet(n,currRing)
314
315#define pOne() p_One(currRing)
316
317#define pNormalize(p) p_Normalize(p,currRing)
318#define pSize(p) p_Size(p,currRing)
319
320
321
322#define pHomogen(p,varnum) p_Homogen(p,varnum,currRing)
323
325
326
327
328
329#define pIsHomogen(p) p_IsHomogen(p,currRing)
330
331
332#define pVectorHasUnitB(p,k) p_VectorHasUnitB(p,k,currRing)
333#define pVectorHasUnit(p,k,l) p_VectorHasUnit(p,k,l,currRing)
334
335
336
337
339{
341}
342
343
344
346{
348}
349
350
351
352
353
354
355
356
357
358
360#define pDeleteComp(p,k) p_DeleteComp(p,k,currRing)
361
363
364
365#define pSubst(p,n,e) p_Subst(p,n,e,currRing)
366#define ppJet(p,m) pp_Jet(p,m,currRing)
367#define pJet(p,m) p_Jet(p,m,currRing)
368#define ppJetW(p,m,iv) pp_JetW(p,m,iv,currRing)
369#define pJetW(p,m,iv) p_JetW(p,m,iv,currRing)
370#define pMinDeg(p,w) p_MinDeg(p,w,currRing)
371#define pSeries(n,p,u,w) p_Series(n,p,u,w,currRing)
372
373
374
375
376#define pDegW(p,w) p_DegW(p,w,currRing)
377
378
379
380#define pVar(m) p_Var(m,currRing)
381
382
383
384
385
386
387
388
389
390
391
393
394#ifdef HAVE_RATGRING
396#endif
397
398
399#define pEqualPolys(p1,p2) p_EqualPolys(p1,p2,currRing)
400
401
402
403
404
406static inline poly
pLast(poly a) {
int l;
return pLast(a,
l); }
407
408
409
410
411
412
413#ifdef PDEBUG
414#define pTest(p) _p_Test(p, currRing, PDEBUG)
415#define pLmTest(p) _p_LmTest(p, currRing, PDEBUG)
416
417#else
418
419#define pTest(p) do {} while (0)
420#define pLmTest(p) do {} while (0)
421#endif
422
423#endif
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
static BOOLEAN length(leftv result, leftv arg)
void p_TakeOutComp(poly *p, long comp, poly *q, int *lq, const ring r)
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
void p_Norm(poly p1, const ring r)
poly p_Last(const poly p, int &l, const ring r)
char * p_String(poly p, ring lmRing, ring tailRing)
void p_String0(poly p, ring lmRing, ring tailRing)
print p according to ShortOut in lmRing & tailRing
void p_Write(poly p, ring lmRing, ring tailRing)
void p_Write0(poly p, ring lmRing, ring tailRing)
static long p_Totaldegree(poly p, const ring r)
void p_wrp(poly p, ring lmRing, ring tailRing)
void pSetPolyComp(poly p, int comp)
BOOLEAN pCompareChain(poly p, poly p1, poly p2, poly lcm, const ring R=currRing)
Returns TRUE if.
BOOLEAN pIsHomogeneous(poly p)
BOOLEAN pCompareChainPart(poly p, poly p1, poly p2, poly lcm, const ring R=currRing)
static poly pLast(poly a, int &length)
returns the length of a polynomial (numbers of monomials) respect syzComp
void pTakeOutComp(poly *p, long comp, poly *q, int *lq, const ring R=currRing)
Splits *p into two polys: *q which consists of all monoms with component == comp and *p of all other ...