47 Convex::copy(
Space& home,
bool share) {
48 return new (home)
Convex(home,share,*
this);
67 unsigned int maxWidth = 0;
68 for (;ubRangeIt();++ubRangeIt) {
82 for (; ubRangeItC(); ++ubRangeItC) {
unsigned int cardMin(void) const
Return minimum cardinality.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
ExecStatus ES_SUBSUMED(Propagator &p)
const FloatNum max
Largest allowed float value.
int min(void) const
Return smallest value of range.
int glbMin(void) const
Return minimum of the greatest lower bound.
unsigned int cardMax(void) const
Return maximum cardinality.
Propagation has computed fixpoint.
Base-class for both propagators and branchers.
Range iterator for least upper bound of set variable views
int glbMax(void) const
Return maximum of the greatest lower bound.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Convex(Space &home, bool share, Convex &p)
Constructor for cloning p.
bool assigned(void) const
Test whether view is assigned.
int max(void) const
Return largest value of range.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
Gecode toplevel namespace
Propagator for the convex constraint
int ModEventDelta
Modification event deltas.