198 for (
int i=s.
size();
i--; ) {
204 for (
int i=s.
size();
i--; ) {
217 for (
int i=s.
size();
i--; ) {
220 ::
post(home,_s,cv)));
227 for (
int i=s.
size();
i--; ) {
230 ::
post(home,_s,cv)));
237 for (
int i=s.
size();
i--; ) {
240 ::
post(home,cv,_s)));
247 for (
int i=s.
size();
i--; ) {
250 ::
post(home,cv,_s)));
257 for (
int i=s.
size();
i--; ) {
262 for (
int i=s.
size();
i--; ) {
273 for (
int i=s.
size();
i--; ) {
276 ::
post(home,_s,cv)));
283 for (
int i=s.
size();
i--; ) {
288 for (
int i=s.
size();
i--; ) {
299 for (
int i=s.
size();
i--; ) {
304 for (
int i=s.
size();
i--; ) {
315 for (
int i=s.
size();
i--; ) {
325 for (
int i=s.
size();
i--; ) {
346 dom(home, s, rt, d, r);
354 dom(home, s, rt, d, r);
370 ::
post(home, s, cv, r.
var())));
376 ::
post(home, s, cv, r.
var())));
382 ::
post(home, s, cv, r.
var())));
489 ::
post(home, s, cv, notb)));
495 ::
post(home, s, cv, notb)));
501 ::
post(home, s, cv, notb)));
515 ::
post(home, s, cv, r.
var())));
521 ::
post(home, s, cv, r.
var())));
527 ::
post(home, s, cv, r.
var())));
541 ::
post(home, cv, s, r.
var())));
547 ::
post(home, cv, s, r.
var())));
553 ::
post(home, cv, s, r.
var())));
574 ::
post(home, s, cvcompl, r.
var())));
580 ::
post(home, s, cvcompl, r.
var())));
586 ::
post(home, s, cvcompl, r.
var())));
606 ::
post(home, s, cvcompl, r.
var())));
612 ::
post(home, s, cvcompl, r.
var())));
618 ::
post(home, s, cvcompl, r.
var())));
649 for (
int i=x.
size();
i--; ) {
unsigned int cardMax(void) const
Return maximum cardinality.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
void check(int n, const char *l)
Check whether integer n is in range, otherwise throw overflow exception with information l...
SetRelType
Common relation types for sets.
Inverse implication for reification.
int size(void) const
Return size of array (number of elements)
const int min
Smallest allowed integer in integer set.
Range iterator for integer sets.
ReifyMode mode(void) const
Return reification mode.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Propagator for set less than or equal
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
unsigned int cardMin(void) const
Return minimum cardinality.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
const int max
Largest allowed integer in integer set.
int min(int i) const
Return minimum of range at position i.
Exception: Unknown relation passed as argument
Reified equality propagator
Gecode::IntArgs i(4, 1, 2, 3, 4)
Range iterator for least upper bound of set variable views
Range iterator for greatest lower bound of set variable views
int max(int i) const
Return maximum of range at position i.
A complement iterator spezialized for the BndSet limits.
Reification specification.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Reified propagator for set less than or equal
bool same(const ConstSetView &x, const ConstSetView &y)
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Post propagator for SetVar SetOpType SetVar SetRelType r
Set view for set variables
Reified subset propagator
BoolVar var(void) const
Return Boolean control variable.
Propagator for negated equality
Post propagator for SetVar x
int ranges(void) const
Return number of ranges of the specification.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
Exception: Unknown reification mode passed as argument
Gecode toplevel namespace
Implication for reification.
#define GECODE_POST
Check for failure in a constraint post function.
Home class for posting propagators
Exception: Arguments are of different size
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Equivalence for reification (default)
Boolean view for Boolean variables.