OpenXM/src/kan96xx/Kan/gradedset.h - diff

Return to gradedset.h CVS log

Up to [local] / OpenXM / src / kan96xx / Kan

version 1.2, 2000/01/16 07:55:39

version 1.5, 2003/07/30 09:00:52

Line 1

/* $OpenXM$ */

/* $OpenXM: OpenXM/src/kan96xx/Kan/gradedset.h,v 1.4 2003/07/17 09:10:54 takayama Exp $ */

/* gradedset.h */

#define max(a,b) (a>b?a:b)

Line 37 int countPairs(struct gradedPairs *grD);

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);

/* red.c */

struct spValue (*sp)(POLY f,POLY g);

Line 70 POLY lcm_gen(POLY f,POLY g);

Line 71 POLY lcm_gen(POLY f,POLY g);

struct spValue sp_gen(POLY f,POLY g);

struct spValue sp_q(POLY f,POLY g);

int grade_gen(POLY f);

POLY reductionCdr_except_grd_i(POLY f,struct gradedPolySet *gset,

int needSyz,struct syz0 *syzp,

int grd,int i, int *reduced);

/* Polynomial at (grd,i) is not used for reduction.

if del[j] == 1, then the attached polynomial is not used for reduction.*/

/* ecart.c */

POLY reduction_ecart(POLY f,struct gradedPolySet *gset,

int needSyz,struct syz0 *syzp);

/* constructor */

POLY toSyzPoly(POLY cg,int grade,int index);

struct coeff *toSyzCoeff(POLY f);

Line 89 struct gradedPairs *updatePairs(struct gradedPairs *gr

Line 99 struct gradedPairs *updatePairs(struct gradedPairs *gr

int gtGrade, int t,

struct gradedPolySet *grG);

/* add gt to grD. gt is indexed by (gtGrade,t) */

void toReducedBasis(struct gradedPolySet *grP,int needBack, int needSyz);

/* gbGM.c */

struct gradedPolySet *groebner_gm(struct arrayOfPOLY *f,