Go to the documentation of this file.
38 namespace Gecode {
namespace Int {
178 while (
i() && (
i.max() <
x))
185 while (
i() && (
i.max() <
x))
197 while (
i() && (
i.val() <
x))
204 while (
i() && (
i.val() <
x))
275 unsigned int width(
void)
const;
314 return x.min() ==
y.min();
318 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.
void init(const View &x)
Initialize with ranges for view x.
int min(void) const
Return smallest value of range.
void operator++(void)
Move iterator to next range (if possible)
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
Gecode::IntArgs i(4, 1, 2, 3, 4)
bool same(const CachedView< View > &x, const CachedView< View > &y)
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.
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.
bool before(const CachedView< View > &x, const CachedView< View > &y)
Generic domain change information to be supplied to advisors.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
void update(Space &home, bool share, ConstIntView &y)
Update this view to be a clone of view y.
void update(Space &home, bool share, ConstView &y)
Update this view to be a clone of view y.
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.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
const int max
Largest allowed integer value.
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.
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.