42 namespace Test {
namespace Set {
76 Convex
_convex(
"Convex::Convex");
92 int x0min = xr0.
min();
93 int x0max = xr0.
max();
96 if (!xr1())
return false;
97 if (x0min != xr1.
min())
return false;
99 while (xr1()) { x1max = xr1.
max(); ++xr1;}
100 if (x0max != x1max)
return false;
133 ConvexHullS
_convexhulls(
"Convex::Sharing::ConvexHullS");
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
const int min
Smallest allowed integer in integer set.
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Test for convexity propagator
int max(void) const
Return largest value of range.
Test for convex hull propagator
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
ConvexHullS _convexhulls("Convex::Sharing::ConvexHullS")
int min(void) const
Return smallest value of range.
ConvexHull _convexhull("Convex::ConvexHull")
Gecode::IntSet lub
The common superset for all domains.
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Node * x
Pointer to corresponding Boolean expression node.
Sharing test for convex hull propagator.
Convex _convex("Convex::Convex")
Base class for tests with set constraints
Generate all set assignments.
void convex(Home home, SetVar x)
Post propagator that propagates that x is convex.
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
ConvexHullS(const char *t)
Create and register test.
Range iterator producing subsets of an IntSet.
Gecode toplevel namespace
ConvexHull(const char *t)
Create and register test.
Convex(const char *t)
Create and register test.