48 for (
int i=0;
i<
n;
i++) {
63 for (
int i=0;
i<
n;
i++) {
74 if (
a.size() !=
x.size())
82 for (
int i=0;
i<
n;
i++) {
93 if (
a.size() !=
x.size())
102 for (
int i=0;
i<
n;
i++) {
120 if (home.
failed())
return;
132 for (
int i=0;
i<
n;
i++) {
147 for (
int i=0;
i<
n;
i++) {
158 if (
a.size() !=
x.size())
165 for (
int i=0;
i<
n;
i++) {
176 if (
a.size() !=
x.size())
183 for (
int i=0;
i<
n;
i++) {
int n
Number of negative literals for node type.
Node * x
Pointer to corresponding Boolean expression node.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Passing Boolean variables.
Home class for posting propagators
bool failed(void) const
Check whether corresponding space is failed.
Passing integer arguments.
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 BoolVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel ipl)
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})