66 if ((q < 1) || (q > x.
size()))
80 if ((0 == l) && (q == u))
85 for (
int i=x.
size();
i--; ) {
95 for (
int i=x.
size();
i--; ) {
107 (home,xv,s.
min(),q,
l,
u)));
118 if ((s.
min() < 0) || (s.
max() > 1))
131 if ((q < 1) || (q > x.
size()))
145 if ((0 == l) && (q == u))
149 if ((s.
min() == 0) && (s.
max() == 1)) {
150 if ((l > 0) || (u < q))
154 assert(s.
min() == s.
max());
159 for (
int i=x.
size();
i--; ) {
163 assert(s.
min() == 1);
164 for (
int i=x.
size();
i--; ) {
174 for (
int i=x.
size();
i--; ) {
178 assert(s.
min() == 1);
179 for (
int i=x.
size();
i--; ) {
190 (home,xv,s.
min(),q,
l,
u)));
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
bool zero(void) const
Test whether view is assigned to be zero.
Exception: Value out of limits
int size(void) const
Return size of array (number of elements)
Range iterator for integer sets.
void sequence(Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntPropLevel)
Post propagator for .
const FloatNum max
Largest allowed float value.
bool one(void) const
Test whether view is assigned to be one.
Exception: Too few arguments available in argument array
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
int min(int i) const
Return minimum of range at position i.
const FloatNum min
Smallest allowed float value.
Gecode::IntArgs i(4, 1, 2, 3, 4)
bool same(void) const
Test whether array contains same variable multiply.
Sequence propagator for array of integers
int max(int i) const
Return maximum of range at position i.
unsigned int size(void) const
Return size (cardinality) of set.
union Gecode::@585::NNF::@62 u
Union depending on nodetype t.
Passing integer variables.
Passing Boolean variables.
IntPropLevel
Propagation levels for integer propagators.
Integer view for integer variables.
Exception: Arguments contain same variable multiply
Post propagator for SetVar x
Exception: Not 0/1 integer
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void fail(void)
Mark space as failed.
Gecode toplevel namespace
#define GECODE_POST
Check for failure in a constraint post function.
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Home class for posting propagators
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Boolean view for Boolean variables.