44LList*
F5inc(
int i, poly f_i,
LList* gPrev,
LList* reducers, ideal gbPrev, poly ONE,
LTagList* lTag,
RList* rules,
RTagList* rTag,
int plus ,
int termination);
122 ideal gbPrev,
PList* rejectedGBList,
int plus);
129inline void newReduction(
LList* sPolyList,
CListOld* critPairs,
LList* gPrev,
LList* reducers,
RList* rules,
LTagList* lTag,
RTagList* rTag, ideal gbPrev,
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);
174ideal
F5main(ideal
i, ring r,
int opt,
int plus,
int termination);
class PList of lists of PNodes
void criticalPair2(LList *gPrev, CListOld *critPairs, LTagList *lTag, RTagList *rTag, RList *RuleOlds, PList *rejectedGBList)
ideal F5main(ideal i, ring r, int opt, int plus, int termination)
void criticalPair(LList *gPrev, CListOld *critPairs, LTagList *lTag, RTagList *rTag, RList *RuleOlds, PList *rejectedGBList, int plus)
void reduction(LList *sPolyList, CListOld *critPairs, LList *gPrev, RList *RuleOlds, LTagList *lTag, RTagList *rTag, ideal gbPrev, PList *rejectedGBList, int plus)
long sumVector(int *v, int k)
void topReduction(LNode *l, LList *sPolyList, LList *gPrev, CListOld *critPairs, RList *RuleOlds, LTagList *lTag, RTagList *rTag, ideal gbPrev, PList *rejectedGBList, int plus)
bool checkDGB(LList *gPrev)
void newReduction(LList *sPolyList, CListOld *critPairs, LList *gPrev, LList *reducers, RList *rules, LTagList *lTag, RTagList *rTag, ideal gbPrev, int termination, PList *rejectedGBList, int plus)
void qsortDegree(poly *left, poly *right)
void computeSPols(CNode *first, RTagList *rTag, RList *RuleOlds, LList *sPolyList, PList *rejectedGBList)
bool criterion1(LList *gPrev, poly t, LNode *l, LTagList *lTag)
bool criterion2(int idx, poly t, LNode *l, RList *RuleOlds, RTagList *rTag)
LList * F5inc(int i, poly f_i, LList *gPrev, LList *reducers, ideal gbPrev, poly ONE, LTagList *lTag, RList *rules, RTagList *rTag, int plus, int termination)
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)
int computeUsefulMinDeg(CNode *first)
bool compareMonomials(int *m1, int **m2, int numberOfRuleOlds)
LNode * findReductor(LNode *l, LList *sPolyList, LNode *gPrevRedCheck, LList *gPrev, RList *RuleOlds, LTagList *lTag, RTagList *rTag)
bool arrisCheck(CNode *first, LNode *firstGCurr, long arrisdeg)
const Variable & v
< [in] a sqrfree bivariate poly