61 if(0 ==
pLmCmp(q,
temp->getNext()->getPoly())) {
115 Print(
"-----LIST-----\n");
187 this->
next = newElement;
199 this->
next = newElement;
293 if(-1 ==
pLmCmp(
l->getTerm(),
temp->next->getTerm())) {
294 l->next =
temp->next;
307 l->next =
temp->next;
396 PrintS(
"___________________List of S-polynomials______________________:\n");
405 PrintS(
"_______________________________________________________________\n");
412 if(!
temp->getDel()) {
725 if(
temp->next->data->getDeg() == c->
getDeg() ) {
749 if( c->
getDeg() <
temp->next->data->getDeg() ) {
754 if( c->
getDeg() ==
temp->next->data->getDeg() ) {
763 if(
temp->next->data->getDeg() == c->
getDeg() ) {
765 temp->next->data->getLp1Term()))) {
785 if( c->
getDeg() >
temp->next->data->getDeg() ) {
808 while(
NULL !=
temp->next &&
temp->next->data->getDeg() ==
this->data->getDeg()) {
888 PrintS(
"___________________List of critical pairs______________________:\n");
892 Print(
"LP1 Index: %d\n",
temp->getLp1Index());
900 Print(
"LP2 Index: %d\n",
temp->getLp2Index());
1043 Print(
"%d\n\n",
temp->getRuleOldIndex());
1151 if(idx==1 || idx==0) {
1177 Print(
"1. element: %d, ",
getRNode()->getRuleOld()->getIndex());
1182 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)
Compatibility 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)