116 Print(
"-----LIST-----\n");
118 while(
NULL != temp) {
188 this->
next = newElement;
200 this->
next = newElement;
247 temp->
next = newElement;
260 temp->
next = newElement;
282 if(-1 ==
pLmCmp(
l->getTerm(),this->getTerm())) {
295 l->next = temp->
next;
308 l->next = temp->
next;
380 while(
NULL != temp) {
381 if(pComparePolys(temp->
getPoly(),*
p)) {
397 PrintS(
"___________________List of S-polynomials______________________:\n");
406 PrintS(
"_______________________________________________________________\n");
412 while(
NULL != temp) {
710 if( c->
getDeg() < this->data->getDeg() ) {
714 if( c->
getDeg() == this->data->getDeg() ) {
732 temp->
next = newElement;
738 temp->
next = newElement;
743 temp->
next = newElement;
747 if( c->
getDeg() > this->data->getDeg() ) {
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) {
889 PrintS(
"___________________List of critical pairs______________________:\n");
986 newElement->
next =
this;
998 newElement->
next =
this;
1007 newElement->
next = temp;
1011 newElement->
next = temp;
1018 newElement->
next = temp;
1042 while(
NULL != temp) {
1152 if(idx==1 || idx==0) {
1178 Print(
"1. element: %d, ",
getRNode()->getRuleOld()->getIndex());
1183 Print(
"%d. element: %d, ",
i,
getRNode()->getRuleOld()->getIndex());
void insertWithoutSort(CPairOld *c)
RuleOld * getTestedRuleOld()
CNode * insert(CPairOld *c)
CNode * insertWithoutSort(CPairOld *cp)
RuleOld * getTestedRuleOld()
void insert(LPolyOld *lp)
void insertFirst(LNode *l)
void insertByLabel(poly t, int i, poly p, RuleOld *r=NULL)
void insertSP(LPolyOld *lp)
LNode * insertFirst(LNode *l)
LNode * insert(LPolyOld *lp)
LNode * insertSP(LPolyOld *lp)
LNode * insertByLabel(poly t, int i, poly p, RuleOld *r)
void setRuleOld(RuleOld *r)
void setRuleOld(RuleOld *r)
void setFirstCurrentIdx(LNode *l)
LNode * getFirstCurrentIdx()
LNode * get(int i, int length)
LTagNode * insert(LNode *l)
PList()
functions working on the class PList
class PNode of nodes of polynomials
PNode(poly p, PNode *n)
functions working on the class PNode
void insertOrdered(RuleOld *r)
RNode * insertOrdered(RuleOld *r)
RNode * insert(RuleOld *r)
RTagNode * insert(RNode *r)
RNode * get(int idx, int length)
static BOOLEAN length(leftv result, leftv arg)
Compatiblity layer for legacy polynomial operations (over currRing)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
#define pCopy(p)
return a copy of the poly
static poly getTerm(const ideal H, const mark ab)
void PrintS(const char *s)