52 for (
int i=
n;
i--; ) {
67 for (
int i=
n;
i--; ) {
78 if (
a.size() !=
x.size())
86 for (
int i=
n;
i--; ) {
97 if (
a.size() !=
x.size())
106 for (
int i=
n;
i--; ) {
124 if (home.
failed())
return;
131 if (home.
failed())
return;
136 for (
int i=
n;
i--; ) {
146 if (home.
failed())
return;
151 for (
int i=
n;
i--; ) {
162 if (
a.size() !=
x.size())
164 if (home.
failed())
return;
169 for (
int i=
n;
i--; ) {
180 if (
a.size() !=
x.size())
182 if (home.
failed())
return;
187 for (
int i=
n;
i--; ) {
IntConLevel
Consistency levels for integer propagators.
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatNum c)
Post propagator for .
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.
bool failed(void) const
Check whether corresponding space is failed.
Reification specification.
Passing integer arguments.
Passing Boolean variables.
struct Gecode::@511::NNF::@54::@56 a
For atomic nodes.
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