| version 1.10, 2005/06/16 06:54:55 |
version 1.12, 2005/06/30 08:35:07 |
|
|
| /* $OpenXM: OpenXM/src/kan96xx/Kan/gb.c,v 1.9 2005/06/09 04:09:22 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/gb.c,v 1.11 2005/06/16 08:40:04 takayama Exp $ */ |
| /* untabify on May 4, 2001 */ |
/* untabify on May 4, 2001 */ |
| #include <stdio.h> |
#include <stdio.h> |
| #include "datatype.h" |
#include "datatype.h" |
| Line 199 struct gradedPolySet *groebner_gen(f,needBack,needSyz, |
|
| Line 199 struct gradedPolySet *groebner_gen(f,needBack,needSyz, |
|
| int first; |
int first; |
| int statisticsPL, statisticsCount; |
int statisticsPL, statisticsCount; |
| |
|
| |
if (KanGBmessage) { |
| |
printf("countDown=%d, forceReduction=%d, reduceOnly=%d, gbCheck=%d\n", |
| |
countDown, forceReduction, reduceOnly, gbCheck); |
| |
} |
| if (Statistics) { |
if (Statistics) { |
| for (i=0; i<DMAX; i++) MaxLength[i] = SpNumber[i] = 0; |
for (i=0; i<DMAX; i++) MaxLength[i] = SpNumber[i] = 0; |
| } |
} |
| Line 217 struct gradedPolySet *groebner_gen(f,needBack,needSyz, |
|
| Line 220 struct gradedPolySet *groebner_gen(f,needBack,needSyz, |
|
| Spairs = Criterion1 = Criterion2B = Criterion2F = Criterion2M = 0; |
Spairs = Criterion1 = Criterion2B = Criterion2F = Criterion2M = 0; |
| |
|
| g = newGradedPolySet(INITGRADE); g->gb = 1; |
g = newGradedPolySet(INITGRADE); g->gb = 1; |
| |
if (reduceOnly) g->gb = 2; /* unknown */ |
| d = newGradedPairs(INITGRADE*2); |
d = newGradedPairs(INITGRADE*2); |
| for (i=0; i<g->lim; i++) { |
for (i=0; i<g->lim; i++) { |
| g->polys[i] = newPolySet(INITSIZE); |
g->polys[i] = newPolySet(INITSIZE); |