8int main(
int argc,
char **argv)
11 const char **param_name;
28 fprintf( stderr,
"Not enough parameters !\n" );
45 printf(
"============ Ehrhart polynomial quick polynomial lower bound ============\n");
47 for( en=e ; en ; en=en->
next ) {
50 printf(
"\n-----------------------------------\n" );
54 if( isatty(0) && nb_parms != 0)
56 printf(
"Evaluation of the Ehrhart polynomial :\n");
57 p = (Value *)malloc(
sizeof(Value) * (nb_parms));
58 for(i=0;i<nb_parms;i++)
62 printf(
"Enter %d parameters : ",nb_parms);
63 for(k=0;k<nb_parms;++k) {
67 fprintf(stdout,
"EP( ");
69 for(k=1;k<nb_parms;++k) {
73 fprintf(stdout,
" ) = ");
#define value_read(val, str)
#define value_print(Dst, fmt, val)
void free_evalue_refs(evalue *e)
releases all memory referenced by e.
void print_evalue(FILE *DST, evalue *e, const char **pname)
Enumeration * Ehrhart_Quick_Apx(Matrix *M, Matrix *C, Matrix **Validity_Lattice, unsigned maxRays)
Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form -> matrix),...
int main(int argc, char **argv)
Value * compute_poly(Enumeration *en, Value *list_args)
Matrix * Matrix_Read(void)
void Matrix_Free(Matrix *Mat)
void mpolyhedron_deflate(Matrix *polyh, unsigned int nb_parms)
deflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is a low...
#define show_matrix(M)
Polylib matrix addons Mainly, deals with polyhedra represented in implicit form (set of constraints).
const char ** Read_ParamNames(FILE *in, int m)
void Free_ParamNames(const char **params, int m)
void Polyhedron_Free(Polyhedron *Pol)
void Print_Domain(FILE *DST, Polyhedron *D, const char **pname)
Polyhedron * ValidityDomain
struct _enumeration * next