54 for (
int i=x.
size();
i--; ) {
77 for (
int i=x.
size();
i--; ) {
101 for (
int i = x.
size();
i--; ) {
139 ::
post(home,x,min,max,r.
var())));
143 ::
post(home,x,min,max,r.
var())));
147 ::
post(home,x,min,max,r.
var())));
200 for (
int i=x.
size();
i--; ) {
215 for (
int i=x.
size();
i--; ) {
219 else if (d[i].zero())
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
bool zero(void) const
Test whether view is assigned to be zero.
Inverse implication for reification.
int size(void) const
Return size of array (number of elements)
Range iterator for integer sets.
ReifyMode mode(void) const
Return reification mode.
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
bool one(void) const
Test whether view is assigned to be one.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Reified domain dom-propagator.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Range iterator for integer variable views
int min(int i) const
Return minimum of range at position i.
bool one(void) const
Test whether domain is one.
bool same(const CachedView< View > &x, const CachedView< View > &y)
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
Reified range dom-propagator.
int max(int i) const
Return maximum of range at position i.
Reification specification.
Passing integer variables.
Passing Boolean variables.
Boolean integer variables.
Post propagator for SetVar SetOpType SetVar SetRelType r
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
IntPropLevel
Propagation levels for integer propagators.
Integer view for integer variables.
bool zero(void) const
Test whether domain is zero.
BoolVar var(void) const
Return Boolean control variable.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
Post propagator for SetVar x
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Exception: Unknown reification mode passed as argument
Gecode toplevel namespace
Implication for reification.
#define GECODE_POST
Check for failure in a constraint post function.
Reified domain consistent equality with integer propagator.
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Home class for posting propagators
Exception: Arguments are of different size
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Equivalence for reification (default)
Boolean view for Boolean variables.