163 if (strat->
tl<0)
return 1;
166 int i,
j,at,pass,ei, ii, h_d,ci;
167 unsigned long not_sev;
172 memset(
T,0,
sizeof(
T));
173 memset(C,0,
sizeof(
T));
174 const ring tailRing=strat->
tailRing;
177 d = reddeg =
h->GetpFDeg() +
h->ecart;
178 h->SetShortExpVector();
180 h_p =
h->GetLmTailRing();
206 ei = strat->
T[
j].ecart;
207 li = strat->
T[
j].pLength;
209 if (li<=0) li=strat->
T[
j].GetpLength();
227 if ((((strat->
T[
i].ecart < ei) && (ei>
h->ecart))
228 || ((strat->
T[
i].ecart <=
h->ecart)
229 && (strat->
T[
i].pLength <= li)
233 h_p, not_sev, tailRing))
238 ei = strat->
T[
i].ecart;
239 li = strat->
T[
i].pLength;
240 if (li<=0) li=strat->
T[
i].GetpLength();
253 Print(
"\nwith T[%d]:",ii);
262 int l_orig=strat->
T[ii].pLength;
268 strat->
T[ii].pLength=l_orig;
283 for(
int i=0;
i<=pass;
i++)
293 h->SetShortExpVector();
300 h->ecart = d-h_d+ei-
h->ecart;
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, poly p, const ring r)
int kBucketCanonicalize(kBucket_pt bucket)
Canonicalizes Bpoly, i.e. converts polys of buckets into one poly in one bucket: Returns number of bu...
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, poly *mon, kStrategy strat)
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
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)