52 for (
int i=n;
i--; ) {
53 t[
i].
a=1; t[
i].
x=x[
i];
67 for (
int i=n;
i--; ) {
68 t[
i].
a=1; t[
i].
x=x[
i];
86 for (
int i=n;
i--; ) {
106 for (
int i=n;
i--; ) {
124 if (home.
failed())
return;
131 if (home.
failed())
return;
136 for (
int i=n;
i--; ) {
137 t[
i].
a=1; t[
i].
x=x[
i];
146 if (home.
failed())
return;
151 for (
int i=n;
i--; ) {
152 t[
i].
a=1; t[
i].
x=x[
i];
164 if (home.
failed())
return;
169 for (
int i=n;
i--; ) {
182 if (home.
failed())
return;
187 for (
int i=n;
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)
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.
Reification specification.
struct Gecode::@519::NNF::@60::@62 a
For atomic nodes.
Passing integer arguments.
Passing Boolean variables.
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.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Class for describing linear term .
Home class for posting propagators
Exception: Arguments are of different size