42 namespace Gecode {
namespace Set {
51 first(NULL), last(NULL), _size(0),
_card(0) {}
87 _size =
static_cast<unsigned int>(mx-mn+1);
127 return static_cast<int>(
c->
min() + n);
164 for (
int i=0;
i<n;
i++) {
187 new (home)
RangeList(ri.min(),ri.max(),NULL);
189 unsigned int s = ri.
width();
218 assert(
fst()!= that.
fst());
289 _size=
static_cast<unsigned int>(ma-mi+1);
294 bool ret = include_full(home, mi, ma, d);
299 template<
class I>
bool
345 if ((mi >
max()) || (ma <
min())) {
return false; }
346 if (mi <=
min() && ma >=
max() ) {
353 bool ret = exclude_full(home, mi, ma, d);
361 if ((mi <=
min()) && (ma >=
max())) {
return false; }
362 if (
_size == 0)
return false;
363 if (ma <
min() || mi >
max() ) {
368 bool ret = intersect_full(home, mi, ma);
373 template<
class I>
bool
375 if (
fst()==NULL) {
return false; }
388 template<
class I>
bool
390 if (!
i()) {
return false; }
413 : Iter::Ranges::Compl<Limits::
min,
417 template<
class I>
void