Changeset 9cb4078 in git for kernel/f5gb.h


Ignore:
Timestamp:
Mar 4, 2009, 9:23:05 PM (14 years ago)
Author:
Christian Eder
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
Children:
fe880793d1fe5f78cc5038ae512e18c6cbaab42c
Parents:
fcef59fcd75c37051211c94b3423f0d319602d9d
Message:
implemented interreduction, still with lots of bugs => commented out


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

Legend:

Unmodified
Added
Removed

  • kernel/f5gb.h

    rfcef59 r9cb4078  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: f5gb.h,v 1.31 2009-03-01 20:31:54 ederc Exp $ */
     4/* $Id: f5gb.h,v 1.32 2009-03-04 20:23:04 ederc Exp $ */
    55/*
    66* ABSTRACT: f5gb interface
    … …  
    3535==================================================
    3636*/
    37 LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE, LTagList* lTag, RList* rules, RTagList* rTag);
     37inline LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE, LTagList* lTag, RList* rules, RTagList* rTag);
    3838
    3939/*
    … …  
    4747
    4848/*
    49 ================================================================
    50 computes a list of critical pairs for the next reduction process
    51 first element in gPrev is always the newest element which must
    52 build critical pairs with all other elements in gPrev
    53 this is a special version for reduction() in which the first
    54 generator of the critical pair is not tested by criterion2()
    55 as there are no rules added until then to test for
    56 ================================================================
    57 */
    58 void criticalPairRed(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag, RList* rules);
    59 
    60 /*
    6149========================================
    6250Criterion 1, i.e. Faugere's F5 Criterion
    6351========================================
    6452*/
    65 bool criterion1(LList* gPrev, poly t, LNode* l, LTagList* lTag);
     53inline bool criterion1(LList* gPrev, poly t, LNode* l, LTagList* lTag);
    6654
    6755/*
    … …  
    7058=====================================
    7159*/
    72 bool criterion2(poly t, LNode* l, RList* rules, RTagList* rTag);
     60inline bool criterion2(poly t, LNode* l, RList* rules, RTagList* rTag);
    7361
    7462/*
    … …  
    7765==========================================================================================================
    7866*/
    79 bool criterion2(poly t, LPoly* l, RList* rules, Rule* testedRule);
     67inline bool criterion2(poly t, LPoly* l, RList* rules, Rule* testedRule);
    8068
    8169/*
    … …  
    8472==================================
    8573*/
    86 void computeSPols(CNode* first, RTagList* rTag, RList* rules, LList* sPolyList);
     74inline void computeSPols(CNode* first, RTagList* rTag, RList* rules, LList* sPolyList);
    8775
    8876/*
    … …  
    9179========================================================================
    9280*/
    93 void reduction(LList* sPolyList, CList* critPairs, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag,
     81inline void reduction(LList* sPolyList, CList* critPairs, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag,
    9482                 ideal gbPrev);
    9583
    … …  
    10088=====================================================================================
    10189*/
    102 void topReduction(LNode* l, LList* sPolyList, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag, ideal gbPrev);
     90inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag, ideal gbPrev);
    10391
    10492/*
    … …  
    10795=====================================================================
    10896*/
    109 LNode* findReductor(LNode* l, LNode* gPrevRedCheck, LList* gPrev, RList* rules, LTagList* lTag,RTagList* rTag);
     97inline LNode* findReductor(LNode* l, LNode* gPrevRedCheck, LList* gPrev, RList* rules, LTagList* lTag,RTagList* rTag);
    11098
    11199/*
Note: See TracChangeset for help on using the changeset viewer.