45namespace Gecode {
namespace Set {
namespace Distinct {
61 for (
int i =
x.
size(); i--; ) {
70 int a = as.
val(); ++as;
74 for (
int i=
x.
size(); i--;)
80 for (
int i=
x.
size(); i--;) {
81 if (!
x[i].notContains(
a)) {
88 int maxa =
static_cast<int>((bigTa.
size() - 1) / (
c - 1));
100 for (
int i=
x.
size(); i--;) {
101 if (!
x[i].contains(
a)) {
107 for (
int i =
x.
size(); i--; ) {
114 for (
int i=
x.
size(); i--; ) {
115 if (
x[i].contains(
a)) {
138 for (
int i=
x.
size(); i--; ) {
139 if (!
x[i].contains(
a) && !
x[i].notContains(
a)) {
struct Gecode::@603::NNF::@65::@67 a
For atomic nodes.
Range iterator for computing set difference.
Range iterator for union of iterators.
void reset(void)
Reset iterator to start.
Value iterator from range iterator.
int val(void) const
Return current value.
unsigned int size(void) const
Return size.
void dispose(Space &home)
Free memory used by this set.
AtmostOne(Space &home, AtmostOne &p)
Constructor for cloning p.
unsigned int c
Cardinality of the sets.
Growing sets of integers.
bool includeI(Space &home, I &i)
Include the set represented by i in this set.
Range iterator for the greatest lower bound.
void init(const T &x)
Initialize with greatest lower bound ranges for set variable x.
Range iterator for the least upper bound.
void init(const T &x)
Initialize with least upper bound ranges for set variable x.
int size(void) const
Return size of array (number of elements)
int ModEventDelta
Modification event deltas.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Gecode toplevel namespace
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF)
Post propagator for .
Post propagator for SetVar SetOpType SetVar SetRelType r
@ ES_FAILED
Execution has resulted in failure.
@ ES_NOFIX
Propagation has not computed fixpoint.