Go to the documentation of this file.
65 for (
int i=0;
i<
x.size();
i++) {
70 for (
int i=0;
i<
x.size();
i++) {
75 for (
int i=0;
i<
x.size();
i++) {
80 for (
int i=0;
i<
x.size();
i++) {
85 for (
int i=0;
i<
x.size();
i++) {
90 for (
int i=0;
i<
x.size();
i++) {
136 for (
int i=0;
i<
x.size();
i++)
146 for (
int i=0;
i<
x.size();
i++) {
151 for (
int i=0;
i<
x.size();
i++) {
156 for (
int i=0;
i<
x.size();
i++) {
161 for (
int i=0;
i<
x.size();
i++) {
166 for (
int i=0;
i<
x.size();
i++) {
187 ::
post(home,x0,x1,
r.var())));
191 ::
post(home,x0,x1,
r.var())));
195 ::
post(home,x0,x1,
r.var())));
203 ::
post(home,x0,x1,
r.var())));
207 ::
post(home,x0,x1,
r.var())));
211 ::
post(home,x0,x1,
r.var())));
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)));
261 ::
post(home,x0,x1,
r.var())));
265 ::
post(home,x0,x1,
r.var())));
269 ::
post(home,x0,x1,
r.var())));
282 ::
post(home,x0,x1,
n)));
286 ::
post(home,x0,x1,
n)));
290 ::
post(home,x0,x1,
n)));
432 if ((irt !=
IRT_NQ) && (
x.size() < 2))
466 for (
int i=0;
i<
x.size();
i++)
467 y[
i] =
x[
x.size()-1-
i];
474 for (
int i=0;
i<
x.size();
i++)
475 y[
i] =
x[
x.size()-1-
i];
495 ::
post(home,yv,xv,
true)));
502 ::
post(home,xv,yv,
true)));
509 ::
post(home,yv,xv,
false)));
516 ::
post(home,xv,yv,
false)));
520 if (
x.size() !=
y.size()) {
523 for (
int i=0;
i<
x.size();
i++) {
528 for (
int i=0;
i<
x.size();
i++) {
537 ::
post(home,xv,yv)));
548 ViewArray<Int::ConstIntView>
549 viewarray(Space& home,
const IntArgs&
x) {
550 ViewArray<Int::ConstIntView> xv(home,
x.size());
551 for (
int i=0;
i<
x.size();
i++) {
553 xv[
i] = Int::ConstIntView(
x[
i]);
572 ::
post(home,yv,xv,
true)));
580 ::
post(home,xv,yv,
true)));
588 ::
post(home,yv,xv,
false)));
596 ::
post(home,xv,yv,
false)));
600 if (
x.size() !=
y.size()) {
603 for (
int i=0;
i<
x.size();
i++)
612 ::
post(home,xv,yv)));
623 rel(home,
y,irt,
x,ipl);
Exception: Unknown reification mode passed as argument
Lexical ordering propagator.
Post propagator for SetVar x
IntRelType
Relation types for integers.
Post propagator for SetVar SetOpType SetVar y
n-ary less and less or equal propagator
Less or equal propagator.
@ RM_PMI
Inverse implication for reification.
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Reified less or equal with integer propagator.
@ IRT_GQ
Greater or equal ( )
Reified domain consistent equality with integer propagator.
Passing integer variables.
@ RM_IMP
Implication for reification.
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
IntPropLevel
Propagation levels for integer propagators.
n-ary domain consistent equality propagator
Binary disequality propagator.
Gecode toplevel namespace
IntPropLevel vbd(IntPropLevel ipl)
Extract value, bounds, or domain propagation from propagation level.
Binary domain consistent equality propagator.
Reified binary bounds consistent equality propagator.
Reification specification.
@ RM_EQV
Equivalence for reification (default)
Home class for posting propagators
Nary disequality propagator.
Reified less or equal propagator.
Post propagator for SetVar SetOpType SetVar SetRelType r
@ IPL_DOM
Domain propagation Options: basic versus advanced propagation.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
Lexical disequality propagator.
@ IPL_BND
Bounds propagation.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
void fail(void)
Mark space as failed.
@ IPL_DEF
Simple propagation levels.
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
#define GECODE_POST
Check for failure in a constraint post function.
Reified binary domain consistent equality propagator.
Integer view for integer variables.
Reified bounds consistent equality with integer propagator.
Binary bounds consistent equality propagator.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Exception: Unknown relation passed as argument
n-ary bounds consistent equality propagator
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
int n
Number of negative literals for node type.
Passing integer arguments.
Gecode::IntArgs i({1, 2, 3, 4})
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
@ IRT_LQ
Less or equal ( )
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.