8int main(
int argc,
char **argv)
26 fprintf( stderr,
"Not enough parameters !\n" );
43 printf(
"============ Ehrhart polynomial quick polynomial upper bound ============\n");
45 for( en=e ; en ; en=en->
next ) {
48 printf(
"\n-----------------------------------\n" );
52 if( isatty(0) && nb_parms != 0)
54 printf(
"Evaluation of the Ehrhart polynomial :\n");
55 p = (
Value *)malloc(
sizeof(
Value) * (nb_parms));
56 for(i=0;i<nb_parms;i++)
60 printf(
"Enter %d parameters : ",nb_parms);
61 for(k=0;k<nb_parms;++k) {
65 fprintf(stdout,
"EP( ");
67 for(k=1;k<nb_parms;++k) {
71 fprintf(stdout,
" ) = ");
#define value_read(val, str)
#define value_print(Dst, fmt, val)
void print_evalue(FILE *DST, evalue *e, char **pname)
void free_evalue_refs(evalue *e)
releases all memory referenced by e.
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_inflate(Matrix *polyh, unsigned int nb_parms)
inflates a polyhedron (represented as a matrix) P, so that the apx of its Ehrhart Polynomial is an up...
#define show_matrix(M)
Polylib matrix addons Mainly, deals with polyhedra represented in implicit form (set of constraints).
char ** Read_ParamNames(FILE *in, int m)
void Free_ParamNames(char **params, int m)
void Polyhedron_Free(Polyhedron *Pol)
void Print_Domain(FILE *DST, Polyhedron *D, char **pname)
Polyhedron * ValidityDomain
struct _enumeration * next