 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the documentation of this file.
115 Print(
"-----LIST-----\n");
117 while(
NULL != temp) {
187 this->
next = newElement;
199 this->
next = newElement;
246 temp->
next = newElement;
259 temp->
next = newElement;
294 l->next = temp->
next;
307 l->next = temp->
next;
379 while(
NULL != temp) {
380 if(pComparePolys(temp->
getPoly(),*
p)) {
396 PrintS(
"___________________List of S-polynomials______________________:\n");
405 PrintS(
"_______________________________________________________________\n");
411 while(
NULL != temp) {
731 temp->
next = newElement;
737 temp->
next = newElement;
742 temp->
next = newElement;
751 temp->
next = newElement;
757 temp->
next = newElement;
770 temp->
next = newElement;
776 temp->
next = newElement;
781 temp->
next = newElement;
790 temp->
next = newElement;
799 newElement->
next =
this;
807 while(
NULL != temp) {
888 PrintS(
"___________________List of critical pairs______________________:\n");
985 newElement->
next =
this;
997 newElement->
next =
this;
1006 newElement->
next = temp;
1010 newElement->
next = temp;
1017 newElement->
next = temp;
1041 while(
NULL != temp) {
1151 if(idx==1 || idx==0) {
1177 Print(
"1. element: %d, ",
getRNode()->getRuleOld()->getIndex());
1182 Print(
"%d. element: %d, ",
i,
getRNode()->getRuleOld()->getIndex());
void insertOrdered(RuleOld *r)
RTagNode * insert(RNode *r)
RNode * get(int idx, int length)
PNode(poly p, PNode *n)
functions working on the class PNode
void insertSP(LPolyOld *lp)
LNode * getFirstCurrentIdx()
static poly getTerm(const ideal H, const mark ab)
CNode * insert(CPairOld *c)
RuleOld * getTestedRuleOld()
LTagNode * insert(LNode *l)
static BOOLEAN length(leftv result, leftv arg)
LNode * get(int i, int length)
void insertFirst(LNode *l)
void PrintS(const char *s)
RuleOld * getTestedRuleOld()
RNode * insertOrdered(RuleOld *r)
void setFirstCurrentIdx(LNode *l)
void insertByLabel(poly t, int i, poly p, RuleOld *r=NULL)
class PNode of nodes of polynomials
LNode * insert(LPolyOld *lp)
RNode * insert(RuleOld *r)
void setRuleOld(RuleOld *r)
void setRuleOld(RuleOld *r)
LNode * insertFirst(LNode *l)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
void insertWithoutSort(CPairOld *c)
#define pCopy(p)
return a copy of the poly
LNode * insertSP(LPolyOld *lp)
CNode * insertWithoutSort(CPairOld *cp)
void insert(LPolyOld *lp)
PList()
functions working on the class PList
LNode * insertByLabel(poly t, int i, poly p, RuleOld *r)