Go to the source code of this file.
|
sBucket_pt | sBucketCreate (ring r) |
|
void | sBucketDestroy (sBucket_pt *bucket) |
|
sBucket_pt | sBucketCopy (const sBucket_pt bucket) |
| Copy sBucket non-intrusive!!! More...
|
|
ring | sBucketGetRing (const sBucket_pt bucket) |
| Returns bucket ring. More...
|
|
bool | sIsEmpty (const sBucket_pt bucket) |
| Test whether bucket is empty!? More...
|
|
void | sBucketClearMerge (sBucket_pt bucket, poly *p, int *length) |
|
void | sBucketClearAdd (sBucket_pt bucket, poly *p, int *length) |
|
void | sBucketDestroyMerge (sBucket_pt bucket, poly *p, int *length) |
|
void | sBucketDestroyAdd (sBucket_pt bucket, poly *p, int *length) |
|
void | sBucketDeleteAndDestroy (sBucket_pt *bucket_pt) |
|
void | sBucket_Merge_p (sBucket_pt bucket, poly p, int lp) |
| Merges p into Spoly: assumes Bpoly and p have no common monoms destroys p! More...
|
|
void | sBucket_Add_p (sBucket_pt bucket, poly p, int lp) |
| adds poly p to bucket destroys p! More...
|
|
poly | sBucketSortMerge (poly p, const ring r) |
| Sorts p with bucketSort: assumes all monomials of p are different. More...
|
|
poly | sBucketSortAdd (poly p, const ring r) |
| Sorts p with bucketSort: p may have equal monomials. More...
|
|
◆ poly
◆ sBucket_pt
◆ sBucket_Add_p()
adds poly p to bucket destroys p!
Definition at line 201 of file sbuckets.cc.
206 if (
p ==
NULL)
return;
207 if (length <= 0) length =
pLength(
p);
209 int i =
LOG2(length);
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static unsigned pLength(poly a)
static poly p_Add_q(poly p, poly q, const ring r)
◆ sBucket_Merge_p()
Merges p into Spoly: assumes Bpoly and p have no common monoms destroys p!
Definition at line 176 of file sbuckets.cc.
181 if (
p ==
NULL)
return;
182 if (length <= 0) length =
pLength(
p);
184 int i =
LOG2(length);
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static unsigned pLength(poly a)
static poly p_Merge_q(poly p, poly q, const ring r)
◆ sBucketClearAdd()
Definition at line 270 of file sbuckets.cc.
292 while (i <= bucket->max_bucket)
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static unsigned pLength(poly a)
bool sIsEmpty(const sBucket_pt bucket)
Test whether bucket is empty!?
static poly p_Add_q(poly p, poly q, const ring r)
◆ sBucketClearMerge()
Definition at line 232 of file sbuckets.cc.
250 while (i <= bucket->max_bucket)
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static poly p_Merge_q(poly p, poly q, const ring r)
◆ sBucketCopy()
Copy sBucket non-intrusive!!!
Definition at line 75 of file sbuckets.cc.
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static poly p_Copy(poly p, const ring r)
returns a copy of p
sBucket_pt sBucketCreate(const ring r)
static unsigned pLength(poly a)
◆ sBucketCreate()
◆ sBucketDeleteAndDestroy()
void sBucketDeleteAndDestroy |
( |
sBucket_pt * |
bucket_pt | ) |
|
Definition at line 134 of file sbuckets.cc.
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static void p_Delete(poly *p, const ring r)
#define omFreeBin(addr, bin)
◆ sBucketDestroy()
Definition at line 127 of file sbuckets.cc.
#define omFreeBin(addr, bin)
◆ sBucketDestroyAdd()
Definition at line 72 of file sbuckets.h.
void sBucketDestroy(sBucket_pt *bucket)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
◆ sBucketDestroyMerge()
void sBucketDestroyMerge |
( |
sBucket_pt |
bucket, |
|
|
poly * |
p, |
|
|
int * |
length |
|
) |
| |
|
inline |
Definition at line 65 of file sbuckets.h.
void sBucketClearMerge(sBucket_pt bucket, poly *p, int *length)
void sBucketDestroy(sBucket_pt *bucket)
◆ sBucketGetRing()
◆ sBucketSortAdd()
Sorts p with bucketSort: p may have equal monomials.
Definition at line 364 of file sbuckets.cc.
380 if (
p ==
NULL)
break;
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(const ring r)
static unsigned pLength(poly a)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
◆ sBucketSortMerge()
Sorts p with bucketSort: assumes all monomials of p are different.
Definition at line 327 of file sbuckets.cc.
343 if (
p ==
NULL)
break;
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(const ring r)
void sBucketClearMerge(sBucket_pt bucket, poly *p, int *length)
static unsigned pLength(poly a)
static void sBucket_Merge_m(sBucket_pt bucket, poly p)
◆ sIsEmpty()
Test whether bucket is empty!?
Definition at line 55 of file sbuckets.cc.
sBucketPoly buckets[BIT_SIZEOF_LONG - 3]
static unsigned pLength(poly a)