65 for (
int i=x.
size();
i--; ) {
70 for (
int i=x.
size();
i--; ) {
75 for (
int i=x.
size();
i--; ) {
80 for (
int i=x.
size();
i--; ) {
85 for (
int i=x.
size();
i--; ) {
90 for (
int i=x.
size();
i--; ) {
136 for (
int i=x.
size();
i--; )
146 for (
int i=x.
size();
i--; ) {
151 for (
int i=x.
size();
i--; ) {
156 for (
int i=x.
size();
i--; ) {
161 for (
int i=x.
size();
i--; ) {
166 for (
int i=x.
size();
i--; ) {
224 ::
post(home,x0,x1,
n)));
228 ::
post(home,x0,x1,
n)));
232 ::
post(home,x0,x1,
n)));
240 ::
post(home,x0,x1,
n)));
244 ::
post(home,x0,x1,
n)));
248 ::
post(home,x0,x1,
n)));
282 ::
post(home,x0,x1,
n)));
286 ::
post(home,x0,x1,
n)));
290 ::
post(home,x0,x1,
n)));
350 ::
post(home,x,n,nb)));
354 ::
post(home,x,n,nb)));
358 ::
post(home,x,n,nb)));
366 ::
post(home,x,n,nb)));
370 ::
post(home,x,n,nb)));
374 ::
post(home,x,n,nb)));
408 ::
post(home,x,n,nb)));
412 ::
post(home,x,n,nb)));
416 ::
post(home,x,n,nb)));
466 for (
int i=x.
size();
i--; )
470 for (
int i=x.
size()-1;
i--; )
476 for (
int i=x.
size(); i--; )
497 ::
post(home,yv,xv,
true)));
504 ::
post(home,xv,yv,
true)));
511 ::
post(home,yv,xv,
false)));
518 ::
post(home,xv,yv,
false)));
525 for (
int i=x.
size();
i--; ) {
527 ::
post(home,x[
i],y[i])));
530 for (
int i=x.
size();
i--; ) {
532 ::
post(home,x[
i],y[i])));
539 ::
post(home,xv,yv)));
553 for (
int i = x.
size();
i--; ) {
574 ::
post(home,yv,xv,
true)));
582 ::
post(home,xv,yv,
true)));
590 ::
post(home,yv,xv,
false)));
598 ::
post(home,xv,yv,
false)));
605 for (
int i=x.
size();
i--; )
614 ::
post(home,xv,yv)));
625 rel(home,y,irt,x,ipl);
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Inverse implication for reification.
int size(void) const
Return size of array (number of elements)
Binary domain consistent equality propagator.
ReifyMode mode(void) const
Return reification mode.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
Reified less or equal with integer propagator.
Lexical disequality propagator.
n-ary domain consistent equality propagator
Reified less or equal propagator.
Nary disequality propagator.
Exception: Unknown relation passed as argument
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
IntRelType
Relation types for integers.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
Simple propagation levels.
Reified binary domain consistent equality propagator.
Reification specification.
Binary bounds consistent equality propagator.
Less or equal propagator.
Reified binary bounds consistent equality propagator.
Passing integer variables.
n-ary less and less or equal propagator
Passing integer arguments.
Post propagator for SetVar SetOpType SetVar SetRelType r
Reified bounds consistent equality with integer propagator.
IntPropLevel
Propagation levels for integer propagators.
Integer view for integer variables.
Post propagator for SetVar SetOpType SetVar y
Lexical ordering propagator.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Domain propagation Options: basic versus advanced propagation.
BoolVar var(void) const
Return Boolean control variable.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
Binary disequality propagator.
Post propagator for SetVar x
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void fail(void)
Mark space as failed.
n-ary bounds consistent equality propagator
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
#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)
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.