38 namespace Gecode {
namespace Int {
110 return x.
gq(home,-n);
114 return x.
gq(home,-n);
119 return x.
gr(home,-n);
123 return x.
gr(home,-n);
128 return x.
lq(home,-n);
132 return x.
lq(home,-n);
137 return x.
le(home,-n);
141 return x.
le(home,-n);
146 return x.
nq(home,-n);
150 return x.
nq(home,-n);
155 return x.
eq(home,-n);
159 return x.
eq(home,-n);
291 unsigned int i =
x.
size() / 2;
295 while (i >= r.
width()) {
299 return r.
min() +
static_cast<int>(
i);
int val(void) const
Return assigned value (only if assigned)
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
VarImpType * varimp(void) const
Return variable implementation of view.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
int min(void) const
Return smallest value of range.
ViewRanges(void)
Default constructor.
int ModEvent
Type for modification events.
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
ModEvent narrow_r(Space &home, I &i, bool depends=true)
Replace domain by ranges described by i.
int min(void) const
Return smallest value of range.
bool in(int n) const
Test whether n is contained in domain.
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
void init(const View &x)
Initialize with ranges for view x.
Value iterator for pointwise minus of a value iterator.
int val(void) const
Return assigned value (only if assigned)
Base-class for derived views.
void init(const IntVarImp *x)
Initialize with ranges from variable implementation x.
unsigned int size(void) const
Return size (cardinality) of domain.
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
ModEvent narrow_r(Space &home, I &i, bool depends=true)
Replace domain by ranges described by i.
Range iterator for integer views.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
int max(void) const
Return maximum of domain.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
int min(void) const
Return smallest value of range.
ModEvent narrow_v(Space &home, I &i, bool depends=true)
Replace domain by values described by i.
Gecode::IntArgs i(4, 1, 2, 3, 4)
bool in(int n) const
Test whether n is contained in domain.
int n
Number of negative literals for node type.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
ModEvent narrow_v(Space &home, I &i, bool depends=true)
Replace domain by values described by i.
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
int max(void) const
Return maximum of domain.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
View base(void) const
Return view from which this view is derived.
unsigned int size(void) const
Return size (cardinality) of domain.
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
int min(void) const
Return minimum of domain.
Backward iterator for ranges of integer variable implementations.
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
Range iterator for pointwise minus of a range iterator.
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
Integer view for integer variables.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
ModEvent gr(Space &home, int n)
Restrict domain values to be greater than n.
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
int med(void) const
Return median of domain (greatest element not greater than the median)
bool range(void) const
Test whether domain is a range.
int med(void) const
Return median of domain.
IntView x
View from which this view is derived.
bool range(void) const
Test whether domain is a range.
int min(void) const
Return minimum of domain.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
int max(void) const
Return largest value of range.
Gecode toplevel namespace
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
int max(void) const
Return largest value of range.
int ModEventDelta
Modification event deltas.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
Range iterator for minus integer views
MinusView(void)
Default constructor.