88 int x0min = xr0.
min();
89 int x0max = xr0.
max();
92 if (!xr1())
return false;
93 if (x0min != xr1.
min())
return false;
95 while (xr1()) { x1max = xr1.
max(); ++xr1;}
96 if (x0max != x1max)
return false;
int min(void) const
Return smallest value of range.
int max(void) const
Return largest value of range.
Sharing test for convex hull propagator.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
ConvexHullS(const char *t)
Create and register test.
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Test for convex hull propagator
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
ConvexHull(const char *t)
Create and register test.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Test for convexity propagator
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Convex(const char *t)
Create and register test.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Range iterator producing subsets of an IntSet.
Generate all set assignments.
SetTest(const std::string &s, int a, const Gecode::IntSet &d, bool r=false, int w=0)
Constructor.
const int min
Smallest allowed integer in integer set.
Gecode toplevel namespace
Post propagator that propagates that a x is convex void convex(Home home, SetVar x)
Post propagator for SetVar x
ConvexHullS _convexhulls("Convex::Sharing::ConvexHullS")
Convex _convex("Convex::Convex")
ConvexHull _convexhull("Convex::ConvexHull")