82 first = first->insert(p);
116 Print(
"-----LIST-----\n");
118 while(
NULL != temp) {
188 this->
next = newElement;
200 this->
next = newElement;
215 LNode* newElement =
new LNode(t, i, p, r,
this);
227 LNode* newElement =
new LNode(t, i, p, r,
this);
235 LNode* newElement =
new LNode(t, i, p, r,
this);
247 temp->
next = newElement;
260 temp->
next = newElement;
333 return data->getPoly();
337 return data->getTerm();
341 return data->getIndex();
345 return data->getRuleOld();
349 return data->setRuleOld(r);
353 return data->getDel();
380 while(
NULL != temp) {
381 if(pComparePolys(temp->
getPoly(),*
p)) {
397 PrintS(
"___________________List of S-polynomials______________________:\n");
406 PrintS(
"_______________________________________________________________\n");
412 while(
NULL != temp) {
436 first =
new LNode(lp);
442 first =
new LNode(t,i,p,r);
482 first = first->insertSP(lp);
488 first = first->insertSP(t,i,p,r);
495 first = first->insertByLabel(t,i,p,r);
501 first = first->insertFirst(l);
507 first = first->insertByLabel(l);
513 first = first->deleteByDeg();
517 return first->polyTest(p);
544 return first->count(l);
594 for(j=1;j<=length-idx+1;j++) {
630 first = first->insert(l);
639 return first->get(idx,
length);
643 return first->getLNode();
647 return firstCurrentIdx;
732 temp->
next = newElement;
738 temp->
next = newElement;
743 temp->
next = newElement;
752 temp->
next = newElement;
758 temp->
next = newElement;
771 temp->
next = newElement;
777 temp->
next = newElement;
782 temp->
next = newElement;
791 temp->
next = newElement;
800 newElement->
next =
this;
808 while(
NULL != temp) {
830 return this->
data->getAdLp1();
834 return this->
data->getAdLp2();
838 return this->
data->getLp1Poly();
842 return this->
data->getLp2Poly();
846 return this->
data->getLp1Term();
850 return this->
data->getLp2Term();
854 return this->
data->getLp1Index();
858 return this->
data->getLp2Index();
862 return this->
data->getT1();
866 return this->
data->getAdT1();
870 return this->
data->getT2();
874 return this->
data->getAdT2();
878 return data->getDel();
882 return this->
data->getTestedRuleOld();
889 PrintS(
"___________________List of critical pairs______________________:\n");
925 first =
new CNode(c);
930 while(
NULL != first) {
940 first = first->insert(c);
944 first = first->insertWithoutSort(c);
986 newElement->
next =
this;
998 newElement->
next =
this;
1007 newElement->
next = temp;
1011 newElement->
next = temp;
1018 newElement->
next = temp;
1033 return data->getIndex();
1037 return data->getTerm();
1042 while(
NULL != temp) {
1059 first =
new RNode(r);
1081 first = first->insert(i,t);
1085 first = first->insert(r);
1089 first = first->insertOrdered(r);
1097 return this->getRuleOld();
1152 if(idx==1 || idx==0) {
1163 for(j=1; j<=length-idx+1; j++) {
1178 Print(
"1. element: %d, ",getRNode()->getRuleOld()->getIndex());
1183 Print(
"%d. element: %d, ",i,getRNode()->getRuleOld()->getIndex());
1218 first = first->insert(r);
1225 return first->getRNode();
1229 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