47 for (
int i=0;
i<
x.size();
i++) {
60 for (
int i=0;
i<
x.size();
i++) {
70 if (
a.size() !=
x.size())
75 for (
int i=0;
i<
x.size();
i++) {
85 if (
a.size() !=
x.size())
90 for (
int i=0;
i<
x.size();
i++) {
103 for (
int i=0;
i<
x.size();
i++) {
121 if (home.
failed())
return;
122 t[
x.size()].a=-1;
t[
x.size()].x=
y;
133 for (
int i=0;
i<
x.size();
i++) {
136 t[
x.size()].a=-1;
t[
x.size()].x=
y;
144 if (
a.size() !=
x.size())
149 for (
int i=0;
i<
x.size();
i++) {
167 if (home.
failed())
return;
168 t[
x.size()].a=-1;
t[
x.size()].x=
y;
176 if (
a.size() !=
x.size())
181 for (
int i=0;
i<
x.size();
i++) {
184 t[
x.size()].a=-1;
t[
x.size()].x=
y;
Node * x
Pointer to corresponding Boolean expression node.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Home class for posting propagators
bool failed(void) const
Check whether corresponding space is failed.
Passing integer arguments.
Passing integer variables.
Exception: Arguments are of different size
Integer view for integer variables.
Class for describing linear term .
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
Reification specification.
Post propagator for SetVar SetOpType SetVar y
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.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void linear(Home home, const IntArgs &a, const IntVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel)
Post propagator for .
IntRelType
Relation types for integers.
IntPropLevel
Propagation levels for integer propagators.
@ IRT_GQ
Greater or equal ( )
@ IRT_LQ
Less or equal ( )
const FloatNum max
Largest allowed float value.
const FloatNum min
Smallest allowed float value.
void estimate(Term *t, int n, FloatVal c, FloatNum &l, FloatNum &u)
Estimate lower and upper bounds.
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i({1, 2, 3, 4})