Changeset a9c298 in git for kernel/f5gb.h


Ignore:
Timestamp:
Nov 20, 2013, 4:54:25 PM (9 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
0de0509972719531e2a4b51ec9fd0e44a66fd2fd
Parents:
e4014563a82388c4b39dfa37db24cbe159b24a35
git-author:
Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-11-20 16:54:25+01:00
git-committer:
Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-11-20 16:54:42+01:00
Message:
format stuff
File:
1 edited

Legend:

Unmodified
Added
Removed

  • kernel/f5gb.h

    re40145 ra9c298  
    3838/*
    3939==================================================
    40 computes incrementally gbs of subsets of the input 
    41 gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1} 
     40computes incrementally gbs of subsets of the input
     41gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1}
    4242==================================================
    4343*/
    … …  
    4747================================================================
    4848computes a list of critical pairs for the next reduction process
    49 the first element is always "useful" thus the critical pair 
    50 computed is either "useful" or "useless" depending on the second 
     49the first element is always "useful" thus the critical pair
     50computed is either "useful" or "useless" depending on the second
    5151element which generates the critical pair.
    5252first element in gPrev is always the newest element which must
    … …  
    6464 * Checks all remaining critical pairs, i.e. those of higher degree,
    6565 * by the two Buchberger criteria.
    66  * return value: 0, if all remaining critical pairs are deleted by 
     66 * return value: 0, if all remaining critical pairs are deleted by
    6767 *                  Buchberger's criteria
    6868 *               1, otherwise
    6969 */
    70 bool arrisCheck(CNode* first,LNode* firstGCurr, long arrisdeg); 
     70bool arrisCheck(CNode* first,LNode* firstGCurr, long arrisdeg);
    7171
    7272/*
    7373================================================================
    7474computes a list of critical pairs for the next reduction process
    75 the first element is always "useless" thus the critical pair 
     75the first element is always "useless" thus the critical pair
    7676computed is "useless".
    7777first element in gPrev is always the newest element which must
    … …  
    131131/*!
    132132 * ================================================================================
    133  * searches for reducers of temp similar to the symbolic preprocessing of F4  and 
     133 * searches for reducers of temp similar to the symbolic preprocessing of F4  and
    134134 * divides them into a "good" and "bad" part:
    135  * 
     135 *
    136136 * the "good" ones are the reducers which do not corrupt the label of temp, with
    137137 * these the normal form of temp is computed
    138138 *
    139  * the "bad" ones are the reducers which corrupt the label of temp, they are tested 
     139 * the "bad" ones are the reducers which corrupt the label of temp, they are tested
    140140 * later on for possible new RuleOlds and S-polynomials to be added to the algorithm
    141141 * ================================================================================
    142142 */
    143 void findReducers(LNode* l, LList* sPolyList, ideal gbPrev, LList* gPrev, LList* reducers, CListOld* critPairs, RList* rules, LTagList* lTag, RTagList* rTag, int termination, PList* rejectedGBList, int plus); 
     143void findReducers(LNode* l, LList* sPolyList, ideal gbPrev, LList* gPrev, LList* reducers, CListOld* critPairs, RList* rules, LTagList* lTag, RTagList* rTag, int termination, PList* rejectedGBList, int plus);
    144144
    145145/*
    … …  
    149149=====================================================================================
    150150*/
    151 inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, CListOld* critPairs, RList* RuleOlds, LTagList* lTag, RTagList* rTag, ideal gbPrev, PList* rejectedGBList, int plus); 
     151inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, CListOld* critPairs, RList* RuleOlds, LTagList* lTag, RTagList* rTag, ideal gbPrev, PList* rejectedGBList, int plus);
    152152
    153153/*
    … …  
    159159
    160160poly p_MergeEq_q(poly p, poly q, const ring r);
    161 */   
     161*/
    162162/*
    163163=====================================================================
Note: See TracChangeset for help on using the changeset viewer.