81 first = first->insert(p);
115 Print(
"-----LIST-----\n");
117 while(
NULL != temp) {
187 this->
next = newElement;
199 this->
next = newElement;
214 LNode* newElement =
new LNode(t, i, p, r,
this);
226 LNode* newElement =
new LNode(t, i, p, r,
this);
234 LNode* newElement =
new LNode(t, i, p, r,
this);
246 temp->
next = newElement;
259 temp->
next = newElement;
332 return data->getPoly();
336 return data->getTerm();
340 return data->getIndex();
344 return data->getRuleOld();
348 return data->setRuleOld(r);
352 return data->getDel();
379 while(
NULL != temp) {
380 if(pComparePolys(temp->
getPoly(),*
p)) {
396 PrintS(
"___________________List of S-polynomials______________________:\n");
405 PrintS(
"_______________________________________________________________\n");
411 while(
NULL != temp) {
435 first =
new LNode(lp);
441 first =
new LNode(t,i,p,r);
481 first = first->insertSP(lp);
487 first = first->insertSP(t,i,p,r);
494 first = first->insertByLabel(t,i,p,r);
500 first = first->insertFirst(l);
506 first = first->insertByLabel(l);
512 first = first->deleteByDeg();
516 return first->polyTest(p);
543 return first->count(l);
593 for(j=1;j<=length-idx+1;j++) {
629 first = first->insert(l);
638 return first->get(idx,
length);
642 return first->getLNode();
646 return firstCurrentIdx;
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) {
829 return this->
data->getAdLp1();
833 return this->
data->getAdLp2();
837 return this->
data->getLp1Poly();
841 return this->
data->getLp2Poly();
845 return this->
data->getLp1Term();
849 return this->
data->getLp2Term();
853 return this->
data->getLp1Index();
857 return this->
data->getLp2Index();
861 return this->
data->getT1();
865 return this->
data->getAdT1();
869 return this->
data->getT2();
873 return this->
data->getAdT2();
877 return data->getDel();
881 return this->
data->getTestedRuleOld();
888 PrintS(
"___________________List of critical pairs______________________:\n");
924 first =
new CNode(c);
929 while(
NULL != first) {
939 first = first->insert(c);
943 first = first->insertWithoutSort(c);
985 newElement->
next =
this;
997 newElement->
next =
this;
1006 newElement->
next = temp;
1010 newElement->
next = temp;
1017 newElement->
next = temp;
1032 return data->getIndex();
1036 return data->getTerm();
1041 while(
NULL != temp) {
1058 first =
new RNode(r);
1080 first = first->insert(i,t);
1084 first = first->insert(r);
1088 first = first->insertOrdered(r);
1096 return this->getRuleOld();
1151 if(idx==1 || idx==0) {
1162 for(j=1; j<=length-idx+1; j++) {
1177 Print(
"1. element: %d, ",getRNode()->getRuleOld()->getIndex());
1182 Print(
"%d. element: %d, ",i,getRNode()->getRuleOld()->getIndex());
1217 first = first->insert(r);
1224 return first->getRNode();
1228 return first->get(idx,
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)
Compatiblity layer for legacy polynomial operations (over currRing)
LNode * insertByLabel(poly t, int i, poly p, RuleOld *r)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
static poly getTerm(const ideal H, const mark ab)
structure of RuleOlds(i.e.
void setFirstCurrentIdx(LNode *l)
RuleOld * getTestedRuleOld()
RNode * get(int idx, int length)
LNode * getFirstCurrentIdx()
RNode * insert(RuleOld *r)
class of labeled polynomials
void insertFirst(LNode *l)
void PrintS(const char *s)
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)
static BOOLEAN length(leftv result, leftv arg)
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)
#define pCopy(p)
return a copy of the poly
structure of labeled critical pairs