46 using namespace Gecode::Set;
47 using namespace Gecode::Set::Rel;
48 using namespace Gecode::Set::RelOp;
69 ::
post(home,cy,x,zv)));
82 ::
post(home,cy,x,tmp)));
91 ::
post(home,tmp,zv)));
99 ::
post(home,cy,x,tmp)));
110 ::
post(home,cy,x,zv)));
128 ::
post(home,cy,xv,tmp)));
145 ::
post(home,cy,x,tmp)));
162 rel(home, y, op, x, r, z);
Range iterator for greatest lower bound of constant set view
Propagator for negated equality
void check(int n, const char *l)
Check whether integer n is in range, otherwise throw overflow exception with information l...
SetRelType
Common relation types for sets.
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
const int min
Smallest allowed integer in integer set.
Range iterator for integer sets.
const FloatNum max
Largest allowed float value.
Propagator for ternary union
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
SetOpType
Common operations for sets.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
const int max
Largest allowed integer in integer set.
Exception: Unknown relation passed as argument
const FloatNum min
Smallest allowed float value.
A complement iterator spezialized for the BndSet limits.
static const IntSet empty
Empty set.
Set view for set variables
Node * x
Pointer to corresponding Boolean expression node.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Propagator for the superset of intersection
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Home class for posting propagators
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Propagator for ternary intersection