38 #ifndef __GECODE_INT_VALSET_HH__ 39 #define __GECODE_INT_VALSET_HH__ 43 namespace Gecode {
namespace Int {
64 bool empty(
void)
const;
107 unsigned int width(
void)
const;
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
RangeList * fst
First element of range list.
int max(void) const
Return largest value (provided the set is not empty)
bool empty(void) const
Test whether set is empty.
bool operator()(void) const
Test whether iterator is still at a range or done.
RangeList * lst
Last element of range list.
void dispose(Space &home)
Dispose value set.
int size(void) const
Return size (number of values)
void flush(void)
Flush entries.
Ranges(const ValSet &vs)
Initialize.
CompareStatus
Comapre two iterators with each other.
void operator++(void)
Move iterator to next range (if possible)
int n
Number of stored values (integer precision is sufficient)
Iter::Ranges::CompareStatus compare(View x) const
Compare view x with value set.
int min(void) const
Return smallest value (provided the set is not empty)
Post propagator for SetVar x
Class for storing values of already assigned views.
int max(void) const
Return largest value of range.
int min(void) const
Return smallest value of range.
Lists of ranges (intervals)
Gecode toplevel namespace
void update(Space &home, bool share, ValSet &vs)
Update value set during cloning.
bool subset(View x) const
Whether all values of x are included in the value set.
void add(Space &home, int v)
Add value v to value set.