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