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, ring r) |
| Sorts p with bucketSort: assumes all monomials of p are different. More...
|
|
poly | sBucketSortAdd (poly p, ring r) |
| Sorts p with bucketSort: p may have equal monomials. More...
|
|
adds poly p to bucket destroys p!
Definition at line 206 of file sbuckets.cc.
211 if (
p ==
NULL)
return;
212 if (length <= 0) length =
pLength(
p);
214 int i =
LOG2(length);
static int pLength(poly a)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
static poly p_Add_q(poly p, poly q, const ring r)
Merges p into Spoly: assumes Bpoly and p have no common monoms destroys p!
Definition at line 181 of file sbuckets.cc.
186 if (
p ==
NULL)
return;
187 if (length <= 0) length =
pLength(
p);
189 int i =
LOG2(length);
static int pLength(poly a)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
static poly p_Merge_q(poly p, poly q, const ring r)
Definition at line 275 of file sbuckets.cc.
297 while (i <= bucket->max_bucket)
static int pLength(poly a)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
bool sIsEmpty(const sBucket_pt bucket)
Test whether bucket is empty!?
static poly p_Add_q(poly p, poly q, const ring r)
Definition at line 237 of file sbuckets.cc.
255 while (i <= bucket->max_bucket)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
static poly p_Merge_q(poly p, poly q, const ring r)
Copy sBucket non-intrusive!!!
Definition at line 80 of file sbuckets.cc.
static int pLength(poly a)
static poly p_Copy(poly p, const ring r)
returns a copy of p
sBucket_pt sBucketCreate(ring r)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
void sBucketDeleteAndDestroy |
( |
sBucket_pt * |
bucket_pt | ) |
|
Definition at line 139 of file sbuckets.cc.
sBucketPoly buckets[BIT_SIZEOF_LONG-3]
static void p_Delete(poly *p, const ring r)
#define omFreeBin(addr, bin)
Definition at line 132 of file sbuckets.cc.
#define omFreeBin(addr, bin)
Definition at line 72 of file sbuckets.h.
void sBucketDestroy(sBucket_pt *bucket)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
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)
Sorts p with bucketSort: p may have equal monomials.
Definition at line 369 of file sbuckets.cc.
385 if (
p ==
NULL)
break;
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
static int pLength(poly a)
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(ring r)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
poly sBucketSortMerge |
( |
poly |
p, |
|
|
ring |
r |
|
) |
| |
Sorts p with bucketSort: assumes all monomials of p are different.
Definition at line 332 of file sbuckets.cc.
348 if (
p ==
NULL)
break;
static int pLength(poly a)
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(ring r)
void sBucketClearMerge(sBucket_pt bucket, poly *p, int *length)
static void sBucket_Merge_m(sBucket_pt bucket, poly p)
Test whether bucket is empty!?
Definition at line 60 of file sbuckets.cc.
static int pLength(poly a)
sBucketPoly buckets[BIT_SIZEOF_LONG-3]