Changeset 66a5f8 in git
- Timestamp:
- Mar 25, 2009, 3:24:00 PM (14 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 9f9b142893198e383bb306d720e6dcb4e2da44ce
- Parents:
- 16ed2f5aab6d00da628b5f73458c7045c9adaaf6
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/f5gb.cc
r16ed2f r66a5f8 71 71 */ 72 72 LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE, LTagList* lTag, RList* rules, RTagList* rTag) { 73 //Print("in f5inc\n");73 Print("in f5inc\n"); 74 74 //pWrite(rules->getFirst()->getRuleTerm()); 75 75 int j; … … 91 91 // computation of critical pairs with checking of criterion 1 and criterion 2 and saving them 92 92 // in the list critPairs 93 Print("END F5INC\n"); 93 94 criticalPair(gPrev, critPairs, lTag, rTag, rules); 94 95 static LList* sPolyList = new LList(); … … 899 900 //Print("LTAG BEGINNING: %p\n",lTag); 900 901 902 //DEBUGGING STUFF START 903 //Print("NUMBER: %d\n",r->N); 904 int* ev = new int[r->N]; 905 for(i=0;i<IDELEMS(id);i++) { 906 pGetExpV(id->m[i],ev); 907 pWrite(id->m[i]); 908 Print("EXP1: %d\n",ev[1]); 909 Print("EXP2: %d\n",ev[2]); 910 Print("EXP3: %d\n\n",ev[3]); 911 } 912 //delete ev; 913 //DEBUGGING STUFF END 914 901 915 // first element in rTag is first element of rules which is NULL RNode, 902 916 // this must be done due to possible later improvements … … 906 920 RTagList* rTag = new RTagList(rules->getFirst()); 907 921 i = 1; 908 for(j=0; j<IDELEMS(id); j++) {922 /*for(j=0; j<IDELEMS(id); j++) { 909 923 if(NULL != id->m[j]) { 910 924 if(pComparePolys(id->m[j],ONE)) { … … 915 929 } 916 930 } 917 } 931 }*/ 918 932 ideal idNew = kInterRed(id); 919 933 id = idNew; … … 937 951 //idShow(gbPrev); 938 952 //idShow(currQuotient); 939 940 953 for(i=2; i<=IDELEMS(id); i++) { 941 954 LNode* gPrevTag = gPrev->getLast();
Note: See TracChangeset
for help on using the changeset viewer.