38 namespace Gecode {
namespace Int {
namespace Sequence {
60 if ((x.max() < s.
min()) || (x.min() > s.
max()))
77 return x.assigned() && x.in(s);
83 if ((x.max() < s.
min()) || (x.min() > s.
max()))
100 if ((x.max() < s.
min()) || (x.min() > s.
max()))
111 return !x.assigned() && x.in(s);
117 if ((x.max() < s.
min()) || (x.min() > s.
max()))
135 return x.inter_r(home,is,
false);
149 return x.minus_r(home,is,
false);
TakesStatus
Status of whether a view takes a value from a set.
bool includes(const View &x, int s)
Test whether all values of view x are included in s.
Range iterator for integer sets.
First is subset of second iterator.
bool undecided(const View &x, int s)
Test whether no decision on inclusion or exclusion of values of view x in s can be made...
int ModEvent
Type for modification events.
Range iterator for integer views.
ModEvent exclude(Space &home, View &x, int s)
Prune view x to exclude all values from s.
Node * x
Pointer to corresponding Boolean expression node.
ModEvent include(Space &home, View &x, int s)
Prune view x to only include values from s.
TakesStatus takes(const View &x, int s)
Return whether view x takes value s.
bool disjoint(I &i, J &j)
Check whether range iterators i and j are disjoint.
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
bool excludes(const View &x, int s)
Test whether all values of view x are excluded from s.
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Gecode toplevel namespace
#define GECODE_NEVER
Assert that this command is never executed.
int max(int i) const
Return maximum of range at position i.
int min(int i) const
Return minimum of range at position i.