38 namespace Gecode {
namespace Int {
116 return x->
lq(home,n);
120 return x->
lq(home,n);
125 return x->
lq(home,n-1);
129 return x->
lq(home,n-1);
134 return x->
gq(home,n);
138 return x->
gq(home,n);
143 return x->
gq(home,n+1);
147 return x->
gq(home,n+1);
152 return x->
nq(home,n);
156 return x->
nq(home,n);
161 return x->
eq(home,n);
165 return x->
eq(home,n);
ModEvent nq(Space &home, int n)
Restrict domain values to be different from n.
int val(void) const
Return assigned value (only if assigned)
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.
static ModEventDelta med(ModEvent me)
Translate modification event me to modification event delta for view.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
unsigned int size(void) const
Return size (cardinality) of domain.
VarImpType * varimp(void) const
Return variable implementation of view.
ModEvent eq(Space &home, int n)
Restrict domain values to be equal to n.
IntView(void)
Default constructor.
ViewRanges(void)
Default constructor.
int ModEvent
Type for modification events.
ModEvent lq(Space &home, int n)
Restrict domain values to be less or equal than 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.
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.
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
Range iterator for integer views.
int val(void) const
Return assigned value (only if assigned)
int max(void) const
Return maximum of domain.
ModEvent le(Space &home, int n)
Restrict domain values to be less than n.
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 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.
unsigned int size(void) const
Return size (cardinality) of domain.
Range iterator for ranges of integer variable implementation.
int min(void) const
Return minimum of domain.
Base-class for variable implementation views.
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)
ModEvent inter_r(Space &home, I &i, bool depends=true)
Intersect domain with ranges described by i.
ModEvent minus_v(Space &home, I &i, bool depends=true)
Remove from domain the values described by i.
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
ModEvent narrow_v(Space &home, I &i, bool depends=true)
Replace domain by values described by i.
Integer view for integer variables.
Integer variable implementation.
ModEvent inter_v(Space &home, I &i, bool depends=true)
Intersect domain with values described by i.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
int max(void) const
Return maximum of domain.
unsigned int width(void) const
Return width of domain (distance between maximum and minimum)
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 med(void) const
Return median of domain (greatest element not greater than the median)
bool in(int n) const
Test whether n is contained in domain.
bool range(void) const
Test whether domain is a range.
int med(void) const
Return median of domain (greatest element not greater than the median)
static bool any(const Delta &d)
Test whether arbitrary values got pruned.
Gecode toplevel namespace
void init(const IntVarImp *x)
Initialize with ranges from variable implementation x.
VarImpType * x
Pointer to variable implementation.
int ModEventDelta
Modification event deltas.
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.
unsigned int regret_min(void) const
Return regret of domain minimum (distance to next larger value)
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.