124 for (
int i=0;
i<x.
size();
i++) {
125 ix[
i].idx=
i; ix[
i].view=x[
i];
129 ::
post(home,ix,yv)));
132 ::
post(home,ix,yv)));
151 for (
int i=0;
i<x.
size();
i++) {
152 ix[
i].idx=
i; ix[
i].view=x[
i];
156 ::
post(home,ix,yv)));
159 ::
post(home,ix,yv)));
177 for (
int i=0;
i<x.
size();
i++) {
182 ::
post(home,ix,yv)));
185 ::
post(home,ix,yv)));
204 for (
int i=0;
i<x.
size();
i++) {
209 ::
post(home,ix,yv)));
212 ::
post(home,ix,yv)));
238 t[0].
a = 1; t[0].
x = prod;
239 t[1].
a = 1; t[1].
x = x3;
245 t[2].
a=-1; t[2].
x=x0;
247 if (home.
failed())
return;
268 divmod(home, x0, x1, _div, x2, ipl);
278 ::
post(home,x0,x1,ops));
281 ::
post(home,x0,x1,ops));
292 ::
post(home,x0,x1,ops));
295 ::
post(home,x0,x1,ops));
305 sqr(home, x0, x1, ipl);
311 ::
post(home,x0,x1,ops));
314 ::
post(home,x0,x1,ops));
324 sqrt(home, x0, x1, ipl);
330 ::
post(home,x0,x1,ops));
333 ::
post(home,x0,x1,ops));
void mod(Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl)
Post propagator for .
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Integer division/modulo propagator.
void mult(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
int size(void) const
Return size of array (number of elements)
Domain consistent ternary maximum propagator.
Domain consistent n-th root propagator.
Domain consistent n-ary maximum propagator.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
void nroot(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n 0$.
void pow(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n 0$.
Exception: Too few arguments available in argument array
void nonnegative(int n, const char *l)
Check whether n is in range and nonnegative, otherwise throw out of limits with information l...
void argmin(Home home, const IntVarArgs &x, IntVar y, bool tiebreak, IntPropLevel)
Post propagator for .
Bounds consistent power propagator.
static ExecStatus post(Home home, IntView x0, IntView x1, IntView x2)
Post propagator .
const int max
Largest allowed integer value.
const int min
Smallest allowed integer value.
Bounds consistent absolute value propagator.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
int n
Number of negative literals for node type.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
Gecode::IntArgs i({1, 2, 3, 4})
void divmod(Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntPropLevel)
Post propagator for .
Domain consistent absolute value propagator.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
void sqrt(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
bool failed(void) const
Check whether corresponding space is failed.
Operations for square and square-root propagators.
void argmax(Home home, const IntVarArgs &x, IntVar y, bool tiebreak, IntPropLevel)
Post propagator for .
Bounds consistent n-ary maximum propagator.
Argument maximum propagator.
Passing integer variables.
Bounds consistent division propagator.
bool same(VarArgArray< Var > x, VarArgArray< Var > y)
Domain consistent power propagator.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
TieBreak< VarBranch > tiebreak(VarBranch a, VarBranch b)
Combine variable selection criteria a and b for tie-breaking.
IntPropLevel
Propagation levels for integer propagators.
Integer view for integer variables.
Post propagator for SetVar SetOpType SetVar y
void div(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
static ExecStatus post(Home home, IntView x0, IntView x1, IntView x2)
Post propagator .
Operations for power and nroot propagators.
Bounds consistent ternary maximum propagator.
Exception: Arguments contain same variable multiply
void estimate(Term< View > *t, int n, int c, int &l, int &u)
Estimate lower and upper bounds.
Domain propagation Options: basic versus advanced propagation.
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.
An array of IdxView pairs.
Class for describing linear term .
Gecode toplevel namespace
void post(Home home, Term< BoolView > *t, int n, IntRelType irt, IntView x, int c, IntPropLevel)
Post propagator for linear constraint over Booleans.
#define GECODE_POST
Check for failure in a constraint post function.
Home class for posting propagators
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Bounds consistent n-th root propagator.
void positive(int n, const char *l)
Check whether n is in range and strictly positive, otherwise throw out of limits with information l...
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.