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);
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.
int val(void) const
Return assigned value (only if assigned)
IntView base(void) const
Return view from which this view is derived.
int val(void) const
Return assigned value (only if assigned)
int min(void) const
Return smallest value of range.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
ViewRanges(void)
Default constructor.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
int ModEvent
Type for modification events.
void varimp(VarImpType *y)
Set variable implementation to y.
unsigned int size(void) const
Return size (cardinality) of domain.
unsigned int regret_max(void) const
Return regret of domain maximum (distance to next smaller value)
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
int max(void) const
Return maximum of domain.
ModEvent narrow_r(Space &home, I &i, bool depends=true)
Replace domain by ranges described by i.
int min(void) const
Return minimum of domain.
ModEvent minus_r(Space &home, I &i, bool depends=true)
Remove from domain the ranges described by i.
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
void init(const View &x)
Initialize with ranges for view x.
Value iterator for pointwise minus of a value iterator.
Base-class for derived views.
void init(const IntVarImp *x)
Initialize with ranges from variable implementation x.
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.
bool in(int n) const
Test whether n is contained in domain.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
bool range(void) const
Test whether domain is a range.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
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.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
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.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
int med(void) const
Return median of domain (greatest element not greater than the median)
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
unsigned int size(I &i)
Size of all ranges of range iterator i.
int min(void) const
Return smallest value of range.
Backward iterator for ranges of integer variable implementations.
int min(void) const
Return minimum of domain.
bool in(int n) const
Test whether n is contained in domain.
bool range(void) const
Test whether domain is a range.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
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.
bool any(const Delta &d) const
Test whether arbitrary values got pruned.
int med(void) const
Return median of domain.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
unsigned int size(void) const
Return size (cardinality) of domain.
int max(void) const
Return largest value of range.
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.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
int max(void) const
Return largest value of range.
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
IntView x
View from which this view is derived.
VarImpType * varimp(void) const
Return variable implementation of view.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
Gecode toplevel namespace
int max(void) const
Return maximum of domain.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than n.
int min(void) const
Return smallest value of range.
int ModEventDelta
Modification event deltas.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
Range iterator for minus integer views
MinusView(void)
Default constructor.