Changeset d51339 in git for kernel/f5gb.h


Ignore:
Timestamp:
Feb 18, 2009, 9:43:05 PM (14 years ago)
Author:
Christian Eder
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
eab144e3329d02244a62975d1bb6e77d4754f131
Parents:
93a7f7b1c20c3c886dd4dff521c518039f3824e7
Message:
new written reduction process, still problems getting the right rules in criterion2()
->lastRuleTested shouldnt be part of the CPair as it is a characteristic of an LPoly


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

Legend:

Unmodified
Added
Removed

  • kernel/f5gb.h

    r93a7f7 rd51339  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: f5gb.h,v 1.26 2009-02-16 14:23:42 ederc Exp $ */
     4/* $Id: f5gb.h,v 1.27 2009-02-18 20:43:05 ederc Exp $ */
    55/*
    66* ABSTRACT: f5gb interface
    … …  
    4444================================================================
    4545*/
    46 CList* criticalPair(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag, RList* rules);
     46void criticalPair(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag, RList* rules);
     47
     48/*
     49================================================================
     50computes a list of critical pairs for the next reduction process
     51first element in gPrev is always the newest element which must
     52build critical pairs with all other elements in gPrev
     53NOTE: this is a special version for the call inside reduction()
     54      which adds to the already existing critical pairs new ones
     55================================================================
     56*/
     57void criticalPairRed(LList* gPrev, CList* critPairs, LTagList* lTag, RTagList* rTag, RList* rules);
    4758
    4859/*
    … …  
    5162========================================
    5263*/
    53 bool criterion1(poly* t, LNode* l, LTagList* lTag);
     64bool criterion1(LList* gPrev, poly t, LNode* l, LTagList* lTag);
    5465
    5566/*
    … …  
    5869=====================================
    5970*/
    60 bool criterion2(poly* t, LNode* l, RList* rules, RTagList* rTag);
     71bool criterion2(poly t, LNode* l, RList* rules, RTagList* rTag);
    6172
    6273/*
    … …  
    6576==========================================================================================================
    6677*/
    67 bool criterion2(poly* t, LPoly* l, RList* rules, Rule* lastRuleTested);
     78bool criterion2(poly t, LPoly* l, RList* rules, Rule* lastRuleTested);
    6879
    6980/*
    … …  
    7990========================================================================
    8091*/
    81 void reduction(LList* sPolyList, LList* completed, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag,
     92void reduction(LList* sPolyList, CList* critPairs, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag,
    8293                 ideal gbPrev);
    8394
    … …  
    8899=====================================================================================
    89100*/
    90 void topReduction(LNode* l, LList* completed, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag);
     101void topReduction(LNode* l, LList* sPolyList, LList* gPrev, RList* rules, LTagList* lTag, RTagList* rTag);
    91102
    92103/*
    … …  
    95106=====================================================================
    96107*/
    97 LNode* findReductor(LNode* l,LList* completed,LList* gPrev, RList* rules, LTagList* lTag,RTagList* rTag,
    98                     LNode* gPrevRedCheck);
     108LNode* findReductor(LNode* l, LList* gPrev, RList* rules, LTagList* lTag,RTagList* rTag);
    99109
    100110/*
Note: See TracChangeset for help on using the changeset viewer.