testlib.cc

   1 #include <assert.h>
   2 #include <sstream>
   3 #include <barvinok/barvinok.h>
   4 #include <barvinok/set.h>
   5 #include <barvinok/options.h>
   6 #include <barvinok/evalue.h>
   7 #include <barvinok/util.h>
   8 #include "conversion.h"
   9 #include "evalue_read.h"
  10 #include "dpoly.h"
  11 #include "lattice_point.h"
  12 #include "tcounter.h"
  13 #include "bernoulli.h"
  14 #include "matrix_read.h"
  15
  16 using std::cout;
  17 using std::cerr;
  18 using std::endl;
  19
  20 template <typename T>
  21 void set_from_string(T& v, const char *s)
  22 {
  23     std::istringstream str(s);
  24     str >> v;
  25 }
  26
  27 int test_evalue(struct barvinok_options *options)
  28 {
  29     unsigned nvar, nparam;
  30     char **all_vars;
  31     evalue *poly1, poly2;
  32
  33     poly1 = evalue_read_from_str("(1/4 * n^4 + 1/2 * n^3 + 1/4 * n^2)",
  34                                  NULL, &all_vars, &nvar, &nparam,
  35                                  options->MaxRays);
  36     Free_ParamNames(all_vars, nvar+nparam);
  37
  38     value_init(poly2.d);
  39     evalue_copy(&poly2, poly1);
  40     evalue_negate(poly1);
  41     eadd(&poly2, poly1);
  42     reduce_evalue(poly1);
  43     assert(EVALUE_IS_ZERO(*poly1));
  44     evalue_free(poly1);
  45     free_evalue_refs(&poly2);
  46 }
  47
  48 int test_split_periods(struct barvinok_options *options)
  49 {
  50     unsigned nvar, nparam;
  51     char **all_vars;
  52     evalue *e;
  53
  54     e = evalue_read_from_str("U + 2V + 3 >= 0\n- U -2V  >= 0\n- U  10 >= 0\n"
  55                              "U  >= 0\n\n({( 1/3 * U + ( 2/3 * V + 0 ))})",
  56                              NULL, &all_vars, &nvar, &nparam,
  57                              options->MaxRays);
  58     Free_ParamNames(all_vars, nvar+nparam);
  59
  60     evalue_split_periods(e, 2, options->MaxRays);
  61     assert(value_zero_p(e->d));
  62     assert(e->x.p->type == partition);
  63     assert(e->x.p->size == 4);
  64     assert(value_zero_p(e->x.p->arr[1].d));
  65     assert(e->x.p->arr[1].x.p->type == polynomial);
  66     assert(value_zero_p(e->x.p->arr[3].d));
  67     assert(e->x.p->arr[3].x.p->type == polynomial);
  68     evalue_free(e);
  69 }
  70
  71 int test_specialization(struct barvinok_options *options)
  72 {
  73     Value v;
  74     value_init(v);
  75     mpq_t count;
  76     mpq_init(count);
  77
  78     value_set_si(v, 5);
  79     dpoly n(2, v);
  80     assert(value_cmp_si(n.coeff->p[0], 1) == 0);
  81     assert(value_cmp_si(n.coeff->p[1], 5) == 0);
  82     assert(value_cmp_si(n.coeff->p[2], 10) == 0);
  83
  84     value_set_si(v, 1);
  85     dpoly d(2, v, 1);
  86     value_set_si(v, 2);
  87     dpoly d2(2, v, 1);
  88     d *= d2;
  89     assert(value_cmp_si(d.coeff->p[0], 2) == 0);
  90     assert(value_cmp_si(d.coeff->p[1], 1) == 0);
  91     assert(value_cmp_si(d.coeff->p[2], 0) == 0);
  92
  93     n.div(d, count, 1);
  94     mpq_canonicalize(count);
  95     assert(value_cmp_si(mpq_numref(count), 31) == 0);
  96     assert(value_cmp_si(mpq_denref(count), 8) == 0);
  97
  98     value_set_si(v, -2);
  99     dpoly n2(2, v);
 100     assert(value_cmp_si(n2.coeff->p[0], 1) == 0);
 101     assert(value_cmp_si(n2.coeff->p[1], -2) == 0);
 102     assert(value_cmp_si(n2.coeff->p[2], 3) == 0);
 103
 104     n2.div(d, count, 1);
 105     mpq_canonicalize(count);
 106     assert(value_cmp_si(mpq_numref(count), 6) == 0);
 107     assert(value_cmp_si(mpq_denref(count), 1) == 0);
 108
 109     value_clear(v);
 110     mpq_clear(count);
 111 }
 112
 113 int test_lattice_points(struct barvinok_options *options)
 114 {
 115     Param_Vertices V;
 116     mat_ZZ tmp;
 117     set_from_string(tmp, "[[0 0 0 0 4][0 0 0 0 4][-1 0 1 0 4]]");
 118     V.Vertex = zz2matrix(tmp);
 119     vec_ZZ lambda;
 120     set_from_string(lambda, "[3 5 7]");
 121     mat_ZZ rays;
 122     set_from_string(rays, "[[0 1 0][4 0 1][0 0 -1]]");
 123     term_info num;
 124     evalue *point[4];
 125
 126     unsigned nvar, nparam;
 127     char **all_vars;
 128     point[0] = evalue_read_from_str("( -7/4 * a + ( 7/4 * c + "
 129                     "( 7 * {( 1/4 * a + ( 3/4 * c + 3/4 ) ) } + -21/4 ) ) )",
 130                     "a,b,c", &all_vars, &nvar, &nparam, options->MaxRays);
 131     Free_ParamNames(all_vars, nvar+nparam);
 132     point[1] = evalue_read_from_str("( -7/4 * a + ( 7/4 * c + "
 133                     "( 7 * {( 1/4 * a + ( 3/4 * c + 1/2 ) ) } + -1/2 ) ) )",
 134                     "a,b,c", &all_vars, &nvar, &nparam, options->MaxRays);
 135     Free_ParamNames(all_vars, nvar+nparam);
 136     point[2] = evalue_read_from_str("( -7/4 * a + ( 7/4 * c + "
 137                     "( 7 * {( 1/4 * a + ( 3/4 * c + 1/4 ) ) } + 17/4 ) ) )",
 138                     "a,b,c", &all_vars, &nvar, &nparam, options->MaxRays);
 139     Free_ParamNames(all_vars, nvar+nparam);
 140     point[3] = evalue_read_from_str("( -7/4 * a + ( 7/4 * c + "
 141                     "( 7 * {( 1/4 * a + ( 3/4 * c + 0 ) ) } + 9 ) ) )",
 142                     "a,b,c", &all_vars, &nvar, &nparam, options->MaxRays);
 143     Free_ParamNames(all_vars, nvar+nparam);
 144
 145     lattice_point(&V, rays, lambda, &num, 4, options);
 146     Matrix_Free(V.Vertex);
 147
 148     for (int i = 0; i < 4; ++i) {
 149         assert(eequal(num.E[i], point[i]));
 150         evalue_free(point[i]);
 151         free_evalue_refs(num.E[i]);
 152         delete num.E[i];
 153     }
 154     delete [] num.E;
 155 }
 156
 157 static int test_icounter(struct barvinok_options *options)
 158 {
 159     icounter cnt(2);
 160     vec_QQ n_coeff;
 161     mat_ZZ n_power;
 162     mat_ZZ d_power;
 163     set_from_string(n_coeff, "[-2/1 1/1]");
 164     set_from_string(n_power, "[[2 6][3 6]]");
 165     d_power.SetDims(0, 2);
 166     cnt.reduce(n_coeff, n_power, d_power);
 167     assert(value_cmp_si(mpq_numref(cnt.count), -1) == 0);
 168     assert(value_cmp_si(mpq_denref(cnt.count), 1) == 0);
 169 }
 170
 171 static Matrix *matrix_read_from_str(const char *s)
 172 {
 173     std::istringstream str(s);
 174     return Matrix_Read(str);
 175 }
 176
 177 static int test_series(struct barvinok_options *options)
 178 {
 179     Matrix *M = matrix_read_from_str(
 180         "12 11\n"
 181         "   0    1    0    0    0    0    0    1    0    0    3 \n"
 182         "   0    0    1    0    0    0    0   -1    1    0   -5 \n"
 183         "   0    0    0    1    0    0    0    0   -2   -1    6 \n"
 184         "   0    0    0    0    1    0    0    1    1    0    5 \n"
 185         "   0    0    0    0    0    1    0    0   -1    0    0 \n"
 186         "   0    0    0    0    0    0    1   -2    0   -1   -3 \n"
 187         "   1    0    0    0    0    0    0    2    0    1    3 \n"
 188         "   1    0    0    0    0    0    0    1   -1    0    5 \n"
 189         "   1    0    0    0    0    0    0   -1   -1    0   -5 \n"
 190         "   1    0    0    0    0    0    0   -1    0    0   -3 \n"
 191         "   1    0    0    0    0    0    0    0    2    1   -6 \n"
 192         "   1    0    0    0    0    0    0    0    1    0    0 \n");
 193     Polyhedron *P = Constraints2Polyhedron(M, options->MaxRays);
 194     Matrix_Free(M);
 195     Polyhedron *C = Universe_Polyhedron(3);
 196     gen_fun *gf = barvinok_series_with_options(P, C, options);
 197     Polyhedron_Free(P);
 198     Polyhedron_Free(C);
 199     delete gf;
 200
 201     M = matrix_read_from_str(
 202         "7 8\n"
 203         "   0    1    1    0    0    1    0    2 \n"
 204         "   0    0    0    1    0   -2    0    6 \n"
 205         "   0    0    0    0    1   -1    0   -1 \n"
 206         "   0    0    0    0    0    0    1    0 \n"
 207         "   1    0    1    0    0    0    0    0 \n"
 208         "   1    0   -1    0    0   -1    0   -2 \n"
 209         "   1    0    0    0    0    1    0   -3 \n");
 210     P = Constraints2Polyhedron(M, options->MaxRays);
 211     Matrix_Free(M);
 212     C = Universe_Polyhedron(2);
 213     gf = barvinok_series_with_options(P, C, options);
 214     Polyhedron_Free(P);
 215     Polyhedron_Free(C);
 216     delete gf;
 217
 218     return 0;
 219 }
 220
 221 int test_todd(struct barvinok_options *options)
 222 {
 223     tcounter t(2, options->max_index);
 224     assert(value_cmp_si(t.todd.coeff->p[0], 1) == 0);
 225     assert(value_cmp_si(t.todd.coeff->p[1], -3) == 0);
 226     assert(value_cmp_si(t.todd.coeff->p[2], 3) == 0);
 227     assert(value_cmp_si(t.todd_denom->p[0], 1) == 0);
 228     assert(value_cmp_si(t.todd_denom->p[1], 6) == 0);
 229     assert(value_cmp_si(t.todd_denom->p[2], 36) == 0);
 230
 231     vec_ZZ lambda;
 232     set_from_string(lambda, "[1 -1]");
 233     zz2values(lambda, t.lambda->p);
 234
 235     mat_ZZ rays;
 236     set_from_string(rays, "[[-1 0][-1 1]]");
 237
 238     QQ one(1, 1);
 239
 240     vec_ZZ v;
 241     set_from_string(v, "[2 0 1]");
 242     Vector *vertex = Vector_Alloc(3);
 243     zz2values(v, vertex->p);
 244
 245     t.handle(rays, vertex->p, one, 1, options);
 246     assert(value_cmp_si(mpq_numref(t.count), 71) == 0);
 247     assert(value_cmp_si(mpq_denref(t.count), 24) == 0);
 248
 249     set_from_string(rays, "[[0 -1][1 -1]]");
 250     set_from_string(v, "[0 2 1]");
 251     zz2values(v, vertex->p);
 252
 253     t.handle(rays, vertex->p, one, 1, options);
 254     assert(value_cmp_si(mpq_numref(t.count), 71) == 0);
 255     assert(value_cmp_si(mpq_denref(t.count), 12) == 0);
 256
 257     set_from_string(rays, "[[1 0][0 1]]");
 258     set_from_string(v, "[0 0 1]");
 259     zz2values(v, vertex->p);
 260
 261     t.handle(rays, vertex->p, one, 1, options);
 262     assert(value_cmp_si(mpq_numref(t.count), 6) == 0);
 263     assert(value_cmp_si(mpq_denref(t.count), 1) == 0);
 264
 265     Vector_Free(vertex);
 266 }
 267
 268 int test_bernoulli(struct barvinok_options *options)
 269 {
 270     struct bernoulli_coef *bernoulli_coef;
 271     struct poly_list *faulhaber, *bernoulli;
 272     bernoulli_coef = bernoulli_coef_compute(2);
 273     faulhaber = faulhaber_compute(4);
 274     bernoulli_coef = bernoulli_coef_compute(8);
 275     assert(value_cmp_si(bernoulli_coef->num->p[6], 1) == 0);
 276     assert(value_cmp_si(bernoulli_coef->den->p[6], 42) == 0);
 277     assert(value_cmp_si(faulhaber->poly[3]->p[0], 0) == 0);
 278     assert(value_cmp_si(faulhaber->poly[3]->p[1], 0) == 0);
 279     assert(value_cmp_si(faulhaber->poly[3]->p[2], 1) == 0);
 280     assert(value_cmp_si(faulhaber->poly[3]->p[3], -2) == 0);
 281     assert(value_cmp_si(faulhaber->poly[3]->p[4], 1) == 0);
 282     assert(value_cmp_si(faulhaber->poly[3]->p[5], 4) == 0);
 283
 284     bernoulli = bernoulli_compute(6);
 285     assert(value_cmp_si(bernoulli->poly[6]->p[0], 1) == 0);
 286     assert(value_cmp_si(bernoulli->poly[6]->p[1], 0) == 0);
 287     assert(value_cmp_si(bernoulli->poly[6]->p[2], -21) == 0);
 288     assert(value_cmp_si(bernoulli->poly[6]->p[3], 0) == 0);
 289     assert(value_cmp_si(bernoulli->poly[6]->p[4], 105) == 0);
 290     assert(value_cmp_si(bernoulli->poly[6]->p[5], -126) == 0);
 291     assert(value_cmp_si(bernoulli->poly[6]->p[6], 42) == 0);
 292     assert(value_cmp_si(bernoulli->poly[6]->p[7], 42) == 0);
 293
 294     unsigned nvar, nparam;
 295     char **all_vars;
 296     evalue *base, *sum1, *sum2;
 297     base = evalue_read_from_str("(1 * n + 1)", NULL, &all_vars, &nvar, &nparam,
 298                                 options->MaxRays);
 299
 300     sum1 = evalue_polynomial(faulhaber->poly[3], base);
 301     Free_ParamNames(all_vars, nvar+nparam);
 302
 303     sum2 = evalue_read_from_str("(1/4 * n^4 + 1/2 * n^3 + 1/4 * n^2)",
 304                                 NULL, &all_vars, &nvar, &nparam,
 305                                 options->MaxRays);
 306     Free_ParamNames(all_vars, nvar+nparam);
 307     assert(eequal(sum1, sum2));
 308     evalue_free(base);
 309     evalue_free(sum1);
 310     evalue_free(sum2);
 311 }
 312
 313 int test_bernoulli_sum(struct barvinok_options *options)
 314 {
 315     unsigned nvar, nparam;
 316     char **all_vars;
 317     evalue *e, *sum1, *sum2;
 318     e = evalue_read_from_str("i + -1 >= 0\n -i + n >= 0\n\n 1 + (-1 *i) + i^2",
 319                              "i", &all_vars, &nvar, &nparam,
 320                                 options->MaxRays);
 321     Free_ParamNames(all_vars, nvar+nparam);
 322
 323     sum1 = Bernoulli_sum_evalue(e, 1, options);
 324     sum2 = evalue_read_from_str("n -1 >= 0\n\n (1/3 * n^3 + 2/3 * n)",
 325                                 NULL, &all_vars, &nvar, &nparam,
 326                                 options->MaxRays);
 327     Free_ParamNames(all_vars, nvar+nparam);
 328     evalue_negate(sum1);
 329     eadd(sum2, sum1);
 330     reduce_evalue(sum1);
 331     assert(EVALUE_IS_ZERO(*sum1));
 332     evalue_free(e);
 333     evalue_free(sum1);
 334
 335     e = evalue_read_from_str("-i + -1 >= 0\n i + n >= 0\n\n 1 + i + i^2",
 336                              "i", &all_vars, &nvar, &nparam,
 337                                 options->MaxRays);
 338     Free_ParamNames(all_vars, nvar+nparam);
 339     sum1 = Bernoulli_sum_evalue(e, 1, options);
 340     evalue_negate(sum1);
 341     eadd(sum2, sum1);
 342     reduce_evalue(sum1);
 343     assert(EVALUE_IS_ZERO(*sum1));
 344     evalue_free(e);
 345     evalue_free(sum1);
 346
 347     evalue_free(sum2);
 348
 349     e = evalue_read_from_str("i + 4 >= 0\n -i + n >= 0\n\n i",
 350                              "i", &all_vars, &nvar, &nparam,
 351                                 options->MaxRays);
 352     Free_ParamNames(all_vars, nvar+nparam);
 353     sum1 = Bernoulli_sum_evalue(e, 1, options);
 354     sum2 = evalue_read_from_str("n + 0 >= 0\n\n (1/2 * n^2 + 1/2 * n + (-10))\n"
 355                     "n + 4 >= 0\n -n -1 >= 0\n\n (1/2 * n^2 + 1/2 * n + (-10))",
 356                                 NULL, &all_vars, &nvar, &nparam,
 357                                 options->MaxRays);
 358     Free_ParamNames(all_vars, nvar+nparam);
 359     evalue_negate(sum1);
 360     eadd(sum2, sum1);
 361     reduce_evalue(sum1);
 362     assert(EVALUE_IS_ZERO(*sum1));
 363     evalue_free(e);
 364     evalue_free(sum1);
 365     evalue_free(sum2);
 366
 367     e = evalue_read_from_str("i -5 >= 0\n -i + n >= 0\n j -1 >= 0\n i -j >= 0\n"
 368                              "k -1 >= 0\n j -k >= 0\n\n1",
 369                              "i,j,k", &all_vars, &nvar, &nparam,
 370                                 options->MaxRays);
 371     Free_ParamNames(all_vars, nvar+nparam);
 372     sum1 = Bernoulli_sum_evalue(e, 3, options);
 373     sum2 = evalue_read_from_str("n -5 >= 0\n\n"
 374                                 "1/6 * n^3 + 1/2 * n^2 + 1/3 * n + -20",
 375                                 NULL, &all_vars, &nvar, &nparam,
 376                                 options->MaxRays);
 377     Free_ParamNames(all_vars, nvar+nparam);
 378     evalue_negate(sum1);
 379     eadd(sum2, sum1);
 380     reduce_evalue(sum1);
 381     assert(EVALUE_IS_ZERO(*sum1));
 382     evalue_free(e);
 383     evalue_free(sum1);
 384     evalue_free(sum2);
 385 }
 386
 387 int main(int argc, char **argv)
 388 {
 389     struct barvinok_options *options = barvinok_options_new_with_defaults();
 390     test_evalue(options);
 391     test_split_periods(options);
 392     test_specialization(options);
 393     test_lattice_points(options);
 394     test_icounter(options);
 395     test_series(options);
 396     test_todd(options);
 397     test_bernoulli(options);
 398     test_bernoulli_sum(options);
 399     barvinok_options_free(options);
 400 }