Parma_Polyhedra_Library::PIP_Tree_Node::Artificial_Parameter | Artificial parameters in PIP solution trees |
Parma_Polyhedra_Library::BD_Shape< T > | A bounded difference shape |
Parma_Polyhedra_Library::BHRZ03_Certificate | The convergence certificate for the BHRZ03 widening operator |
Parma_Polyhedra_Library::Box< ITV > | A not necessarily closed, iso-oriented hyperrectangle |
Parma_Polyhedra_Library::C_Polyhedron | A closed convex polyhedron |
Parma_Polyhedra_Library::Checked_Number< T, Policy > | A wrapper for numeric types implementing a given policy |
Parma_Polyhedra_Library::Variable::Compare | Binary predicate defining the total ordering on variables |
Parma_Polyhedra_Library::BHRZ03_Certificate::Compare | A total ordering on BHRZ03 certificates |
Parma_Polyhedra_Library::H79_Certificate::Compare | A total ordering on H79 certificates |
Parma_Polyhedra_Library::Grid_Certificate::Compare | A total ordering on Grid certificates |
Parma_Polyhedra_Library::Congruence | A linear congruence |
Parma_Polyhedra_Library::Congruence_System | A system of congruences |
Parma_Polyhedra_Library::Congruences_Reduction< D1, D2 > | This class provides the reduction method for the Congruences_Product domain |
Parma_Polyhedra_Library::Constraint_System::const_iterator | An iterator over a system of constraints |
Parma_Polyhedra_Library::Generator_System::const_iterator | An iterator over a system of generators |
Parma_Polyhedra_Library::Congruence_System::const_iterator | An iterator over a system of congruences |
Parma_Polyhedra_Library::Grid_Generator_System::const_iterator | An iterator over a system of grid generators |
Parma_Polyhedra_Library::Constraint | A linear equality or inequality |
Parma_Polyhedra_Library::Constraint_System | A system of constraints |
Parma_Polyhedra_Library::Constraints_Reduction< D1, D2 > | This class provides the reduction method for the Constraints_Product domain |
Parma_Polyhedra_Library::Determinate< PSET > | A wrapper for PPL pointsets, providing them with a determinate constraint system interface, as defined in [Bag98] |
Parma_Polyhedra_Library::Domain_Product< D1, D2 > | This class is temporary and will be removed when template typedefs will be supported in C++ |
Parma_Polyhedra_Library::Generator | A line, ray, point or closure point |
Parma_Polyhedra_Library::Generator_System | A system of generators |
Parma_Polyhedra_Library::GMP_Integer | Unbounded integers as provided by the GMP library |
Parma_Polyhedra_Library::Grid | A grid |
Parma_Polyhedra_Library::Grid_Certificate | The convergence certificate for the Grid widening operator |
Parma_Polyhedra_Library::Grid_Generator | A grid line, parameter or grid point |
Parma_Polyhedra_Library::Grid_Generator_System | A system of grid generators |
Parma_Polyhedra_Library::H79_Certificate | A convergence certificate for the H79 widening operator |
Parma_Polyhedra_Library::Interval< Boundary, Info > | A generic, not necessarily closed, possibly restricted interval |
Parma_Polyhedra_Library::Is_Checked< T > | |
Parma_Polyhedra_Library::Is_Checked< Checked_Number< T, P > > | |
Parma_Polyhedra_Library::Is_Native_Or_Checked< T > | |
Parma_Polyhedra_Library::Linear_Expression | A linear expression |
Parma_Polyhedra_Library::MIP_Problem | A Mixed Integer (linear) Programming problem |
Parma_Polyhedra_Library::NNC_Polyhedron | A not necessarily closed convex polyhedron |
Parma_Polyhedra_Library::PIP_Solution_Node::No_Constraints | A tag type to select the alternative copy constructor |
Parma_Polyhedra_Library::No_Reduction< D1, D2 > | This class provides the reduction method for the Direct_Product domain |
Parma_Polyhedra_Library::Octagonal_Shape< T > | An octagonal shape |
Parma_Polyhedra_Library::Partially_Reduced_Product< D1, D2, R > | The partially reduced product of two abstractions |
Parma_Polyhedra_Library::PIP_Decision_Node | A tree node representing a decision in the space of solutions |
Parma_Polyhedra_Library::PIP_Problem | A Parametric Integer (linear) Programming problem |
Parma_Polyhedra_Library::PIP_Solution_Node | A tree node representing part of the space of solutions |
Parma_Polyhedra_Library::PIP_Tree_Node | A node of the PIP solution tree |
Parma_Polyhedra_Library::Pointset_Powerset< PSET > | The powerset construction instantiated on PPL pointset domains |
Parma_Polyhedra_Library::Poly_Con_Relation | The relation between a polyhedron and a constraint |
Parma_Polyhedra_Library::Poly_Gen_Relation | The relation between a polyhedron and a generator |
Parma_Polyhedra_Library::Polyhedron | The base class for convex polyhedra |
Parma_Polyhedra_Library::Powerset< D > | The powerset construction on a base-level domain |
Parma_Polyhedra_Library::Recycle_Input | A tag class |
Parma_Polyhedra_Library::Shape_Preserving_Reduction< D1, D2 > | This class provides the reduction method for the Shape_Preserving_Product domain |
Parma_Polyhedra_Library::Smash_Reduction< D1, D2 > | This class provides the reduction method for the Smash_Product domain |
Parma_Polyhedra_Library::Throwable | User objects the PPL can throw |
Parma_Polyhedra_Library::Variable | A dimension of the vector space |
Parma_Polyhedra_Library::Variables_Set | An std::set of variables' indexes |