set.hpp
Go to the documentation of this file.
Range iterator for computing intersection (binary).
Definition ranges-inter.hpp:44
Range iterator for appending a singleton with a range iterator
Definition ranges-singleton-append.hpp:47
Range iterator for singleton range.
Definition ranges-singleton.hpp:42
bool includeI(Space &home, I &i)
Include the set represented by i in this set.
Definition integerset.hpp:296
void init(const SetVarImp *)
Initialize with ranges for variable implementation x.
Definition set.hpp:499
void init(const T &x)
Initialize with greatest lower bound ranges for set variable x.
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
void init(const SetVarImp *)
Initialize with ranges for variable implementation x.
Definition set.hpp:465
void init(const T &x)
Initialize with least upper bound ranges for set variable x.
SetVarImpBase(Gecode::Space &home, SetVarImpBase &x)
Constructor for cloning x.
Definition var-imp.hpp:351
Gecode::ModEvent notify(Gecode::Space &home, Gecode::ModEvent me, Gecode::Delta &d)
Notify that variable implementation has been modified with modification event me and delta informatio...
Definition var-imp.hpp:373
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
ModEvent intersectI(Space &home, I &i)
Exclude everything but set described by i from the least upper bound.
Definition set.hpp:212
ModEvent fail(Space &home)
Definition core.hpp:4829
VarImp * forward(void) const
Definition core.hpp:4481
static ModEvent me(const ModEventDelta &med)
Definition core.hpp:4523
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
Definition ranges-operations.hpp:97
const Gecode::ModEvent ME_SET_CLUB
Domain operation has changed the least upper bound and the cardinality.
Definition var-type.hpp:187
const Gecode::ModEvent ME_SET_NONE
Domain operation has not changed domain.
Definition var-type.hpp:148
const Gecode::ModEvent ME_SET_VAL
Domain operation has resulted in a value (assigned variable).
Definition var-type.hpp:150
const Gecode::ModEvent ME_SET_GLB
Domain operation has changed the greatest lower bound.
Definition var-type.hpp:172
const Gecode::ModEvent ME_SET_CGLB
Domain operation has changed the greatest lower bound and the cardinality.
Definition var-type.hpp:194
const Gecode::ModEvent ME_SET_LUB
Domain operation has changed the least upper bound.
Definition var-type.hpp:164
Gecode toplevel namespace
Gecode::IntSet d(v, 7)
