36namespace Gecode {
namespace Set {
namespace Element {
38 template<
class SView,
class RView>
44 :
Propagator(home), x0(y0), n_iv(iv0.size()), x1(y1) {
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) {
168 selectSingleInconsistent = diff2() || candidateCard < x0.cardMin();
179 if (selectSingleInconsistent ||
180 candidateCard > x0.cardMax() ||
186 stillSelected[i] =
true;
189 if (vx1() && vx1.
val()==i) {
193 ModEvent me = x0.includeI(home,candlb);
199 before[i].
update(home,sofarBefore);
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());
struct Gecode::@603::NNF::@65::@66 b
For binary nodes (and, or, eqv)
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Base-class for both propagators and branchers.
virtual size_t dispose(Space &home)
Delete actor and return its size.
int size(void) const
Return size of array (number of elements)
Home class for posting propagators
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Range iterator for integer sets.
Range iterator for computing set difference.
Range iterator for singleton range.
Value iterator from range iterator.
int val(void) const
Return current value.
Range iterator for computing union (binary)
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Base-class for propagators.
Range iterator for integer sets.
void update(Space &home, BndSet &x)
Update this set to be a clone of set x.
void dispose(Space &home)
Free memory used by this set.
Propagator for element with union of constant sets
virtual void reschedule(Space &home)
Schedule function.
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.
Shrinking sets of integers.
bool intersectI(Space &home, I &i)
Exclude all elements not in the set represented by i from this set.
Range iterator for the least upper bound.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
ExecStatus ES_SUBSUMED(Propagator &p)
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
int ModEventDelta
Modification event deltas.
bool failed(void) const
Check whether space is failed.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
bool me_modified(ModEvent me)
Check whether modification event me describes variable modification.
@ AP_DISPOSE
Actor must always be disposed.
const int min
Smallest allowed integer value.
const int max
Largest allowed integer value.
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.
const unsigned int card
Maximum cardinality of an integer set.
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
const Gecode::ModEvent ME_SET_FAILED
Domain operation has resulted in failure.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
SetExpr inter(const SetVarArgs &)
Intersection of set variables.
@ ES_OK
Execution is okay.
@ ES_FIX
Propagation has computed fixpoint.
int ModEvent
Type for modification events.