44 namespace Gecode {
namespace Set {
static bool lubAny(const Delta &d)
Test whether arbitrary values got pruned from lub.
unsigned int cardMin(void) const
Return minimum cardinality.
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
ModEvent exclude(Space &home, int n)
Exclude n from the least upper bound.
VarImpType * varimp(void) const
Return variable implementation of view.
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
int glbMin(void) const
Return minimum of the greatest lower bound.
unsigned int unknownSize(void) const
Return the number of unknown elements.
int glbMin(void) const
Return minimum of the greatest lower bound.
int lubMinN(unsigned int n) const
Return n -th smallest element in the least upper bound.
ModEvent excludeI(Space &home, I &i)
Exclude set described by i from the least upper bound.
int ModEvent
Type for modification events.
unsigned int cardMax(void) const
Return maximum cardinality.
static ModEvent modevent(const Delta &d)
Return modification event.
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j...
Range iterator for the greatest lower bound.
Finite integer set variable implementation.
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
ModEvent intersect(Space &home, int n)
Exclude everything but n from the least upper bound.
static ModEvent modevent(const Delta &d)
Return modification event.
Range iterator for the least upper bound.
int glbMax(void) const
Return maximum of the greatest lower bound.
int lubMax(void) const
Return maximum of the least upper bound.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
unsigned int cardMax(void) const
Return current cardinality maximum.
static bool glbAny(const Delta &d)
Test whether arbitrary values got pruned from glb.
unsigned int cardMin(void) const
Return current cardinality minimum.
int lubMin(void) const
Return minimum of the least upper bound.
ModEvent includeI(Space &home, I &i)
Include set described by i in the greatest lower bound.
int glbMax(void) const
Return maximum of the greatest lower bound.
SetView(void)
Default constructor.
int lubMinN(unsigned int n) const
Return n-th smallest element of the least upper bound.
Base-class for variable implementation views.
bool contains(int i) const
Test whether i is in the greatest lower bound.
bool knownOut(int) const
Test whether n is not contained in least upper bound.
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
bool notContains(int i) const
Test whether i is not in the least upper bound.
ModEvent include(Space &home, int n)
Include n in the greatest lower bound.
int lubMax(void) const
Return maximum of the least upper bound.
bool knownIn(int n) const
Test whether n is contained in greatest lower bound.
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Set view for set variables
ModEvent intersectI(Space &home, I &i)
Exclude everything but set described by i from the least upper bound.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
unsigned int lubSize(void) const
Return the size of the least upper bound.
GlbRanges(void)
Default constructor.
void init(const T &x)
Initialize with least upper bound ranges for set variable x.
int lubMin(void) const
Return minimum of the least upper bound.
unsigned int glbSize(void) const
Return the size of the greatest lower bound.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
Gecode toplevel namespace
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
LubRanges(void)
Default constructor.
VarImpType * x
Pointer to variable implementation.
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
void init(const T &x)
Initialize with greatest lower bound ranges for set variable x.