#include <tgb_internal.h>
Definition at line 342 of file tgb_internal.h.
◆ simple_reducer()
simple_reducer::simple_reducer |
( |
poly | pp, |
|
|
int | pp_len, |
|
|
int | pp_reducer_deg, |
|
|
slimgb_alg * | pp_c = NULL ) |
|
inline |
Definition at line 349 of file tgb_internal.h.
350 {
356 }
static int pLength(poly a)
◆ ~simple_reducer()
simple_reducer::~simple_reducer |
( |
| ) |
|
Definition at line 4937 of file tgb.cc.
4938{
4940 {
4942 }
4944}
void kBucketInit(kBucket_pt bucket, poly lm, int length)
◆ do_reduce()
Definition at line 4897 of file tgb.cc.
4898{
4899 number coef;
4900#ifdef HAVE_PLURAL
4903 else
4904#endif
4907}
number kBucketPolyRed(kBucket_pt bucket, poly p1, int l1, poly spNoether)
static void nc_kBucketPolyRed_Z(kBucket_pt b, poly p, number *c, BOOLEAN reduce)
◆ pre_reduce()
void simple_reducer::pre_reduce |
( |
red_object * | r, |
|
|
int | l, |
|
|
int | u ) |
|
virtual |
◆ reduce()
void simple_reducer::reduce |
( |
red_object * | r, |
|
|
int | l, |
|
|
int | u ) |
|
virtual |
we assume that all occurring red_objects have same lm, and all occ. lm's in r[l...u] are the same, only reductor does not occur
Reimplemented from reduction_step.
Definition at line 4909 of file tgb.cc.
4910{
4913
4914
4915 if(
c->eliminationProblem)
4916 {
4918
4919
4920 }
4921
4922 for(
i =
l;
i <= u;
i++)
4923 {
4925 }
4926 for(
i =
l;
i <= u;
i++)
4927 {
4930 }
4931}
virtual void pre_reduce(red_object *r, int l, int u)
virtual void do_reduce(red_object &ro)
void kBucketSimpleContent(kBucket_pt bucket)
#define p_LmEqual(p1, p2, r)
◆ fill_back
◆ p_len
int simple_reducer::p_len |
◆ reducer_deg
int simple_reducer::reducer_deg |
The documentation for this class was generated from the following files: