18 #ifdef HAVE_COEF_BUCKETS 19 #define USE_COEF_BUCKETS 22 #ifdef USE_COEF_BUCKETS 24 #define MULTIPLY_BUCKET(B,I) do \ 25 { if (B->coef[I]!=NULL) \ 27 assume(p_IsConstant(B->Coef[i],B->bucket->ring)); \ 28 B->buckets[I]=p_Mult_q(B->buckets[I],B->coef[I],B->bucket_ring); \ 32 if (rField_is_Ring(B->bucket_ring)) B->buckets_length[i] = pLength(B->buckets[i]); 34 #define MULTIPLY_BUCKET(B,I) do \ 35 { if (B->coef[I]!=NULL) \ 37 B->buckets[I]=p_Mult_q(B->buckets[I],B->coef[I],B->bucket_ring); \ 43 #define MULTIPLY_BUCKET(B,I) 46 #ifdef USE_COEF_BUCKETS 47 static int coef_start=1;
61 #ifdef BUCKET_TWO_BASE 62 while ((l = (l >> 1))) i++;
64 while ((l = (l >> 2))) i++;
77 #ifndef HAVE_PSEUDO_BUCKETS 80 #ifdef USE_COEF_BUCKETS 82 if ((bucket->coef[i]!=
NULL) && (bucket->buckets[i]==
NULL))
86 if (bucket->coef[i]!=
NULL)
93 if (bucket->buckets_length[i] !=
pLength(bucket->buckets[i]))
95 dReportError(
"Bucket %d lengths difference should:%d has:%d",
96 i, bucket->buckets_length[i],
pLength(bucket->buckets[i]));
98 else if (i > 0 && (
int)
pLogLength(bucket->buckets_length[i]) > i)
101 i, bucket->buckets_length[i]);
103 if (i==0 && bucket->buckets_length[0] > 1)
113 #ifdef HAVE_COEF_BUCKETS 117 poly lm = bucket->buckets[0];
121 if (! kbTest_i(bucket, 0))
return FALSE;
122 for (i=1; i<= (int) bucket->buckets_used; i++)
124 if (!kbTest_i(bucket, i))
return FALSE;
125 if (lm !=
NULL && bucket->buckets[i] !=
NULL 142 if (bucket->buckets[i] !=
NULL || bucket->buckets_length[i] != 0)
150 if (bucket->buckets[i]!=
NULL)
155 if (bucket->buckets[j]==bucket->buckets[i])
162 #ifdef HAVE_COEF_BUCKETS 163 if (bucket->coef[i]!=
NULL)
168 if (bucket->coef[j]==bucket->coef[i])
180 #else // HAVE_PSEUDO_BUCKETS 185 #endif // ! HAVE_PSEUDO_BUCKETS 212 for (i=0; i<= bucket->buckets_used; i++)
215 if (bucket->buckets[i] !=
NULL)
218 #ifdef USE_COEF_BUCKETS 219 if (bucket->coef[i]!=
NULL)
231 #ifndef HAVE_PSEUDO_BUCKETS 236 if (bucket->buckets[0] !=
NULL)
238 poly lm = bucket->buckets[0];
240 #ifdef BUCKET_TWO_BASE 242 while ( bucket->buckets_length[i] >= l)
249 while ( bucket->buckets_length[i] >= l)
255 #ifndef USE_COEF_BUCKETS 257 pNext(lm) = bucket->buckets[
i];
258 bucket->buckets[
i] = lm;
259 bucket->buckets_length[
i]++;
260 assume(i <= bucket->buckets_used+1);
261 if (i > bucket->buckets_used) bucket->buckets_used =
i;
262 bucket->buckets[0] =
NULL;
263 bucket->buckets_length[0] = 0;
266 if (i > bucket->buckets_used) bucket->buckets_used =
i;
268 if (bucket->buckets[i]!=
NULL)
271 pNext(lm) = bucket->buckets[
i];
272 bucket->buckets[
i] = lm;
273 bucket->buckets_length[
i]++;
274 assume(i <= bucket->buckets_used+1);
286 bucket->buckets[
i]=lm;
287 bucket->buckets_length[
i]=1;
290 bucket->buckets[
i]=lm;
291 bucket->buckets_length[
i]=1;
294 pNext(lm) = bucket->buckets[
i];
295 bucket->buckets[
i] = lm;
296 bucket->buckets_length[
i]++;
297 assume(i <= bucket->buckets_used+1);
300 bucket->buckets[0]=
NULL;
301 bucket->buckets_length[0] = 0;
302 bucket->coef[0]=
NULL;
315 if (bucket->buckets[i] !=
NULL)
return FALSE;
316 #ifdef HAVE_COEF_BUCKETS 317 if (bucket->coef[i] !=
NULL)
return FALSE;
319 if (bucket->buckets_length[i] != 0)
return FALSE;
331 if (lm ==
NULL)
return;
336 bucket->buckets[0] = lm;
337 #ifdef HAVE_COEF_BUCKETS 340 #ifdef USE_COEF_BUCKETS 341 bucket->coef[0]=
NULL;
344 bucket->buckets_length[0] = 1;
346 bucket->buckets_length[0]= 0;
350 bucket->buckets[
i] =
pNext(lm);
352 bucket->buckets_length[
i] = length-1;
353 bucket->buckets_used =
i;
357 bucket->buckets_used = 0;
366 poly p = bucket->buckets[1];
368 int pl = bucket->buckets_length[1];
370 bucket->buckets[1] =
NULL;
371 bucket->buckets_length[1] = 0;
372 #ifdef USE_COEF_BUCKETS 378 for (i=1; i<=bucket->buckets_used; i++)
380 #ifdef USE_COEF_BUCKETS 381 if (bucket->coef[i]!=
NULL)
385 pl, bucket->buckets_length[i], r);
390 p =
p_Add_q(p, bucket->buckets[i],
391 pl, bucket->buckets_length[i], r);
393 p =
p_Add_q(p, bucket->buckets[i],
394 pl, bucket->buckets_length[i], r);
397 bucket->buckets[
i] =
NULL;
398 bucket->buckets_length[
i] = 0;
400 #ifdef HAVE_COEF_BUCKETS 403 lm = bucket->buckets[0];
409 bucket->buckets[0] =
NULL;
410 bucket->buckets_length[0] = 0;
415 bucket->buckets[
i] =
p;
416 bucket->buckets_length[
i] = pl;
422 bucket->buckets_used =
i;
424 #ifdef USE_COEF_BUCKETS 439 #ifdef USE_COEF_BUCKETS 443 *p = bucket->buckets[
i];
444 *length = bucket->buckets_length[
i];
445 bucket->buckets[
i] =
NULL;
446 bucket->buckets_length[
i] = 0;
447 bucket->buckets_used = 0;
459 kBucketMergeLm(bucket);
461 bucket->buckets[0] = lm;
462 bucket->buckets_length[0] = 1;
465 #else // HAVE_PSEUDO_BUCKETS 475 if (length <= 0) bucket->
l =
pLength(lm);
476 else bucket->
l = length;
504 #endif // ! HAVE_PSEUDO_BUCKETS 510 ring new_tailRing,
omBin new_tailBin,
513 #ifndef HAVE_PSEUDO_BUCKETS 517 for (i=0; i<= bucket->buckets_used; i++)
518 if (bucket->buckets[i] !=
NULL)
521 bucket->buckets[
i] = p_shallow_copy_delete(bucket->buckets[i],
527 bucket->
p = p_shallow_copy_delete(p,
543 int l1 = bucket->buckets_length[
i];
544 poly p1 = bucket->buckets[
i];
545 bucket->buckets[
i] =
NULL;
546 bucket->buckets_length[
i] = 0;
549 while (bucket->buckets[i] !=
NULL)
553 p1 =
p_Add_q(p1, bucket->buckets[i],
554 l1, bucket->buckets_length[i], bucket->
bucket_ring);
555 bucket->buckets[
i] =
NULL;
556 bucket->buckets_length[
i] = 0;
560 bucket->buckets[
i] = p1;
561 bucket->buckets_length[
i]=l1;
562 if (i >= bucket->buckets_used)
563 bucket->buckets_used =
i;
565 kBucketAdjustBucketsUsed(bucket);
574 #ifndef HAVE_PSEUDO_BUCKETS 579 for (i=0; i<= bucket->buckets_used; i++)
581 if (bucket->buckets[i] !=
NULL)
583 #ifdef USE_COEF_BUCKETS 585 bucket->buckets[
i] =
p_Mult_nn(bucket->buckets[i], n, r);
595 bucket->buckets_length[
i] =
pLength(bucket->buckets[i]);
599 if (bucket->coef[i]!=
NULL)
601 bucket->coef[
i] =
p_Mult_nn(bucket->coef[i],n,r);
608 bucket->buckets[
i] =
p_Mult_nn(bucket->buckets[i], n, r);
611 bucket->buckets_length[
i] =
pLength(bucket->buckets[i]);
630 if (q ==
NULL)
return;
644 kBucketMergeLm(bucket);
648 while (bucket->buckets[i] !=
NULL)
651 #ifdef USE_COEF_BUCKETS 652 if (bucket->coef[i]!=
NULL)
655 l1, bucket->buckets_length[i], r);
660 q =
p_Add_q(q, bucket->buckets[i],
661 l1, bucket->buckets_length[i], r);
663 q =
p_Add_q(q, bucket->buckets[i],
664 l1, bucket->buckets_length[i], r);
666 bucket->buckets[
i] =
NULL;
667 bucket->buckets_length[
i] = 0;
674 bucket->buckets[
i] = q;
675 bucket->buckets_length[
i]=l1;
676 if (i >= bucket->buckets_used)
677 bucket->buckets_used =
i;
679 kBucketAdjustBucketsUsed(bucket);
708 #ifndef HAVE_PSEUDO_BUCKETS 709 kBucketMergeLm(bucket);
713 #if defined(HAVE_PLURAL) 726 if ((i <= bucket->buckets_used) && (bucket->buckets[i] !=
NULL))
728 assume(
pLength(bucket->buckets[i])==bucket->buckets_length[i]);
742 bucket->buckets_length[i], l1,
744 l1 = bucket->buckets_length[
i];
745 bucket->buckets[
i] =
NULL;
746 bucket->buckets_length[
i] = 0;
752 if (spNoether !=
NULL)
755 p1 = r->p_Procs->pp_Mult_mm_Noether(p1, m, spNoether, l1, r);
760 p1 = r->p_Procs->pp_Mult_mm(p1, m, r);
766 while (bucket->buckets[i] !=
NULL)
770 p1 =
p_Add_q(p1, bucket->buckets[i],
771 l1, bucket->buckets_length[i], r);
772 bucket->buckets[
i] =
NULL;
773 bucket->buckets_length[
i] = 0;
777 bucket->buckets[
i] = p1;
778 bucket->buckets_length[
i]=l1;
779 if (i >= bucket->buckets_used)
780 bucket->buckets_used =
i;
782 kBucketAdjustBucketsUsed(bucket);
783 #else // HAVE_PSEUDO_BUCKETS 813 kBucketMergeLm(bucket);
816 #ifdef USE_COEF_BUCKETS 819 if (i <= bucket->buckets_used && bucket->buckets[i] !=
NULL)
822 #ifdef USE_COEF_BUCKETS 823 if ((bucket->coef[i]!=
NULL) &&(i>=coef_start))
825 number orig_coef=
p_GetCoeff(bucket->coef[i],r);
829 number
gcd=
n_Gcd(add_coef, orig_coef,r);
833 number orig_coef2=
n_ExactDiv(orig_coef,gcd,r);
837 orig_coef=orig_coef2;
849 bucket->buckets[
i]=
p_Mult_nn(bucket->buckets[i],orig_coef,r);
855 bucket->buckets_length[i], l1, r);
856 l1=bucket->buckets_length[
i];
857 bucket->buckets[
i]=
NULL;
858 bucket->buckets_length[
i] = 0;
869 bucket->buckets_length[i], l1, r);
870 l1 = bucket->buckets_length[
i];
871 bucket->buckets[
i] =
NULL;
872 bucket->buckets_length[
i] = 0;
878 #ifdef USE_COEF_BUCKETS 887 p1 = r->p_Procs->pp_Mult_mm(p1, m, r);
888 #ifdef USE_COEF_BUCKETS 894 while ((bucket->buckets[i] !=
NULL) && (p1!=
NULL))
897 #ifdef USE_COEF_BUCKETS 898 if ((bucket->coef[i]!=
NULL) &&(i>=coef_start))
900 number orig_coef=
p_GetCoeff(bucket->coef[i],r);
903 number add_coef=
n_Copy(n,r);
904 number
gcd=
n_Gcd(add_coef, orig_coef,r);
908 number orig_coef2=
n_ExactDiv(orig_coef,gcd,r);
913 orig_coef=orig_coef2;
919 bucket->buckets[
i]=
p_Mult_nn(bucket->buckets[i],orig_coef,r);
922 p1 =
p_Add_q(p1, bucket->buckets[i],r);
925 bucket->buckets[
i]=
NULL;
935 #ifdef USE_COEF_BUCKETS 944 p1 =
p_Add_q(p1, bucket->buckets[i],
945 l1, bucket->buckets_length[i], r);
946 bucket->buckets[
i] =
NULL;
947 bucket->buckets_length[
i] = 0;
952 bucket->buckets[
i] = p1;
953 #ifdef USE_COEF_BUCKETS 962 bucket->coef[
i]=
NULL;
966 if ((p1==
NULL) && (bucket->coef[i]!=
NULL))
969 bucket->buckets_length[
i]=l1;
970 if (i > bucket->buckets_used)
971 bucket->buckets_used =
i;
973 kBucketAdjustBucketsUsed(bucket);
1019 #ifndef HAVE_PSEUDO_BUCKETS 1020 kBucketMergeLm(bucket);
1021 for (i=1; i<=bucket->buckets_used; i++)
1023 if (bucket->buckets[i] !=
NULL)
1030 bucket->buckets_length[
i] -= lq;
1031 assume(
pLength(bucket->buckets[i]) == bucket->buckets_length[i]);
1036 kBucketAdjustBucketsUsed(bucket);
1088 if ((ct == 0) || (ct == 2))
1153 #ifndef USE_COEF_BUCKETS 1156 static BOOLEAN nIsPseudoUnit(number n, ring r)
1163 return (
n_Size(n,r->cf)==1);
1182 if ((bucket->buckets[i]!=
NULL) && (bucket->coef[i]==
NULL))
1193 if ((bucket->buckets[i]!=
NULL)
1194 && (nIsPseudoUnit(
p_GetCoeff(bucket->coef[i],r),r)))
1209 if (bucket->buckets[i]!=
NULL)
1218 if (nIsPseudoUnit(coef,r))
1235 if (bucket->buckets[i]!=
NULL)
1253 poly p=bucket->buckets[
i];
1254 bucket->buckets_length[
i]--;
1255 #ifdef USE_COEF_BUCKETS 1257 if (bucket->coef[i]!=
NULL)
1263 p=bucket->buckets[
i];
1264 bucket->buckets[
i]=
NULL;
1269 bucket->buckets[
i]=
next;
1280 bucket->buckets[
i]=
pNext(bucket->buckets[i]);
1301 number an = *
a, bn = *
b;
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
CFFList append(const CFFList &Inputlist, const CFFactor &TheFactor)
BOOLEAN kbTest(kBucket_pt bucket)
Tests.
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ...
poly kBucketExtractLmOfBucket(kBucket_pt bucket, int i)
#define MULTIPLY_BUCKET(B, I)
void kBucketShallowCopyDelete(kBucket_pt bucket, ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete)
For changing the ring of the Bpoly to new_tailBin.
void kBucketInit(kBucket_pt bucket, poly lm, int length)
void p_TakeOutComp(poly *p, long comp, poly *q, int *lq, const ring r)
number kBucketPolyRed(kBucket_pt bucket, poly p1, int l1, poly spNoether)
static FORCE_INLINE BOOLEAN n_IsOne(number n, const coeffs r)
TRUE iff 'n' represents the one element.
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
const poly kBucketGetLm(kBucket_pt bucket)
int ksCheckCoeff(number *a, number *b)
#define MAX_BUCKET
Bucket definition (should be no one elses business, though)
static poly pp_Mult_mm(poly p, poly m, const ring r)
static BOOLEAN rField_is_Domain(const ring r)
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
static char const ** rParameter(const ring r)
(r->cf->parameter)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
static number p_SetCoeff(poly p, number n, ring r)
static int pLength(poly a)
poly kBucketExtractLm(kBucket_pt bucket)
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
#define pFalseReturn(cond)
poly kBucket_ExtractLarger(kBucket_pt bucket, poly q, poly append)
Extract all monomials of bucket which are larger than q Append those to append, and return last monom...
Coefficient rings, fields and other domains suitable for Singular polynomials.
void kBucketDestroy(kBucket_pt *bucket_pt)
static void p_SetCompP(poly p, int i, ring r)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static BOOLEAN p_IsConstant(const poly p, const ring r)
The main handler for Singular numbers which are suitable for Singular polynomials.
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
static BOOLEAN p_DivisibleBy(poly a, poly b, const ring r)
void kBucketSetLm(kBucket_pt bucket, poly lm)
static int p_LmCmp(poly p, poly q, const ring r)
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
void kBucketSimpleContent(kBucket_pt)
#define omCheckAddrBin(addr, bin)
void PrintS(const char *s)
static void p_ExpVectorSub(poly p1, poly p2, const ring r)
static poly p_Mult_nn(poly p, number n, const ring r)
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNoether)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m assume (*l <= 0 || pLength(p) == *l...
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
void kBucketAdjust(kBucket_pt bucket, int i)
Bucket number i from bucket is out of length sync, resync.
static BOOLEAN rField_is_Zp(const ring r)
static void p_Delete(poly *p, const ring r)
#define omGetSpecBin(size)
#define p_LmEqual(p1, p2, r)
unsigned int pLogLength(unsigned int l)
Some internal stuff.
poly(* pShallowCopyDeleteProc)(poly s_p, ring source_r, ring dest_r, omBin dest_bin)
returns a poly from dest_r which is a ShallowCopy of s_p from source_r assumes that source_r->N == de...
static BOOLEAN rField_is_Ring(const ring r)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
void kBucket_Plus_mm_Mult_pp(kBucket_pt bucket, poly m, poly p, int l)
Bpoly == Bpoly + m*p; where m is a monom Does not destroy p and m assume (l <= 0 || pLength(p) == l) ...
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
static FORCE_INLINE number n_ExactDiv(number a, number b, const coeffs r)
assume that there is a canonical subring in cf and we know that division is possible for these a and ...
static void p_Setm(poly p, const ring r)
static poly p_Minus_mm_Mult_qq(poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r)
static FORCE_INLINE number n_SubringGcd(number a, number b, const coeffs r)
int dReportError(const char *fmt,...)
static void p_LmDelete(poly p, const ring r)
#define p_SetCoeff0(p, n, r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE BOOLEAN n_IsMOne(number n, const coeffs r)
TRUE iff 'n' represents the additive inverse of the one element, i.e. -1.
static poly p_Add_q(poly p, poly q, const ring r)
BOOLEAN kBucketIsCleared(kBucket_pt bucket)
#define omFreeBin(addr, bin)
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
int kBucketCanonicalize(kBucket_pt bucket)
static FORCE_INLINE int n_Size(number n, const coeffs r)
return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used fo...
void kBucketDeleteAndDestroy(kBucket_pt *bucket_pt)
void kBucketTakeOutComp(kBucket_pt bucket, long comp, poly *r_p, int *l)
static poly p_Plus_mm_Mult_qq(poly p, poly m, poly q, int &lp, int lq, const ring r)
void kBucket_Add_q(kBucket_pt bucket, poly q, int *l)
Add to Bucket a poly ,i.e. Bpoly == q+Bpoly.