var-imp.hpp
Go to the documentation of this file.
Range iterator for computing the complement (described by template arguments).
Definition ranges-compl.hpp:49
bool overwrite(Space &home, I &i)
Overwrite the ranges with those represented by i.
Definition integerset.hpp:171
static const int MAX_OF_EMPTY
Returned by empty sets when asked for their maximum element.
Definition var-imp.hpp:110
void update(Space &home, BndSet &x)
Update this set to be a clone of set x.
Definition integerset.hpp:140
static const int MIN_OF_EMPTY
Returned by empty sets when asked for their minimum element.
Definition var-imp.hpp:112
bool includeI(Space &home, I &i)
Include the set represented by i in this set.
Definition integerset.hpp:296
bool include(Space &home, int i, int j, SetDelta &d)
Include the set in this set.
Definition integerset.hpp:279
bool operator()(void) const
Test whether iterator is still at a range or done.
void init(const T &x)
Initialize with greatest lower bound ranges for set variable x.
unsigned int width(void) const
Return width of range (distance between minimum and maximum).
GlbRanges(const T &x)
Initialize with greatest lower bound ranges for set variable x.
void init(Space &home)
Initialize as the full set including everything between Limits::min and Limits::max.
Definition integerset.hpp:328
bool intersectI(Space &home, I &i)
Exclude all elements not in the set represented by i from this set.
Definition integerset.hpp:370
bool excludeI(Space &home, I &i)
Exclude all elements in the set represented by i from this set.
Definition integerset.hpp:385
bool intersect(Space &home, int i, int j)
Intersect this set with the set .
Definition integerset.hpp:355
bool exclude(Space &home, int i, int j, SetDelta &d)
Exclude the set from this set.
Definition integerset.hpp:339
unsigned int width(void) const
Return width of range (distance between minimum and maximum).
void init(const T &x)
Initialize with least upper bound ranges for set variable x.
bool operator()(void) const
Test whether iterator is still at a range or done.
LubRanges(const T &x)
Initialize with least upper bound ranges for set variable x.
bool glbAny(void) const
Test whether delta represents any domain change in glb.
Definition delta.hpp:64
bool lubAny(void) const
Test whether delta represents any domain change in lub.
Definition delta.hpp:68
SetVarImpBase(Gecode::Space &home, SetVarImpBase &x)
Constructor for cloning x.
Definition var-imp.hpp:351
static void schedule(Gecode::Space &home, Gecode::Propagator &p, Gecode::ModEvent me)
Schedule propagator p.
Definition var-imp.hpp:364
ModEvent intersect(Space &home, int n)
Exclude everything but n from the least upper bound.
Definition set.hpp:206
int lubMinN(unsigned int n) const
Return n -th smallest element in the least upper bound.
Definition set.hpp:117
static bool lubAny(const Delta &d)
Test whether arbitrary values got pruned from lub.
Definition set.hpp:156
ModEvent excludeI(Space &home, I &i)
Exclude set described by i from the least upper bound.
Definition set.hpp:367
static bool glbAny(const Delta &d)
Test whether arbitrary values got pruned from glb.
Definition set.hpp:144
ModEvent includeI(Space &home, I &i)
Include set described by i in the greatest lower bound.
Definition set.hpp:292
void reschedule(Space &home, Propagator &p, PropCond pc)
Re-schedule propagator p with propagation condition pc.
Definition set.cpp:149
ModEvent intersectI(Space &home, I &i)
Exclude everything but set described by i from the least upper bound.
Definition set.hpp:212
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to variable.
Definition set.cpp:140
ModEvent fail(Space &home)
Definition core.hpp:4829
Gecode toplevel namespace
