#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p
static poly getTerm(const ideal H, const mark ab)
structure of RuleOlds(i.e.
void setFirstCurrentIdx(LNode *l)
const CanonicalForm CFMap CFMap int &both_non_zero int n
RuleOld * getTestedRuleOld()
RNode * get(int idx, int length)
LNode * getFirstCurrentIdx()
RNode * insert(RuleOld *r)
class of labeled polynomials
void insertFirst(LNode *l)
RNode * insertOrdered(RuleOld *r)
LTagNode * insert(LNode *l)
void setRuleOld(RuleOld *r)
LNode * insert(LPolyOld *lp)
CNode * insertWithoutSort(CPairOld *cp)
void insertByLabel(poly t, int i, poly p, RuleOld *r=NULL)
PList()
functions working on the class PList
void insertWithoutSort(CPairOld *c)
LNode * get(int i, int length)
void insertSP(LPolyOld *lp)
void setRuleOld(RuleOld *r)
void insertOrdered(RuleOld *r)
RuleOld * getTestedRuleOld()
#define pCopy(p)
return a copy of the poly
structure of labeled critical pairs