reducer.h

   1 #ifndef REDUCER_H
   2 #define REDUCER_H
   3
   4 #include <NTL/mat_ZZ.h>
   5 #include <barvinok/NTL_QQ.h>
   6 #include <barvinok/options.h>
   7 #include "decomposer.h"
   8 #include "dpoly.h"
   9
  10 #ifdef NTL_STD_CXX
  11 using namespace NTL;
  12 #endif
  13
  14 struct gen_fun;
  15
  16 extern struct OrthogonalException {} Orthogonal;
  17
  18 /* base for non-parametric counting */
  19 struct np_base : public signed_cone_consumer {
  20     unsigned dim;
  21     ZZ one;
  22
  23     np_base(unsigned dim) {
  24         this->dim = dim;
  25         one = 1;
  26     }
  27
  28     virtual void handle(const mat_ZZ& rays, Value *vertex, const QQ& c,
  29                         unsigned long det, int *closed,
  30                         barvinok_options *options) = 0;
  31     virtual void handle(const signed_cone& sc, barvinok_options *options);
  32     virtual void start(Polyhedron *P, barvinok_options *options);
  33     void do_vertex_cone(const QQ& factor, Polyhedron *Cone,
  34                         Value *vertex, barvinok_options *options) {
  35         current_vertex = vertex;
  36         this->factor = factor;
  37         barvinok_decompose(Cone, *this, options);
  38     }
  39     virtual void init(Polyhedron *P) {
  40     }
  41     virtual void reset() {
  42         assert(0);
  43     }
  44     virtual void get_count(Value *result) {
  45         assert(0);
  46     }
  47     virtual ~np_base() {
  48     }
  49
  50 private:
  51     QQ factor;
  52     Value *current_vertex;
  53 };
  54
  55 struct reducer : public np_base {
  56     mat_ZZ vertex;
  57     //vec_ZZ den;
  58     ZZ num;
  59     mpq_t tcount;
  60     mpz_t tn;
  61     mpz_t td;
  62     int lower;      // call base when only this many variables is left
  63     Value tz;
  64
  65     reducer(unsigned dim) : np_base(dim) {
  66         vertex.SetDims(1, dim);
  67         //den.SetLength(dim);
  68         mpq_init(tcount);
  69         mpz_init(tn);
  70         mpz_init(td);
  71         value_init(tz);
  72     }
  73
  74     ~reducer() {
  75         value_clear(tz);
  76         mpq_clear(tcount);
  77         mpz_clear(tn);
  78         mpz_clear(td);
  79     }
  80
  81     virtual void handle(const mat_ZZ& rays, Value *vertex, const QQ& c,
  82                         unsigned long det, int *closed, barvinok_options *options);
  83     void reduce(const vec_QQ& c, const mat_ZZ& num, const mat_ZZ& den_f);
  84     virtual void base(const QQ& c, const vec_ZZ& num, const mat_ZZ& den_f) = 0;
  85     virtual void base(const vec_QQ& c, const mat_ZZ& num, const mat_ZZ& den_f);
  86     virtual void split(const mat_ZZ& num, vec_ZZ& num_s, mat_ZZ& num_p,
  87                        const mat_ZZ& den_f, vec_ZZ& den_s, mat_ZZ& den_r) = 0;
  88     virtual gen_fun *get_gf() {
  89         assert(0);
  90         return NULL;
  91     }
  92 };
  93
  94 void split_one(const mat_ZZ& num, vec_ZZ& num_s, mat_ZZ& num_p,
  95                const mat_ZZ& den_f, vec_ZZ& den_s, mat_ZZ& den_r);
  96
  97 struct ireducer : public reducer {
  98     ireducer(unsigned dim) : reducer(dim) {}
  99
 100     virtual void split(const mat_ZZ& num, vec_ZZ& num_s, mat_ZZ& num_p,
 101                        const mat_ZZ& den_f, vec_ZZ& den_s, mat_ZZ& den_r) {
 102         split_one(num, num_s, num_p, den_f, den_s, den_r);
 103     }
 104 };
 105
 106 void normalize(ZZ& sign, vec_ZZ& num_s, mat_ZZ& num_p, vec_ZZ& den_s, vec_ZZ& den_p,
 107                mat_ZZ& f);
 108
 109 // incremental counter
 110 struct icounter : public ireducer {
 111     mpq_t count;
 112
 113     icounter(unsigned dim) : ireducer(dim) {
 114         mpq_init(count);
 115         lower = 1;
 116     }
 117     ~icounter() {
 118         mpq_clear(count);
 119     }
 120     virtual void base(const QQ& c, const vec_ZZ& num, const mat_ZZ& den_f);
 121     virtual void get_count(Value *result) {
 122         assert(value_one_p(&count[0]._mp_den));
 123         value_assign(*result, &count[0]._mp_num);
 124     }
 125 };
 126
 127 void normalize(ZZ& sign, ZZ& num, vec_ZZ& den);
 128
 129 /* An incremental counter for possibly infinite sets.
 130  * Rather than just keeping track of the constant term
 131  * of the Laurent expansions, we also keep track of the
 132  * coefficients of negative powers.
 133  * If any of these is non-zero, then the counted set is infinite.
 134  */
 135 struct infinite_icounter : public ireducer {
 136     /* an array of coefficients; count[i] is the coeffient of
 137      * the term with power -i.
 138      */
 139     mpq_t *count;
 140     unsigned len;
 141     Value tz;
 142
 143     infinite_icounter(unsigned dim, unsigned maxlen) : ireducer(dim), len(maxlen+1) {
 144         /* Not sure whether it works for dim != 1 */
 145         assert(dim == 1);
 146         count = new mpq_t[len];
 147         for (int i = 0; i < len; ++i)
 148             mpq_init(count[i]);
 149         lower = 1;
 150         value_init(tz);
 151     }
 152     ~infinite_icounter() {
 153         for (int i = 0; i < len; ++i)
 154             mpq_clear(count[i]);
 155         delete [] count;
 156         value_clear(tz);
 157     }
 158     virtual void base(const QQ& c, const vec_ZZ& num, const mat_ZZ& den_f);
 159 };
 160
 161 #endif