Download The Parma Polyhedra Library C Language Interface User`s Manual

7.25
ppl_Polyhedron_tag Interface Reference
71
Writes at address pcs a const handle to a system of minimized congruences approximating the polyhedron ph.
• int ppl_Polyhedron_is_empty (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is empty; returns 0 if ph is not empty.
• int ppl_Polyhedron_is_universe (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is a universe polyhedron; returns 0 if it is not.
• int ppl_Polyhedron_is_bounded (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is bounded; returns 0 if ph is unbounded.
• int ppl_Polyhedron_contains_integer_point (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph contains at least one integer point; returns 0 otherwise.
• int ppl_Polyhedron_is_topologically_closed (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is topologically closed; returns 0 if ph is not topologically closed.
• int ppl_Polyhedron_is_discrete (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is a discrete set; returns 0 if ph is not a discrete set.
• int ppl_Polyhedron_constrains (ppl_Polyhedron_t ph, ppl_dimension_type var)
Returns a positive integer if ph constrains var; returns 0 if ph does not constrain var.
• int ppl_Polyhedron_bounds_from_above (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le)
Returns a positive integer if le is bounded from above in ph; returns 0 otherwise.
• int ppl_Polyhedron_bounds_from_below (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le)
Returns a positive integer if le is bounded from below in ph; returns 0 otherwise.
• int ppl_Polyhedron_maximize_with_point (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le, ppl_Coefficient_t sup_n, ppl_Coefficient_t sup_d, int ∗pmaximum, ppl_Generator_t point)
Returns a positive integer if ph is not empty and le is bounded from above in ph, in which case the
supremum value and a point where le reaches it are computed.
• int ppl_Polyhedron_maximize (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le,
ppl_Coefficient_t sup_n, ppl_Coefficient_t sup_d, int ∗pmaximum)
The same as ppl_Polyhedron_maximize_with_point, but without the output argument for the location
where the supremum value is reached.
• int ppl_Polyhedron_minimize_with_point (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le, ppl_Coefficient_t inf_n, ppl_Coefficient_t inf_d, int ∗pminimum, ppl_Generator_t point)
Returns a positive integer if ph is not empty and le is bounded from below in ph, in which case the
infimum value and a point where le reaches it are computed.
• int ppl_Polyhedron_minimize_with_point (ppl_const_Polyhedron_t ph, ppl_const_Linear_Expression_t le, ppl_Coefficient_t inf_n, ppl_Coefficient_t inf_d, int ∗pminimum)
The same as ppl_Polyhedron_minimize_with_point, but without the output argument for the location
where the infimum value is reached.
• int ppl_Polyhedron_contains_Polyhedron (ppl_const_Polyhedron_t x, ppl_const_Polyhedron_t y)
Returns a positive integer if x contains or is equal to y; returns 0 if it does not.
• int ppl_Polyhedron_strictly_contains_Polyhedron (ppl_const_Polyhedron_t x, ppl_const_Polyhedron_t y)
Returns a positive integer if x strictly contains y; returns 0 if it does not.
• int ppl_Polyhedron_is_disjoint_from_Polyhedron (ppl_const_Polyhedron_t x, ppl_const_Polyhedron_t y)
Returns a positive integer if x and y are disjoint; returns 0 if they are not.
• int ppl_Polyhedron_equals_Polyhedron (ppl_const_Polyhedron_t x, ppl_const_Polyhedron_t y)
Returns a positive integer if x and y are the same polyhedron; returns 0 if they are different.
• int ppl_Polyhedron_OK (ppl_const_Polyhedron_t ph)
Returns a positive integer if ph is well formed, i.e., if it satisfies all its implementation invariants; returns
0 and perhaps makes some noise if ph is broken. Useful for debugging purposes.
• int ppl_Polyhedron_external_memory_in_bytes (ppl_const_Polyhedron_t ph, size_t ∗sz)
The PPL C Language Interface User’s Manual (version 1.0). See http://bugseng.com for more information.