Changeset 9cb4078 in git for kernel/f5lists.cc
 Timestamp:
 Mar 4, 2009, 9:23:05 PM (14 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 fe880793d1fe5f78cc5038ae512e18c6cbaab42c
 Parents:
 fcef59fcd75c37051211c94b3423f0d319602d9d
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

kernel/f5lists.cc
rfcef59 r9cb4078 30 30 next = NULL; 31 31 } 32 32 LNode::LNode(LPoly* lp) { 33 33 data = lp; 34 34 next = NULL; … … 53 53 } 54 54 55 55 LNode::LNode(LNode* ln) { 56 56 data = ln>getLPoly(); 57 57 next = ln>getNext(); … … 60 60 LNode::~LNode() { 61 61 //delete next; 62 Print("DELETE LNODE\n"); 62 63 delete data; 63 64 } … … 74 75 // insert new elements to the list always at the end (labeled / classical polynomial view) 75 76 // needed for list gPrev 76 LNode* LNode::insert(LPoly* lp) {77 inline LNode* LNode::insert(LPoly* lp) { 77 78 //Print("INSERTION: \n"); 78 79 //Print("LAST GPREV: "); 79 80 //pWrite(this>getPoly()); 80 LNode* newElement = new LNode(lp, NULL);81 LNode* newElement = new LNode(lp, NULL); 81 82 this>next = newElement; 82 83 return newElement; 83 84 } 84 85 85 LNode* LNode::insert(poly t, int i, poly p, Rule* r) {86 inline LNode* LNode::insert(poly t, int i, poly p, Rule* r) { 86 87 LNode* newElement = new LNode(t, i, p, r, NULL); 87 88 this>next = newElement; … … 91 92 // insert new elements to the list always in front (labeled / classical polynomial view) 92 93 // needed for sPolyList 93 LNode* LNode::insertSP(LPoly* lp) {94 inline LNode* LNode::insertSP(LPoly* lp) { 94 95 LNode* newElement = new LNode(lp, this); 95 96 //Print("INSERTED IN SPOLYLIST: "); … … 98 99 } 99 100 100 LNode* LNode::insertSP(poly t, int i, poly p, Rule* r) {101 inline LNode* LNode::insertSP(poly t, int i, poly p, Rule* r) { 101 102 LNode* newElement = new LNode(t, i, p, r, this); 102 103 //Print("INSERTED IN SPOLYLIST: "); … … 106 107 // insert new elemets to the list w.r.t. increasing labels 107 108 // only used for the Spolys to be reduced (TopReduction building new Spolys with higher label) 108 LNode* LNode::insertByLabel(poly t, int i, poly p, Rule* r) {109 inline LNode* LNode::insertByLabel(poly t, int i, poly p, Rule* r) { 109 110 //Print("ADDING SOLYS TO THE LIST\n"); 110 111 //Print("new element: "); … … 264 265 first = first>getNext(); 265 266 delete temp; 267 Print("%p\n",first); 266 268 } 267 269 } … … 480 482 481 483 CNode::~CNode() { 482 delete next;483 484 delete data; 484 485 } … … 699 700 700 701 CList::~CList() { 701 delete first; 702 CNode* temp; 703 while(first) { 704 temp = first; 705 first = first>getNext(); 706 delete temp; 707 } 702 708 } 703 709 … … 740 746 741 747 RNode::~RNode() { 742 delete next;748 Print("DELETE RULE\n"); 743 749 delete data; 744 750 } … … 787 793 788 794 RList::~RList() { 789 delete first; 790 } 795 RNode* temp; 796 Print("%p\n",first); 797 while(first>getRule()) { 798 temp = first; 799 first = first>getNext(); 800 Print("1 %p\n",first); 801 if(first) { 802 Print("2 %p\n",first>getNext()); 803 //Print("3 %p\n",first>getNext()>getRuleTerm()); 804 } 805 delete temp; 806 } 807 Print("FERTIG\n"); 808 } 791 809 792 810 void RList::insert(int i, poly t) { … … 828 846 829 847 RTagNode::~RTagNode() { 830 delete next;831 848 delete data; 832 849 } … … 842 859 RNode* RTagNode::getRNode() { 843 860 return this>data; 861 } 862 863 RTagNode* RTagNode::getNext() { 864 return next; 844 865 } 845 866 … … 900 921 901 922 RTagList::~RTagList() { 902 delete first; 923 RTagNode* temp; 924 while(first) { 925 temp = first; 926 first = first>getNext(); 927 delete temp; 928 } 903 929 } 904 930
Note: See TracChangeset
for help on using the changeset viewer.