47 for (
int i=0;
i<x.
size();
i++) {
48 t[
i].
a=1; t[
i].
x=x[
i];
60 for (
int i=0;
i<x.
size();
i++) {
61 t[
i].
a=1; t[
i].
x=x[
i];
75 for (
int i=0;
i<x.
size();
i++) {
90 for (
int i=0;
i<x.
size();
i++) {
103 for (
int i=0;
i<x.
size();
i++) {
104 t[
i].
a=1; t[
i].
x=x[
i];
121 if (home.
failed())
return;
133 for (
int i=0;
i<x.
size();
i++) {
134 t[
i].
a=1; t[
i].
x=x[
i];
149 for (
int i=0;
i<x.
size();
i++) {
167 if (home.
failed())
return;
181 for (
int i=0;
i<x.
size();
i++) {
int size(void) const
Return size of array (number of elements)
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c)
Post propagator for .
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i({1, 2, 3, 4})
IntRelType
Relation types for integers.
bool failed(void) const
Check whether corresponding space is failed.
Reification specification.
Passing integer variables.
Passing integer arguments.
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.
Post propagator for SetVar SetOpType SetVar y
void estimate(Term *t, int n, FloatVal c, FloatNum &l, FloatNum &u)
Estimate lower and upper bounds.
Post propagator for SetVar x
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
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
Exception: Arguments are of different size
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.