108 void setPoly(
poly p);
109 void setTerm(
poly t);
110 void setIndex(
int i);
115 bool polyTest(
poly*
p);
147 void insertByLabel(
LNode*
l);
148 void insertFirst(
LNode*
l);
150 bool polyTest(
poly*
p);
179 LNode*
get(
int i,
int length);
199 void setFirstCurrentIdx(
LNode*
l);
202 LNode* getFirstCurrentIdx();
222 LList* getCompleted();
279 void insertWithoutSort(
CPairOld* c);
303 int getRuleOldIndex();
304 poly getRuleOldTerm();
350 RNode*
get(
int idx,
int length);
int status int void size_t count
PNode(poly p, PNode *n)
functions working on the class PNode
class PNode of nodes of polynomials
static poly getTerm(const ideal H, const mark ab)
structure of RuleOlds(i.e.
class PList of lists of PNodes
LNode * getGPrevRedCheck()
class of labeled polynomials
LNode * getcompletedRedCheck()
structure of labeled critical pairs