24 #ifndef PPL_Poly_Con_Relation_inlines_hh
25 #define PPL_Poly_Con_Relation_inlines_hh 1
100 #endif // !defined(PPL_Poly_Con_Relation_inlines_hh)
static Poly_Con_Relation is_disjoint()
The polyhedron and the set of points satisfying the constraint are disjoint.
static bool implies(flags_t x, flags_t y)
True if and only if the conjunction x implies the conjunction y.
static Poly_Con_Relation is_included()
The polyhedron is included in the set of points satisfying the constraint.
static Poly_Con_Relation saturates()
The polyhedron is included in the set of points saturating the constraint.
flags_t flags
This holds the current bitset.
Poly_Con_Relation(flags_t mask)
Construct from a bit-mask.
static const flags_t IS_INCLUDED
Poly_Con_Relation operator-(const Poly_Con_Relation &x, const Poly_Con_Relation &y)
flags_t get_flags() const
Access the internal flags: this is needed for some language interfaces.
bool operator!=(const Poly_Con_Relation &x, const Poly_Con_Relation &y)
static const flags_t NOTHING
static const flags_t IS_DISJOINT
static const flags_t SATURATES
static const flags_t STRICTLY_INTERSECTS
unsigned int flags_t
Poly_Con_Relation is implemented by means of a finite bitset.
The entire library is confined to this namespace.
Poly_Con_Relation operator&&(const Poly_Con_Relation &x, const Poly_Con_Relation &y)
bool operator==(const Poly_Con_Relation &x, const Poly_Con_Relation &y)
static Poly_Con_Relation nothing()
The assertion that says nothing.
static Poly_Con_Relation strictly_intersects()
The polyhedron intersects the set of points satisfying the constraint, but it is not included in it...
The relation between a polyhedron and a constraint.