Changeset 199ae7 in git for kernel/f5gb.h

Timestamp:

Dec 26, 2008, 2:49:57 PM (14 years ago)

Author:

Christian Eder

Branches:

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

Children:

d72b11bc8b23f633cdb4f322bbbbab31c23597cb

Parents:

565e866c54dc28cc8085355e58a8d9ba2b7e0d2c

Message:

incremental basis


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

File:

• kernel/f5gb.h (modified) (2 diffs)

kernel/f5gb.h

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: f5gb.h,v 1.12 2008-11-27 17:18:05 ederc Exp $ */
+/* $Id: f5gb.h,v 1.13 2008-12-26 13:49:57 ederc Exp $ */
 /*
 * ABSTRACT: f5gb interface
@@ -11 +11 @@
 #ifdef HAVE_F5
 #include "lpolynomial.h"
-#include "lplist.h"
+#include "lists.h"
 
 
-// sort polynomials in ideal i by decreasing total degree
- void qsort_degree(poly* left, poly* right);
+/*
+================================================
+computation of ONE polynomial as global variable
+================================================
+*/
+poly one_poly();
 
 
-// generating the list lp of ideal generators and 
-// test if 1 is in lp(return 1) or not(return 0)
- bool generate_input_list(LPoly* lp, ideal id, poly one);
-
-/* computes incrementally gbs of subsets of the input 
-   gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1}  
+/*
+======================================================
+sort polynomials in ideal i by decreasing total degree
+======================================================
 */
-// lpoly* f5_inc(lpoly* lp, lpoly* g_prev);
+void qsort_degree(poly* left, poly* right);
 
 
-// main function of our f5 implementation
+/*
+==============================================
+generating the list lp of ideal generators and 
+test if 1 is in lp(return 1) or not(return 0)
+==============================================
+*/
+void generate_input_list(LPoly* lp, ideal id, poly one);
+
+
+/*
+==================================================
+computes incrementally gbs of subsets of the input 
+gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1}  
+==================================================
+*/
+LList* F5inc(const long i, LList* g_prev);
+
+
+/*
+======================================
+main function of our f5 implementation
+======================================
+*/
 ideal F5main(ideal i, ring r);
+
+
 #endif
 #endif