Go to the documentation of this file.
202 for (
int i=s.size();
i--; ) {
208 for (
int i=s.size();
i--; ) {
221 for (
int i=s.size();
i--; ) {
224 ::
post(home,_s,cv)));
231 for (
int i=s.size();
i--; ) {
234 ::
post(home,_s,cv)));
241 for (
int i=s.size();
i--; ) {
244 ::
post(home,cv,_s)));
251 for (
int i=s.size();
i--; ) {
254 ::
post(home,cv,_s)));
261 for (
int i=s.size();
i--; ) {
266 for (
int i=s.size();
i--; ) {
277 for (
int i=s.size();
i--; ) {
280 ::
post(home,_s,cv)));
287 for (
int i=s.size();
i--; ) {
292 for (
int i=s.size();
i--; ) {
303 for (
int i=s.size();
i--; ) {
308 for (
int i=s.size();
i--; ) {
319 for (
int i=s.size();
i--; ) {
329 for (
int i=s.size();
i--; ) {
350 dom(home, s, rt,
d,
r);
358 dom(home, s, rt,
d,
r);
374 ::
post(home, s, cv,
r.var())));
380 ::
post(home, s, cv,
r.var())));
386 ::
post(home, s, cv,
r.var())));
445 ::
post(home,cv,s,
r.var())));
450 ::
post(home,cv,s,
r.var())));
455 ::
post(home,cv,s,
r.var())));
468 ::
post(home,cv,s,
r.var())));
473 ::
post(home,cv,s,
r.var())));
478 ::
post(home,cv,s,
r.var())));
493 ::
post(home, s, cv, notb)));
499 ::
post(home, s, cv, notb)));
505 ::
post(home, s, cv, notb)));
519 ::
post(home, s, cv,
r.var())));
525 ::
post(home, s, cv,
r.var())));
531 ::
post(home, s, cv,
r.var())));
545 ::
post(home, cv, s,
r.var())));
551 ::
post(home, cv, s,
r.var())));
557 ::
post(home, cv, s,
r.var())));
578 ::
post(home, s, cvcompl,
r.var())));
584 ::
post(home, s, cvcompl,
r.var())));
590 ::
post(home, s, cvcompl,
r.var())));
610 ::
post(home, s, cvcompl,
r.var())));
616 ::
post(home, s, cvcompl,
r.var())));
622 ::
post(home, s, cvcompl,
r.var())));
653 for (
int i=
x.size();
i--; ) {
Exception: Unknown reification mode passed as argument
Post propagator for SetVar x
Exception: Arguments are of different size
unsigned int cardMax(void) const
Return maximum cardinality.
int min(int i) const
Return minimum of range at position i.
@ RM_PMI
Inverse implication for reification.
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Range iterator for least upper bound of set variable views
int max(int i) const
Return maximum of range at position i.
const int min
Smallest allowed integer in integer set.
@ RM_IMP
Implication for reification.
Gecode::IntArgs i(4, 1, 2, 3, 4)
@ SRT_LQ
Less or equal ( )
@ SRT_GQ
Greater or equal ( )
Range iterator for greatest lower bound of set variable views
Range iterator for integer sets.
unsigned int size(void) const
Return size (cardinality) of set.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Boolean view for Boolean variables.
Gecode toplevel namespace
const int max
Largest allowed integer in integer set.
unsigned int cardMin(void) const
Return minimum cardinality.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
A complement iterator spezialized for the BndSet limits.
Reification specification.
@ RM_EQV
Equivalence for reification (default)
Home class for posting propagators
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Post propagator for SetVar SetOpType SetVar SetRelType r
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Reified equality propagator
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
SetRelType
Common relation types for sets.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Set view for set variables
Reified propagator for set less than or equal
Propagator for negated equality
void check(int n, const char *l)
Check whether integer n is in range, otherwise throw overflow exception with information l.
#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.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Exception: Unknown relation passed as argument
bool same(const ConstSetView &x, const ConstSetView &y)
Propagator for set less than or equal
Reified subset propagator
int ranges(void) const
Return number of ranges of the specification.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.