![]() |
#include <omalloc/omalloc.h>#include <misc/auxiliary.h>#include <polys/sbuckets.h>#include <polys/monomials/ring.h>#include <polys/monomials/p_polys.h>Go to the source code of this file.
Data Structures | |
| class | sBucketPoly |
| class | sBucket |
Functions | |
| ring | sBucketGetRing (const sBucket_pt bucket) |
| Returns bucket ring. More... | |
| bool | sIsEmpty (const sBucket_pt bucket) |
| Test whether bucket is empty!? More... | |
| sBucket_pt | sBucketCopy (const sBucket_pt bucket) |
| Copy sBucket non-intrusive!!! More... | |
| static int | LOG2 (int i) |
| sBucket_pt | sBucketCreate (const ring r) |
| void | sBucketDestroy (sBucket_pt *bucket) |
| void | sBucketDeleteAndDestroy (sBucket_pt *bucket_pt) |
| static void | sBucket_Merge_m (sBucket_pt bucket, poly p) |
| 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! More... | |
| void | sBucket_Add_p (sBucket_pt bucket, poly p, int length) |
| adds poly p to bucket destroys p! More... | |
| void | sBucketClearMerge (sBucket_pt bucket, poly *p, int *length) |
| void | sBucketClearAdd (sBucket_pt bucket, poly *p, int *length) |
| 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... | |
Variables | |
| static omBin | sBucket_bin = omGetSpecBin(sizeof(sBucket)) |
| class sBucketPoly |
Definition at line 27 of file sbuckets.cc.
| Data Fields | ||
|---|---|---|
| long | length | |
| poly | p | |
| class sBucket |
Definition at line 34 of file sbuckets.cc.
| Data Fields | ||
|---|---|---|
| ring | bucket_ring | |
| sBucketPoly | buckets[BIT_SIZEOF_LONG - 3] | |
| long | max_bucket | |
|
inlinestatic |
Definition at line 101 of file sbuckets.cc.
| void sBucket_Add_p | ( | sBucket_pt | bucket, |
| poly | p, | ||
| int | length | ||
| ) |
|
static |
Definition at line 155 of file sbuckets.cc.
| 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!
Definition at line 176 of file sbuckets.cc.
| void sBucketClearAdd | ( | sBucket_pt | bucket, |
| poly * | p, | ||
| int * | length | ||
| ) |
Definition at line 270 of file sbuckets.cc.
| void sBucketClearMerge | ( | sBucket_pt | bucket, |
| poly * | p, | ||
| int * | length | ||
| ) |
Definition at line 232 of file sbuckets.cc.
| sBucket_pt sBucketCopy | ( | const sBucket_pt | bucket | ) |
| sBucket_pt sBucketCreate | ( | const ring | r | ) |
Definition at line 120 of file sbuckets.cc.
| void sBucketDeleteAndDestroy | ( | sBucket_pt * | bucket_pt | ) |
Definition at line 134 of file sbuckets.cc.
| void sBucketDestroy | ( | sBucket_pt * | bucket | ) |
Definition at line 127 of file sbuckets.cc.
| ring sBucketGetRing | ( | const sBucket_pt | bucket | ) |
Sorts p with bucketSort: p may have equal monomials
Definition at line 364 of file sbuckets.cc.
Sorts p with bucketSort: assumes all monomials of p are different
Definition at line 327 of file sbuckets.cc.
| bool sIsEmpty | ( | const sBucket_pt | bucket | ) |
|
static |
Definition at line 43 of file sbuckets.cc.