Changeset 87beab7 in git for kernel/f5gb.h
- Timestamp:
- Feb 11, 2009, 10:24:08 PM (14 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 34fcf813ea36a30ddd0d8107abf9a73b247be289
- Parents:
- c5d8ddb1112344ad68257ea0c296d5b17aee0433
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/f5gb.h
rc5d8dd r87beab7 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: f5gb.h,v 1.2 3 2009-02-08 19:17:54ederc Exp $ */4 /* $Id: f5gb.h,v 1.24 2009-02-11 21:24:07 ederc Exp $ */ 5 5 /* 6 6 * ABSTRACT: f5gb interface … … 35 35 ================================================== 36 36 */ 37 LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE );37 LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE, LTagList* lTag, RList* rules, RTagList* rTag); 38 38 39 39 /* … … 44 44 ================================================================ 45 45 */ 46 CList* criticalPair(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag );46 CList* criticalPair(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag, RList* rules); 47 47 48 48 /* … … 58 58 ===================================== 59 59 */ 60 bool criterion2(poly* t, LNode* l, R TagList* rTag);60 bool criterion2(poly* t, LNode* l, RList* rules, RTagList* rTag); 61 61 62 62 /* … … 65 65 ========================================================================================================== 66 66 */ 67 bool criterion2(poly* t, LPoly* l, R TagList* rTag, Rule* lastRuleTested);67 bool criterion2(poly* t, LPoly* l, RList* rules, Rule* lastRuleTested); 68 68 69 69 /* … … 79 79 ======================================================================== 80 80 */ 81 L Node* reduction(LList* sPolyList, LList* completed, LList* gPrev, LTagList* lTag, RTagList*rTag,81 LList* reduction(LList* &sPolyList, LList* &completed, LList* &gPrev, RList* &rules, LTagList* &lTag, RTagList* &rTag, 82 82 ideal gbPrev); 83 83 … … 88 88 ===================================================================================== 89 89 */ 90 void topReduction(LNode* l, LList* completed, LList* gPrev, LTagList* lTag, RTagList*rTag);90 TopRed* topReduction(LNode* l, LList* &completed, LList* &gPrev, RList* &rules, LTagList* &lTag, RTagList* &rTag); 91 91 92 92 /* … … 95 95 ===================================================================== 96 96 */ 97 L Red* findReductor(LNode* l,LList* completed,LList* gPrev,LTagList* lTag,RTagList*rTag,97 LNode* findReductor(LNode* l,LList* &completed,LList* &gPrev, RList* &rules, LTagList* &lTag,RTagList* &rTag, 98 98 LNode* gPrevRedCheck, LNode* completedRedCheck); 99 99 100 100 /* 101 101 ====================================== 102 main function of our f5 implementation102 main function of our F5 implementation 103 103 ====================================== 104 104 */
Note: See TracChangeset
for help on using the changeset viewer.