179 LNode*
get(
int i,
int length);
350 RNode*
get(
int idx,
int length);
PNode(poly p, PNode *n)
functions working on the class PNode
LNode * insertFirst(LNode *l)
RTagNode * insert(RNode *r)
class PNode of nodes of polynomials
CNode * insert(CPairOld *c)
void insert(LPolyOld *lp)
LNode * insertSP(LPolyOld *lp)
LNode * insertByLabel(poly t, int i, poly p, RuleOld *r)
structure of RuleOlds(i.e.
void setFirstCurrentIdx(LNode *l)
void insertByDeg(LPolyOld *lp)
RuleOld * getTestedRuleOld()
class PList of lists of PNodes
LNode * getFirstCurrentIdx()
RNode * insert(RuleOld *r)
LNode * getGPrevRedCheck()
class of labeled polynomials
void insertFirst(LNode *l)
RNode * insertOrdered(RuleOld *r)
LTagNode * insert(LNode *l)
LNode * insert(LPolyOld *lp)
CNode * insertWithoutSort(CPairOld *cp)
void insertByLabel(poly t, int i, poly p, RuleOld *r=NULL)
LNode * getcompletedRedCheck()
PList()
functions working on the class PList
void insertWithoutSort(CPairOld *c)
LNode * insertByDeg(LPolyOld *lp)
void insertSP(LPolyOld *lp)
void setRuleOld(RuleOld *r)
void insertOrdered(RuleOld *r)
structure of labeled critical pairs