148 ring new_tailRing,
omBin new_tailBin,
159 #define kbTest(bucket) do {} while (0)
171 #ifdef BUCKET_TWO_BASE
172 #define MAX_BUCKET 28
174 #define MAX_BUCKET 14 // suitable for polys up to a length of 4^14 = 2^28
180 #ifdef HAVE_PSEUDO_BUCKETS
185 #ifdef HAVE_COEF_BUCKETS
194 #ifndef HAVE_PSEUDO_BUCKETS
197 while ( bucket->buckets_used > 0 &&
198 bucket->buckets[bucket->buckets_used] ==
NULL)
199 (bucket->buckets_used)--;
209 #ifdef HAVE_COEF_BUCKETS
213 poly& lead = bucket->buckets[0];
216 _p_kBucketSetLm(bucket);
218 #ifdef HAVE_COEF_BUCKETS
233 #ifdef HAVE_COEF_BUCKETS
236 bucket->buckets[0] =
NULL;
237 bucket->buckets_length[0] = 0;
CFFList append(const CFFList &Inputlist, const CFFactor &TheFactor)
poly kBucket_ExtractLarger_Add_q(kBucket_pt bucket, poly append, poly q, int *lq)
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 kBucketAdjust(kBucket_pt bucket, int i)
Bucket number i from bucket is out of length sync, resync.
void kBucketSimpleContent(kBucket_pt bucket)
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) ...
BOOLEAN kbTest(kBucket_pt bucket)
Tests.
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
poly kBucketExtractLmOfBucket(kBucket_pt bucket, int i)
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNother=NULL)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m (TODO: rename into kBucket_Minus_mm...
const CanonicalForm CFMap CFMap int &both_non_zero int n
#define MAX_BUCKET
Bucket definition (should be no one elses business, though)
void kBucketInit(kBucket_pt bucket, poly p, int length)
poly kBucketExtractLm(kBucket_pt bucket)
void kBucket_Add_q(kBucket_pt bucket, poly q, int *lq)
Add to Bucket a poly ,i.e. Bpoly == Bpoly + q.
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
void kBucketDeleteAndDestroy(kBucket_pt *bucket)
kBucket_pt kBucketCreate(ring r)
Creation/Destruction of buckets.
void kBucketDestroy(kBucket_pt *bucket)
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
The main handler for Singular numbers which are suitable for Singular polynomials.
void kBucketSetLm(kBucket_pt bucket, poly lm)
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...
void kBucketTakeOutComp(kBucket_pt bucket, long comp, poly *p, int *l)
void(* p_kBucketSetLm_Proc_Ptr)(kBucket_pt bucket)
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...
poly kBucketGetLm(kBucket_pt bucket, p_kBucketSetLm_Proc_Ptr _p_kBucketSetLm)
number kBucketPolyRed(kBucket_pt bucket, poly p, int l, poly spNoether)
BOOLEAN kBucketIsCleared(kBucket_pt bucket)
int kBucketCanonicalize(kBucket_pt bucket)
int ksCheckCoeff(number *a, number *b, const coeffs r)