46 namespace Gecode {
namespace Set {
88 namespace Gecode {
namespace Set {
130 void dispose(
Space& home);
141 int minN(
unsigned int n)
const;
143 unsigned int size(
void)
const;
145 unsigned int card(
void)
const;
147 void card(
unsigned int c);
152 bool empty(
void)
const;
155 bool in(
int i)
const;
172 template<
class I>
bool overwrite(
Space& home,I&
i);
198 void init(
const BndSet& s);
225 void init(
Space& home);
233 template<
class I>
bool includeI(
Space& home,I& i);
263 void init(
Space& home);
273 template<
class I>
bool intersectI(
Space& home, I& i);
275 template<
class I>
bool excludeI(
Space& home, I& i);
277 void excludeAll(
Space& home);
330 void init(
const T& x);
335 bool operator ()(
void)
const;
338 void operator ++(
void);
348 unsigned int width(
void)
const;
372 void init(
const T& x);
377 bool operator ()(
void)
const;
380 void operator ++(
void);
390 unsigned int width(
void)
const;
418 void init(
const T& x);
427 namespace Gecode {
namespace Set {
460 unsigned int cardMin = 0,
471 unsigned int cardMin,
unsigned int cardMax);
481 unsigned int cardMin,
unsigned int cardMax);
491 unsigned int cardMin,
unsigned int cardMax);
496 unsigned int cardMin(
void)
const;
499 unsigned int cardMax(
void)
const;
505 int lubMinN(
unsigned int n)
const;
511 unsigned int glbSize(
void)
const;
513 unsigned int lubSize(
void)
const;
521 bool knownIn(
int n)
const;
523 bool knownOut(
int)
const;
529 template<
class I>
ModEvent includeI_full(
Space& home,
int mi,
int ma, I&
i);
532 template<
class I>
ModEvent excludeI_full(
Space& home,
int mi,
int ma, I&
i);
534 template<
class I>
ModEvent intersectI_full(
Space& home,
int mi,
int ma, I&
i);
Range iterator for the unknown set.
const int min
Smallest allowed integer in integer set.
void cancel(Space &home, Propagator &p, IntSet &y)
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Range iterator for range lists
Shrinking sets of integers.
int ModEvent
Type for modification events.
Base-class for propagators.
Range iterator for the greatest lower bound.
Finite integer set variable implementation.
Range iterator for computing the complement (described by template arguments)
const unsigned int card
Maximum cardinality of an integer set.
const int max
Largest allowed integer in integer set.
Range iterator for the least upper bound.
ModEvent exclude(Space &home, View &x, int s)
Prune view x to exclude all values from s.
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
int glbMax(void) const
Return glb maximum.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
FloatVal intersect(const FloatVal &x, const FloatVal &y)
int PropCond
Type for propagation conditions.
void subscribe(Space &home, Propagator &p, IntSet &y)
A complement iterator spezialized for the BndSet limits.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Range iterator for integer sets.
unsigned int _size
The size of this set.
unsigned int _card
The cardinality this set represents.
struct Gecode::@519::NNF::@60::@62 a
For atomic nodes.
bool glbAny(void) const
Test whether delta represents any domain change in glb.
int glbMin(void) const
Return glb minimum.
Base-class for Set-variable implementations.
int lubMin(void) const
Return lub minimum.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Set view for set variables
Node * x
Pointer to corresponding Boolean expression node.
Generic domain change information to be supplied to advisors.
ModEvent include(Space &home, View &x, int s)
Prune view x to only include values from s.
bool assigned(View x, int v)
Whether x is assigned to value v.
Growing sets of integers.
int lubMax(void) const
Return lub maximum.
bool lubAny(void) const
Test whether delta represents any domain change in lub.
Lists of ranges (intervals)
Gecode toplevel namespace
Range iterator for computing set difference.
SetDelta(void)
Create set delta as providing no information (if any is true)
#define GECODE_SET_EXPORT
Finite set delta information for advisors.