168{
169 if (strat->
tl<0)
return 1;
172 poly h_p;
173 int i,
j,pass,ei, ii, h_d,ci;
174 unsigned long not_sev;
175 long reddeg,d;
176 #define START_REDUCE 512
178 number *
A=(number*)
omAlloc0(red_size*
sizeof(number));
179 poly *C=(poly*)
omAlloc0(red_size*
sizeof(poly));
180 poly *
T=(poly*)
omAlloc0(red_size*
sizeof(poly));
181 const ring tailRing=strat->
tailRing;
182
184 d = reddeg =
h->GetpFDeg() +
h->ecart;
185 h->SetShortExpVector();
186 int li;
187 h_p =
h->GetLmTailRing();
188 not_sev = ~ h->sev;
189
190
192
196 {
199 {
200
207 return 1;
208 }
209
210 ei = strat->
T[
j].ecart;
211 li = strat->
T[
j].pLength;
214
215
216
217
220 {
221 if (li<=0) li=strat->
T[
j].GetpLength();
222 if (li>1)
224 {
225
228 break;
229
230
231 if ((((strat->
T[
i].ecart < ei) && (ei>
h->ecart))
232 || ((strat->
T[
i].ecart <=
h->ecart)
233 && (strat->
T[
i].pLength <= li)
235 &&
237 h_p, not_sev, tailRing))
238 {
239
240
241
242 ei = strat->
T[
i].ecart;
243 li = strat->
T[
i].pLength;
244 if (li<=0) li=strat->
T[
i].GetpLength();
246 if (li==1) break;
247 }
248 }
249 }
250
251
252
253
254#ifdef KDEBUG
256 {
259 Print(
"\nwith T[%d]:",ii);
261 }
262#endif
264
265
266
267
268 int l_orig=strat->
T[ii].pLength;
269
273
275 strat->
T[ii].pLength=l_orig;
276
278
279#ifdef KDEBUG
281 {
285 }
286#endif
288 {
289
290 for(
int i=0;
i<=pass;
i++)
291 {
294 }
301 return 0;
302 }
303 h->SetShortExpVector();
304 not_sev = ~ h->sev;
306
307 if (ei <= h->ecart)
309 else
310 h->ecart = d-h_d+ei-
h->ecart;
311
312
313
314
315
316
317
318 pass++;
321
322 if (pass>=red_size-1)
323 {
324 A=(number*)
omRealloc0Size(
A,red_size*
sizeof(number),2*red_size*
sizeof(number));
325 C=(poly*)
omRealloc0Size(C,red_size*
sizeof(poly),2*red_size*
sizeof(poly));
328 red_size*=2;
329 }
330 }
331}
static poly lazyComp(number *A, poly *M, poly *T, int index, poly s, int *l, const ring tailR)
static void kAppend(poly t, TObject *h)
static poly kSplitAt(int k, TObject *h, kStrategy strat)
void kBucket_Add_q(kBucket_pt bucket, poly q, int *l)
Add to Bucket a poly ,i.e. Bpoly == q+Bpoly.
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, poly *mon, kStrategy strat, BOOLEAN reduce)
int kFindDivisibleByInT(const kStrategy strat, const LObject *L, const int start)
return -1 if no divisor is found number of first divisor in T, otherwise
static void kDeleteLcm(LObject *P)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define omFreeSize(addr, size)
#define omRealloc0Size(addr, o_size, size)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
void PrintS(const char *s)