dpoly.h

   1 #ifndef DPOLY_H
   2 #define DPOLY_H
   3
   4 #include <assert.h>
   5 #include <set>
   6 #include <vector>
   7 #include <gmp.h>
   8 #include <NTL/vec_ZZ.h>
   9 #include <barvinok/polylib.h>
  10 #include "conversion.h"
  11
  12 #ifdef NTL_STD_CXX
  13 using namespace NTL;
  14 #endif
  15
  16 class dpoly {
  17 public:
  18     vec_ZZ coeff;
  19     dpoly(int d, ZZ& degree, int offset = 0);
  20     void operator *= (dpoly& f);
  21     void div(dpoly& d, mpq_t count, ZZ& sign);
  22     void div(dpoly& d, mpq_t *count, const mpq_t& factor);
  23 private:
  24     mpq_t *div(dpoly &d) const;
  25     void   clear_div(mpq_t *c) const;
  26 };
  27
  28 struct dpoly_r_term {
  29     std::vector<int>    powers;
  30     ZZ                  coeff;
  31 };
  32
  33 struct dpoly_r_term_lex_smaller {
  34     bool operator()(const dpoly_r_term* t1, const dpoly_r_term* t2) const {
  35         return t1->powers < t2->powers;
  36     }
  37 };
  38
  39 typedef std::set<dpoly_r_term*, dpoly_r_term_lex_smaller> dpoly_r_term_list;
  40
  41 /* len: number of elements in c
  42  * each element in c is the coefficient of a power of t
  43  * in the MacLaurin expansion
  44  */
  45 struct dpoly_r {
  46     dpoly_r_term_list   *c;
  47     int len;
  48     int dim;
  49     ZZ denom;
  50
  51     void add_term(int i, const std::vector<int>& powers, const ZZ& coeff);
  52     dpoly_r(int len, int dim);
  53     dpoly_r(dpoly& num, int dim);
  54     dpoly_r(dpoly& num, dpoly& den, int pos, int dim);
  55     dpoly_r(dpoly_r* num, dpoly& den, int pos, int dim);
  56     ~dpoly_r();
  57     dpoly_r *div(dpoly& d);
  58     void dump(void);
  59 };
  60
  61 #endif