153 if (
p ==
NULL)
return;
208 if (
p ==
NULL)
return;
255 while (i <= bucket->max_bucket)
297 while (i <= bucket->max_bucket)
347 if (
p ==
NULL)
break;
384 if (
p ==
NULL)
break;
423 while (i <= bucket->max_bucket)
458 return b->buckets[
b->max_bucket].p;
static BOOLEAN length(leftv result, leftv arg)
#define omFreeBin(addr, bin)
#define omGetSpecBin(size)
static int pLength(poly a)
static poly p_Add_q(poly p, poly q, const ring r)
char * p_String(poly p, ring lmRing, ring tailRing)
static poly p_Merge_q(poly p, poly q, const ring r)
static void p_Delete(poly *p, const ring r)
void p_Write0(poly p, ring lmRing, ring tailRing)
static poly p_Copy(poly p, const ring r)
returns a copy of p
void sBucketPrint(sBucket_pt bucket)
char * sBucketString(sBucket_pt bucket)
void sBucketDeleteAndDestroy(sBucket_pt *bucket_pt)
bool sIsEmpty(const sBucket_pt bucket)
Test whether bucket is empty!?
void sBucketClearMerge(sBucket_pt bucket, poly *p, int *length)
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
sBucket_pt sBucketCopy(const sBucket_pt bucket)
Copy sBucket non-intrusive!!!
void sBucket_Merge_p(sBucket_pt bucket, poly p, int length)
Merges p into Spoly: assumes Bpoly and p have no common monoms destroys p!
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
STATIC_VAR omBin sBucket_bin
void sBucketCanonicalize(sBucket_pt bucket)
void sBucketDestroy(sBucket_pt *bucket)
void sBucket_Add_m(sBucket_pt bucket, poly p)
sBucket_pt sBucketCreate(const ring r)
poly sBucketSortMerge(poly p, const ring r)
Sorts p with bucketSort: assumes all monomials of p are different.
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
poly sBucketSortAdd(poly p, const ring r)
Sorts p with bucketSort: p may have equal monomials.
void sBucket_Merge_m(sBucket_pt bucket, poly p)
poly sBucketPeek(sBucket_pt b)
ring sBucketGetRing(const sBucket_pt bucket)
Returns bucket ring.
static int SI_LOG2(int v)