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_Merge_m (sBucket_pt bucket, poly p) |
|
void | sBucket_Add_p (sBucket_pt bucket, poly p, int lp) |
| adds poly p to bucket destroys p! More...
|
|
void | sBucket_Add_m (sBucket_pt bucket, poly p) |
|
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...
|
|
◆ sBucket_pt
◆ sBucket_Add_m()
◆ sBucket_Add_p()
void sBucket_Add_p |
( |
sBucket_pt |
bucket, |
|
|
poly |
p, |
|
|
int |
lp |
|
) |
| |
adds poly p to bucket destroys p!
Definition at line 204 of file sbuckets.cc.
211 if (
p ==
NULL)
return;
◆ sBucket_Merge_m()
void sBucket_Merge_m |
( |
sBucket_pt |
bucket, |
|
|
poly |
p |
|
) |
| |
◆ sBucket_Merge_p()
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!
Definition at line 149 of file sbuckets.cc.
156 if (
p ==
NULL)
return;
◆ sBucketClearAdd()
void sBucketClearAdd |
( |
sBucket_pt |
bucket, |
|
|
poly * |
p, |
|
|
int * |
length |
|
) |
| |
Definition at line 275 of file sbuckets.cc.
299 while (i <= bucket->max_bucket)
◆ sBucketClearMerge()
void sBucketClearMerge |
( |
sBucket_pt |
bucket, |
|
|
poly * |
p, |
|
|
int * |
length |
|
) |
| |
Definition at line 237 of file sbuckets.cc.
257 while (i <= bucket->max_bucket)
◆ sBucketCopy()
◆ sBucketCreate()
◆ sBucketDeleteAndDestroy()
void sBucketDeleteAndDestroy |
( |
sBucket_pt * |
bucket_pt | ) |
|
◆ sBucketDestroy()
◆ sBucketDestroyAdd()
void sBucketDestroyAdd |
( |
sBucket_pt |
bucket, |
|
|
poly * |
p, |
|
|
int * |
length |
|
) |
| |
|
inline |
◆ sBucketDestroyMerge()
void sBucketDestroyMerge |
( |
sBucket_pt |
bucket, |
|
|
poly * |
p, |
|
|
int * |
length |
|
) |
| |
|
inline |
◆ sBucketGetRing()
◆ sBucketSortAdd()
poly sBucketSortAdd |
( |
poly |
p, |
|
|
const ring |
r |
|
) |
| |
Sorts p with bucketSort: p may have equal monomials.
Definition at line 366 of file sbuckets.cc.
384 if (
p ==
NULL)
break;
◆ sBucketSortMerge()
poly sBucketSortMerge |
( |
poly |
p, |
|
|
const ring |
r |
|
) |
| |
Sorts p with bucketSort: assumes all monomials of p are different.
Definition at line 332 of file sbuckets.cc.
349 if (
p ==
NULL)
break;
◆ sIsEmpty()
Test whether bucket is empty!?
Definition at line 52 of file sbuckets.cc.