Changeset 418bd6 in git for kernel/f5gb.h

Timestamp:

Oct 1, 2009, 3:40:16 PM (13 years ago)

Author:

Christian Eder

Branches:

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

Children:

963eebd7c227d74888d6c990014a2db02a856401

Parents:

1d9469b7feae9ba3731cc5bd89f2a2a7f1611efd

Message:

added idea for termination of F5: split critical pairs in "useful" and "useless"
ones, check later on if there are "useful" ones left, else terminate the algorithm.


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

File:

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

kernel/f5gb.h

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: f5gb.h,v 1.44 2009-08-31 13:55:46 ederc Exp $ */
+/* $Id: f5gb.h,v 1.45 2009-10-01 13:40:16 ederc Exp $ */
 /*
 * ABSTRACT: f5gb interface
@@ -48 +48 @@
 ================================================================
 computes a list of critical pairs for the next reduction process
+the first element is always "useful" thus the critical pair 
+computed is either "useful" or "useless" depending on the second 
+element which generates the critical pair.
 first element in gPrev is always the newest element which must
 build critical pairs with all other elements in gPrev
@@ -53 +56 @@
 */
 void criticalPair(LList* gPrev, CListOld* critPairs, LTagList* lTag, RTagList* rTag, RList* RuleOlds);
+
+/*
+================================================================
+computes a list of critical pairs for the next reduction process
+the first element is always "useless" thus the critical pair 
+computed is "useless".
+first element in gPrev is always the newest element which must
+build critical pairs with all other elements in gPrev
+================================================================
+*/
+void criticalPair2(LList* gPrev, CListOld* critPairs, LTagList* lTag, RTagList* rTag, RList* RuleOlds);
 
 /*