=================================================================== RCS file: /home/cvs/OpenXM/src/kan96xx/Kan/gradedset.h,v retrieving revision 1.5 retrieving revision 1.8 diff -u -p -r1.5 -r1.8 --- OpenXM/src/kan96xx/Kan/gradedset.h 2003/07/30 09:00:52 1.5 +++ OpenXM/src/kan96xx/Kan/gradedset.h 2005/06/16 06:54:55 1.8 @@ -1,4 +1,4 @@ -/* $OpenXM: OpenXM/src/kan96xx/Kan/gradedset.h,v 1.4 2003/07/17 09:10:54 takayama Exp $ */ +/* $OpenXM: OpenXM/src/kan96xx/Kan/gradedset.h,v 1.7 2005/06/09 04:09:22 takayama Exp $ */ /* gradedset.h */ #define max(a,b) (a>b?a:b) @@ -38,9 +38,11 @@ int countGradedPolySet(struct gradedPolySet *grD); struct gradedPolySet *gradedPolySetCopy(struct gradedPolySet *grG); int deletePairByCriterion2B(struct gradedPairs *grD,POLY gt,struct gradedPolySet *grG); int markGeneratorInG(struct gradedPolySet *g,int grade,int index); +int clearGmod(struct gradedPolySet *g); /* red.c */ struct spValue (*sp)(POLY f,POLY g); +struct spValue spZero(void); int (*isReducible)(POLY f,POLY g); POLY (*reduction1)(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg); /* if needSyz, then result = *cc f + *cg g. */ @@ -90,11 +92,11 @@ void initSyzRingp(void); struct gradedPolySet *(*groebner)(struct arrayOfPOLY *f, int needBack, int needSyz, struct pair **grP, - int countDown,int forceReduction); + int countDown,int forceReduction,int reduceOnly,int gbCheck); struct gradedPolySet *groebner_gen(struct arrayOfPOLY *f, int needBack, int needSyz, struct pair **grP, - int countDown,int forceReduction); + int countDown,int forceReduction,int reduceOnly,int gbCheck); struct gradedPairs *updatePairs(struct gradedPairs *grD, POLY gt, int gtGrade, int t, struct gradedPolySet *grG); @@ -106,7 +108,7 @@ void toReducedBasis(struct gradedPolySet *grP,int need struct gradedPolySet *groebner_gm(struct arrayOfPOLY *f, int needBack, int needSyz, struct pair **grP, - int countDown,int forceReduction); + int countDown,int forceReduction,int reduceOnly,int gbCheck); /* syz0 */ void simplifyBT(int grd,int index, struct gradedPolySet *grG);