38 namespace Gecode {
namespace Int {
84 return x->regret_min();
88 return x->regret_max();
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);
176 return x->narrow_r(home,i,depend);
181 return x->inter_r(home,i,depend);
186 return x->minus_r(home,i,depend);
191 return x->narrow_v(home,i,depend);
196 return x->inter_v(home,i,depend);
201 return x->minus_v(home,i,depend);
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.
int val(void) const
Return assigned value (only if assigned)
int min(void) const
Return minimum of domain.
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.
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 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.
bool in(int n) const
Test whether n is contained in domain.
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)
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 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)
Range iterator for ranges of integer variable implementation.
Base-class for variable implementation views.
int min(void) const
Return minimum of 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)
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.
Integer variable implementation.
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
static ModEvent me(const ModEventDelta &med)
Return modification event for view type in med.
ModEvent gq(Space &home, int n)
Restrict domain values to be greater or equal than n.
static bool any(const Delta &d)
Test whether arbitrary values got pruned.
Gecode toplevel namespace
int max(void) const
Return maximum of domain.
VarImpType * varimp(void) const
Return variable implementation of view.
void init(const IntVarImp *x)
Initialize with ranges from variable implementation x.
VarImpType * x
Pointer to variable implementation.
int ModEventDelta
Modification event deltas.
int max(void) const
Return maximum of domain.