34namespace Gecode {
namespace Int {
174 while (i() && (i.max() <
x))
181 while (i() && (i.max() <
x))
193 while (i() && (i.val() <
x))
200 while (i() && (i.val() <
x))
246 return min() <
y.min();
285 unsigned int width(
void)
const;
324 return x.min() ==
y.min();
int n
Number of negative literals for node type.
void update(Space &home, ConstView &y)
Update this view to be a clone of view y.
Generic domain change information to be supplied to advisors.
ModEvent narrow_r(Space &home, I &i, bool depends=true)
Replace domain by ranges described by i.
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
bool range(void) const
Test whether domain is a range.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
bool operator<(const ConstIntView &y) const
Whether this view comes before view y (arbitray order)
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
bool in(int n) const
Test whether n is contained in domain.
unsigned int size(void) const
Return size (cardinality) of domain.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
int min(void) const
Return minimum of domain.
int max(void) const
Return maximum of domain.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
void update(Space &home, ConstIntView &y)
Update this view to be a clone of view y.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
ModEvent narrow_v(Space &home, I &i, bool depends=true)
Replace domain by values described by i.
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
ConstIntView(void)
Default constructor.
int val(void) const
Return assigned value (only if assigned)
int med(void) const
Return median of domain (greatest element not greater than the median)
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
void init(const ConstIntView &x)
Initialize with ranges for view x.
Range iterator for integer views.
int max(void) const
Return largest value of range.
bool operator()(void) const
Test whether iterator is still at a range or done.
int min(void) const
Return smallest value of range.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
void operator++(void)
Move iterator to next range (if possible)
ViewRanges(void)
Default constructor.
VarImp * x
Pointer to variable implementation.
const int max
Largest allowed integer value.
const Gecode::ModEvent ME_INT_FAILED
Domain operation has resulted in failure.
bool operator==(const CachedView< View > &x, const CachedView< View > &y)
bool operator!=(const CachedView< View > &x, const CachedView< View > &y)
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar y
Post propagator for SetVar x
int ModEvent
Type for modification events.