36 namespace Gecode {
namespace Set {
namespace Element {
38 template<
class SView,
class RView>
49 for (
unsigned int i=iv0.
size();
i--;)
53 template<
class SView,
class RView>
61 for (
unsigned int i=
n_iv;
i--;)
65 template<
class SView,
class RView>
71 template<
class SView,
class RView>
78 template<
class SView,
class RView>
86 for (
unsigned int i=n_iv;
i--;)
92 template<
class SView,
class RView>
107 template<
class SView,
class RView>
113 template<
class SView,
class RView>
118 bool* stillSelected = r.
alloc<
bool>(n_iv);
123 for (
int i=n_iv;
i--;)
124 stillSelected[
i] =
false;
148 unsigned int maxCard = 0;
162 bool selectSingleInconsistent =
false;
163 if (x1.cardMax() <= 1) {
165 IntSetRanges candub(iv[i]);
167 IntSetRanges > diff2(x0lb, candub);
168 selectSingleInconsistent = diff2() || candidateCard < x0.cardMin();
179 if (selectSingleInconsistent ||
180 candidateCard > x0.cardMax() ||
186 stillSelected[
i] =
true;
189 if (vx1() && vx1.
val()==
i) {
192 IntSetRanges candlb(iv[i]);
193 ModEvent me = x0.includeI(home,candlb);
199 before[
i].
update(home,sofarBefore);
200 IntSetRanges cub(iv[i]);
202 IntSetRanges clb(iv[i]);
204 maxCard =
std::max(maxCard, candidateCard);
205 minCard =
std::min(minCard, candidateCard);
211 if (x1.cardMax()==0) {
216 for (
int i=n_iv;
i--;)
217 if (stillSelected[
i])
224 if (x1.cardMin() > 0) {
228 ModEvent me = x0.includeI(home, si);
231 me = x0.cardMin(home, minCard);
237 if (x1.cardMax() <= 1) {
238 ModEvent me = x0.cardMax(home, maxCard);
246 ModEvent me = x0.intersectI(home,sfB);
257 for (
int i=n_iv;
i--;) {
258 if (!stillSelected[
i])
286 assert(x0.assigned());
const Gecode::ModEvent ME_SET_FAILED
Domain operation has resulted in failure.
int size(void) const
Return size of array (number of elements)
Range iterator for singleton range.
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
const int min
Smallest allowed integer in integer set.
Range iterator for integer sets.
ExecStatus ES_SUBSUMED(Propagator &p)
const FloatNum max
Largest allowed float value.
Actor must always be disposed.
static ExecStatus post(Home home, SView z, const IntSetArgs &x, RView y)
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
ElementUnionConst(Space &home, ElementUnionConst &p)
Constructor for cloning p.
virtual Actor * copy(Space &home)
Copy propagator during cloning.
Shrinking sets of integers.
virtual size_t dispose(Space &home)
Delete propagator and return its size.
int ModEvent
Type for modification events.
Base-class for propagators.
Range iterator for the greatest lower bound.
Propagation has computed fixpoint.
const unsigned int card
Maximum cardinality of an integer set.
const int max
Largest allowed integer in integer set.
Propagator for element with union of constant sets
int val(void) const
Return current value.
Range iterator for the least upper bound.
Base-class for both propagators and branchers.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
int p
Number of positive literals for node type.
const FloatNum min
Smallest allowed float value.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
bool intersectI(Space &home, I &i)
Exclude all elements not in the set represented by i from this set.
bool failed(void) const
Check whether space is failed.
Value iterator from range iterator.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Range iterator for integer sets.
virtual void reschedule(Space &home)
Schedule function.
void update(Space &home, BndSet &x)
Update this set to be a clone of set x.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
bool includeI(Space &home, I &i)
Include the set represented by i in this set.
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
void dispose(Space &home)
Free memory used by this set.
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
Range iterator for computing union (binary)
Post propagator for SetVar SetOpType SetVar SetRelType r
SetExpr inter(const SetVarArgs &x)
Intersection of set variables.
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
virtual size_t dispose(Space &home)
Delete actor and return its size.
Growing sets of integers.
bool me_modified(ModEvent me)
Check whether modification event me describes variable modification.
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
Gecode toplevel namespace
Range iterator for computing set difference.
int ModEventDelta
Modification event deltas.
bool before(const ConstSetView &x, const ConstSetView &y)
Home class for posting propagators
void * ralloc(size_t s)
Allocate memory from region.