58 for (
int i=
x.size();
i--; ) {
81 for (
int i=
x.size();
i--; ) {
104 if (home.
failed())
return;
105 for (
int i =
x.size();
i--; ) {
116 if (home.
failed())
return;
139 if (home.
failed())
return;
163 if (home.
failed())
return;
181 if (home.
failed())
return;
192 if (home.
failed())
return;
204 for (
int i=
x.size();
i--; ) {
205 if (home.
failed())
return;
219 for (
int i=
x.size();
i--; ) {
220 if (home.
failed())
return;
223 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.
IntConLevel
Consistency levels for integer propagators.
Inverse implication for reification.
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
Range iterator for integer sets.
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 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.
unsigned int size(void) const
Return size (cardinality) of set.
bool failed(void) const
Check whether corresponding space is failed.
Reification specification.
Passing integer variables.
Passing Boolean variables.
Boolean integer variables.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Integer view for integer variables.
Node * x
Pointer to corresponding Boolean expression node.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
#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.
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.
Equivalence for reification (default)
Boolean view for Boolean variables.