genfun_constructor.cc

   1 #include "genfun_constructor.h"
   2
   3 gf_base *gf_base::create(Polyhedron *context, unsigned dim, unsigned nparam)
   4 {
   5     gf_base *red;
   6 #ifdef USE_INCREMENTAL_BF
   7     red = new partial_bfcounter(context, dim, nparam);
   8 #elif defined USE_INCREMENTAL_DF
   9     red = new partial_ireducer(context, dim, nparam);
  10 #else
  11     red = new partial_reducer(context, dim, nparam);
  12 #endif
  13     return red;
  14 }
  15
  16 void partial_ireducer::base(QQ& c, const vec_ZZ& num, const mat_ZZ& den_f)
  17 {
  18     gf->add(c, num, den_f);
  19 }
  20
  21 void partial_reducer::split(vec_ZZ& num, ZZ& num_s, vec_ZZ& num_p,
  22                             mat_ZZ& den_f, vec_ZZ& den_s, mat_ZZ& den_r)
  23 {
  24     unsigned len = den_f.NumRows();  // number of factors in den
  25     unsigned nvar = tmp.length();
  26
  27     den_s.SetLength(len);
  28     den_r.SetDims(len, lower);
  29
  30     for (int r = 0; r < len; ++r) {
  31         for (int k = 0; k < nvar; ++k)
  32             tmp[k] = den_f[r][k];
  33         den_s[r] = tmp * lambda;
  34
  35         for (int k = nvar; k < dim; ++k)
  36             den_r[r][k-nvar] = den_f[r][k];
  37     }
  38
  39     for (int k = 0; k < nvar; ++k)
  40         tmp[k] = num[k];
  41     num_s = tmp *lambda;
  42     num_p.SetLength(lower);
  43     for (int k = nvar ; k < dim; ++k)
  44         num_p[k-nvar] = num[k];
  45 }
  46
  47 void partial_reducer::base(QQ& c, const vec_ZZ& num, const mat_ZZ& den_f)
  48 {
  49     gf->add(c, num, den_f);
  50 }
  51
  52 void partial_bfcounter::base(mat_ZZ& factors, bfc_vec& v)
  53 {
  54     mat_ZZ den;
  55     unsigned nf = factors.NumRows();
  56
  57     for (int i = 0; i < v.size(); ++i) {
  58         bfc_term* bfct = static_cast<bfc_term *>(v[i]);
  59         den.SetDims(0, lower);
  60         int total_power = 0;
  61         int p = 0;
  62         for (int j = 0; j < nf; ++j) {
  63             total_power += v[i]->powers[j];
  64             den.SetDims(total_power, lower);
  65             for (int k = 0; k < v[i]->powers[j]; ++k)
  66                 den[p++] = factors[j];
  67         }
  68         for (int j = 0; j < v[i]->terms.NumRows(); ++j)
  69             gf->add(bfct->c[j], v[i]->terms[j], den);
  70         delete v[i];
  71     }
  72 }