const.hpp
Go to the documentation of this file.
void update(Space &home, ConstView &y)
Update this view to be a clone of view y.
Definition view.hpp:461
Range iterator for singleton range.
Definition ranges-singleton.hpp:42
bool operator()(void) const
Test whether iterator is still at a range or done.
Definition const.hpp:62
unsigned int width(void) const
Return width of range (distance between minimum and maximum).
Definition const.hpp:74
ArrayRanges(int *ranges, int size)
Initialize with ranges for array ranges which is of size size.
Definition const.hpp:51
void init(int *ranges, int size)
Initialize with ranges for array ranges which is of size size.
Definition const.hpp:54
static const int MAX_OF_EMPTY
Returned by empty sets when asked for their maximum element.
Definition var-imp.hpp:110
static const int MIN_OF_EMPTY
Returned by empty sets when asked for their minimum element.
Definition var-imp.hpp:112
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:122
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition const.hpp:105
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:253
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:177
bool operator<(const ConstSetView &y) const
Whether this view comes before view y (arbitrary order).
Definition const.hpp:680
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:183
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:102
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:205
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:191
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:211
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:199
void update(Space &home, ConstSetView &y)
Update this view to be a clone of view y.
Definition const.hpp:217
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:268
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:349
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:291
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:375
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:279
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:337
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:344
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:393
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:341
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:334
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition const.hpp:282
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:354
int min(void) const
int max(void) const
unsigned int width(void) const
Return width of range (distance between minimum and maximum).
Definition const.hpp:655
void init(const T &x)
Initialize with least upper bound ranges for set variable x.
int max(void) const
bool operator()(void) const
Test whether iterator is still at a range or done.
int min(void) const
ModEvent excludeI(Space &home, I &i)
Remove range sequence described by i from least upper bound.
Definition const.hpp:465
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j.
Definition const.hpp:462
bool lubAny(const Delta &d) const
Test whether arbitrary values got pruned from lub.
Definition const.hpp:524
ModEvent includeI(Space &home, I &i)
Include range sequence described by i in greatest lower bound.
Definition const.hpp:470
ModEvent intersectI(Space &home, I &iter)
Intersect least upper bound with range sequence described by i.
Definition const.hpp:481
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
Definition const.hpp:459
ModEvent intersect(Space &home, int i, int j)
Update least upper bound to contain at most all elements between and including i and j.
Definition const.hpp:475
bool notContains(int i) const
Test whether i is not in the least upper bound.
Definition const.hpp:416
bool glbAny(const Delta &d) const
Test whether arbitrary values got pruned from glb.
Definition const.hpp:506
unsigned int glbSize(void) const
Return the number of elements in the greatest lower bound.
Definition const.hpp:404
unsigned int lubSize(void) const
Return the number of elements in the least upper bound.
Definition const.hpp:407
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
Definition core.hpp:2973
void free(T *b, long unsigned int n)
Delete n objects allocated from space heap starting at b.
Definition core.hpp:2999
bool operator==(const CachedView< View > &x, const CachedView< View > &y)
Definition cached.hpp:401
bool operator!=(const CachedView< View > &x, const CachedView< View > &y)
Definition cached.hpp:406
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_NONE
Domain operation has not changed domain.
Definition var-type.hpp:148
const Gecode::ModEvent ME_SET_FAILED
Domain operation has resulted in failure.
Definition var-type.hpp:146
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
