2 #include <barvinok/evalue.h>
3 #include <barvinok/barvinok.h>
6 #ifdef HAVE_GROWING_CHERNIKOVA
12 int main(int argc
, char **argv
)
16 Polyhedron
*D
, *P
, *N
;
18 int exist
, nparam
, nvar
;
23 A
= Constraints2Polyhedron(M
, MAXRAYS
);
27 while ((*s
=='#') || (sscanf(s
, "E %d", &exist
)<1))
31 while ((*s
=='#') || (sscanf(s
, "P %d", &nparam
)<1))
34 Polyhedron_Print(stdout
, P_VALUE_FMT
, A
);
35 printf("exist: %d, nparam: %d\n", exist
, nparam
);
36 param_name
= Read_ParamNames(stdin
, nparam
);
38 nvar
= A
->Dimension
- exist
- nparam
;
39 D
= pip_projectout(A
, nvar
, exist
, nparam
);
42 evalue_set_si(&sum
, 0, 1);
43 for (P
= D
; P
; P
= N
) {
47 exist
= P
->Dimension
- nvar
- nparam
;
48 EP
= barvinok_enumerate_e(P
, exist
, nparam
, MAXRAYS
);
49 print_evalue(stderr
, EP
, param_name
);
52 print_evalue(stderr
, &sum
, param_name
);