Changeset 199ae7 in git for kernel/f5gb.h
 Timestamp:
 Dec 26, 2008, 2:49:57 PM (14 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
 Children:
 d72b11bc8b23f633cdb4f322bbbbab31c23597cb
 Parents:
 565e866c54dc28cc8085355e58a8d9ba2b7e0d2c
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

kernel/f5gb.h
r565e86 r199ae7 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: f5gb.h,v 1.1 2 20081127 17:18:05ederc Exp $ */4 /* $Id: f5gb.h,v 1.13 20081226 13:49:57 ederc Exp $ */ 5 5 /* 6 6 * ABSTRACT: f5gb interface … … 11 11 #ifdef HAVE_F5 12 12 #include "lpolynomial.h" 13 #include "l plist.h"13 #include "lists.h" 14 14 15 15 16 // sort polynomials in ideal i by decreasing total degree 17 void qsort_degree(poly* left, poly* right); 16 /* 17 ================================================ 18 computation of ONE polynomial as global variable 19 ================================================ 20 */ 21 poly one_poly(); 18 22 19 23 20 // generating the list lp of ideal generators and 21 // test if 1 is in lp(return 1) or not(return 0) 22 bool generate_input_list(LPoly* lp, ideal id, poly one); 23 24 /* computes incrementally gbs of subsets of the input 25 gb{f_m} > gb{f_m,f_(m1)} > gb{f_m,...,f_1} 24 /* 25 ====================================================== 26 sort polynomials in ideal i by decreasing total degree 27 ====================================================== 26 28 */ 27 // lpoly* f5_inc(lpoly* lp, lpoly* g_prev);29 void qsort_degree(poly* left, poly* right); 28 30 29 31 30 // main function of our f5 implementation 32 /* 33 ============================================== 34 generating the list lp of ideal generators and 35 test if 1 is in lp(return 1) or not(return 0) 36 ============================================== 37 */ 38 void generate_input_list(LPoly* lp, ideal id, poly one); 39 40 41 /* 42 ================================================== 43 computes incrementally gbs of subsets of the input 44 gb{f_m} > gb{f_m,f_(m1)} > gb{f_m,...,f_1} 45 ================================================== 46 */ 47 LList* F5inc(const long i, LList* g_prev); 48 49 50 /* 51 ====================================== 52 main function of our f5 implementation 53 ====================================== 54 */ 31 55 ideal F5main(ideal i, ring r); 56 57 32 58 #endif 33 59 #endif
Note: See TracChangeset
for help on using the changeset viewer.