34 namespace Gecode {
namespace Int {
172 while (
i() && (i.max() < 0))
179 while (
i() && (i.max() < 0))
191 while (
i() && (i.val() < 0))
198 while (
i() && (i.val() < 0))
247 bool operator ()(
void)
const;
250 void operator ++(
void);
260 unsigned int width(
void)
const;
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
int min(void) const
Return minimum of domain.
bool range(void) const
Test whether domain is a range.
ModEvent narrow_r(Space &home, I &i, bool depends=true)
Replace domain by ranges described by i.
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
int med(void) const
Return median of domain (greatest element not greater than the median)
ViewRanges(void)
Default constructor.
int ModEvent
Type for modification events.
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.
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
ZeroIntView(void)
Default constructor.
Range iterator for integer views.
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
const Gecode::ModEvent ME_INT_FAILED
Domain operation has resulted in failure.
bool same(const CachedView< View > &x, const CachedView< View > &y)
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
unsigned int size(void) const
Return size (cardinality) of domain.
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
int min(void) const
Return smallest value of range.
int max(void) const
Return maximum of domain.
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
Generic domain change information to be supplied to advisors.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
bool operator()(void) const
Test whether iterator is still at a range or done.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
void operator++(void)
Move iterator to next range (if possible)
int max(void) const
Return largest value of range.
Post propagator for SetVar x
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
bool in(int n) const
Test whether n is contained in domain.
Gecode toplevel namespace
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
int val(void) const
Return assigned value (only if assigned)
ModEvent narrow_v(Space &home, I &i, bool depends=true)
Replace domain by values described by i.