Changeset 61944d0 in git for kernel/f5lists.cc

Timestamp:

Feb 26, 2009, 10:01:52 AM (14 years ago)

Author:

Christian Eder

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')

Children:

60933487e53ddb20e0e5d7d5ccc137ac53893f37

Parents:

7a8ca6fdf98e2078621ae6ac00ff9481cab3def8

Message:

solved problems in reduction() in topReduction() considering both criteria and computation of new polynomials


git-svn-id: file:///usr/local/Singular/svn/trunk@11473 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/f5lists.cc (modified) (5 diffs)

kernel/f5lists.cc

@@ -106 +106 @@
     }
     else {
-        if(0 == pLmCmp(t,this->getTerm()) || -1 == pLmCmp(t,this->getTerm())) {
+        if(-1 == pLmCmp(t,this->getTerm())) {
             LNode* newElement   =   new LNode(t, i, p, r, this);
             return newElement;
@@ -113 +113 @@
             LNode* temp = this;
             while(NULL != temp->next && NULL != temp->next->data) {
-                if( 0 == pLmCmp(t,temp->next->getTerm()) || -1 == pLmCmp(t,temp->next->getTerm())) {
+                if(-1 == pLmCmp(t,temp->next->getTerm())) {
                     LNode* newElement   =   new LNode(t, i, p, r, temp->next);
                     temp->next          =   newElement;
@@ -188 +188 @@
 }
 
+void LNode::setNext(LNode* l) {
+    next    =   l;
+}
+
 // test if for any list element the polynomial part of the data is equal to *p
 bool LNode::polyTest(poly* p) {
@@ -213 +217 @@
         Print("Index: %d\n",temp->getIndex());
         Print("Term: ");
-        //pWrite(temp->getTerm());
+        pWrite(temp->getTerm());
         Print("Poly: ");
-        //pWrite(temp->getPoly());
+        pWrite(temp->getPoly());
         Print("\n");
         temp = temp->next;
@@ -312 +316 @@
 
 void LList::setFirst(LNode* l) {
+    LNode* temp =   first;
+    temp->setNext(NULL);
     first       =   l;
     length--;