51 for (
int i = x.
size();
i--; ) {
52 t[
i].
a=1; t[
i].
x=x[
i];
64 for (
int i = x.
size();
i--; ) {
65 t[
i].
a=1; t[
i].
x=x[
i];
79 for (
int i = x.
size();
i--; ) {
94 for (
int i = x.
size();
i--; ) {
104 if (home.
failed())
return;
107 for (
int i = x.
size();
i--; ) {
108 t[
i].
a=1; t[
i].
x=x[
i];
125 if (home.
failed())
return;
134 if (home.
failed())
return;
137 for (
int i = x.
size();
i--; ) {
138 t[
i].
a=1; t[
i].
x=x[
i];
150 if (home.
failed())
return;
153 for (
int i = x.
size();
i--; ) {
171 if (home.
failed())
return;
182 if (home.
failed())
return;
185 for (
int i = x.
size();
i--; ) {
bool failed(void) const
Check whether corresponding space is failed.
IntConLevel
Consistency levels for integer propagators.
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatNum c)
Post propagator for .
int size(void) const
Return size of array (number of elements)
void post(Home home, Term< BoolView > *t, int n, IntRelType irt, IntView x, int c, IntConLevel)
Post propagator for linear constraint over Booleans.
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 .
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i(4, 1, 2, 3, 4)
IntRelType
Relation types for integers.
Reification specification.
Passing integer variables.
Passing integer arguments.
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.
void estimate(Term *t, int n, FloatVal c, FloatNum &l, FloatNum &u)
Estimate lower and upper bounds.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Class for describing linear term .
Gecode toplevel namespace
Home class for posting propagators
Exception: Arguments are of different size
struct Gecode::@518::NNF::@57::@59 a
For atomic nodes.