54 for (
int i=0;
i<
x.size();
i++) {
77 for (
int i=0;
i<
x.size();
i++) {
101 for (
int i=0;
i<
x.size();
i++) {
200 for (
int i=0;
i<
x.size();
i++) {
215 for (
int i=0;
i<
x.size();
i++) {
219 else if (
d[
i].zero())
int n
Number of negative literals for node type.
Node * x
Pointer to corresponding Boolean expression node.
Passing Boolean variables.
Boolean integer variables.
Home class for posting propagators
Range iterator for integer sets.
int min(int i) const
Return minimum of range at position i.
int max(int i) const
Return maximum of range at position i.
unsigned int size(void) const
Return size (cardinality) of set.
Passing integer variables.
Exception: Arguments are of different size
Boolean view for Boolean variables.
Reified domain dom-propagator.
Reified range dom-propagator.
Integer view for integer variables.
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
Reified domain consistent equality with integer propagator.
Exception: Unknown reification mode passed as argument
Range iterator for integer variable views
Reification specification.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
#define GECODE_POST
Check for failure in a constraint post function.
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
IntPropLevel
Propagation levels for integer propagators.
@ RM_IMP
Implication for reification.
@ RM_PMI
Inverse implication for reification.
@ RM_EQV
Equivalence for reification (default)
const FloatNum max
Largest allowed float value.
const FloatNum min
Smallest allowed float value.
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
Gecode::IntArgs i({1, 2, 3, 4})