65 ::
post(home,cy,
x,zv)));
78 ::
post(home,cy,
x,tmp)));
87 ::
post(home,tmp,zv)));
95 ::
post(home,cy,
x,tmp)));
106 ::
post(home,cy,
x,zv)));
124 ::
post(home,cy,xv,tmp)));
141 ::
post(home,cy,
x,tmp)));
Node * x
Pointer to corresponding Boolean expression node.
Home class for posting propagators
Range iterator for integer sets.
static const IntSet empty
Empty set.
Exception: Unknown relation passed as argument
Range iterator for greatest lower bound of constant set view
A complement iterator spezialized for the BndSet limits.
Propagator for ternary intersection
Propagator for the superset of intersection
Propagator for ternary union
Propagator for negated equality
Set view for set variables
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Post propagator for SetVar SetOpType SetVar y
Post propagator for SetVar SetOpType op
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
SetOpType
Common operations for sets.
SetRelType
Common relation types for sets.
@ SRT_GQ
Greater or equal ( )
@ SRT_LQ
Less or equal ( )
void check(int n, const char *l)
Check whether integer n is in range, otherwise throw overflow exception with information l.
const int min
Smallest allowed integer in integer set.
const int max
Largest allowed integer in integer set.
Standard set operation propagators.
Standard set relation propagators.