40 namespace Gecode {
namespace Int {
namespace Element {
46 template<
class VA,
class VC>
65 template<
class VA,
class VC>
81 template<
class VA,
class VC>
92 template<
class VA,
class VC>
111 template<
class VA,
class VB,
class VC, PropCond pc_ac>
116 x1.subscribe(home,*
this,pc_ac);
117 iv.subscribe(home,*
this,pc_ac);
120 template<
class VA,
class VB,
class VC, PropCond pc_ac>
124 x0.update(home,p.
x0);
125 x1.update(home,p.
x1);
126 iv.update(home,p.
iv);
129 template<
class VA,
class VB,
class VC, PropCond pc_ac>
138 template<
class VA,
class VB,
class VC, PropCond pc_ac>
142 x1.reschedule(home,*
this,pc_ac);
143 iv.reschedule(home,*
this,pc_ac);
146 template<
class VA,
class VB,
class VC, PropCond pc_ac>
150 x1.cancel(home,*
this,pc_ac);
151 iv.cancel(home,*
this,pc_ac);
152 (void) Propagator::dispose(home);
153 return sizeof(*this);
171 bool operator ()(
void)
const;
172 void operator ++(
void);
215 template<
class VA,
class VB,
class VC, PropCond pc_ac,
class RelTest>
219 assert(iv.
size() > 1);
229 while (vx0() && (i < iv.
size())) {
230 if (iv[i].idx < vx0.val()) {
231 iv[
i].view.
cancel(home,p,pc_ac);
233 }
else if (iv[i].idx > vx0.val()) {
236 assert(iv[i].idx == vx0.val());
237 switch (rt(iv[i].view,x1)) {
239 iv[
i].view.
cancel(home,p,pc_ac);
250 while (i < iv.
size())
251 iv[i++].view.
cancel(home,p,pc_ac);
252 bool adjust = (j<iv.
size());
258 if (iv.
size() == 1) {
263 assert(x0.size() ==
static_cast<unsigned int>(iv.
size()));
276 template<
class VA,
class VB,
class VC>
282 template<
class VA,
class VB,
class VC>
299 template<
class VA,
class VB,
class VC>
304 template<
class VA,
class VB,
class VC>
310 template<
class VA,
class VB,
class VC>
316 (home,
iv,
x0,
x1,*
this,rt)));
324 int min =
iv[0].view.min();
325 int max =
iv[0].view.max();
345 return (
x1.assigned() && (min ==
max)) ?
358 template<
class VA,
class VB,
class VC>
364 template<
class VA,
class VB,
class VC>
381 template<
class VA,
class VB,
class VC>
386 template<
class VA,
class VB,
class VC>
393 template<
class VA,
class VB,
class VC>
400 template<
class VA,
class VB,
class VC>
407 (home,
iv,
x0,
x1,*
this,rt)));
414 int min =
iv[0].view.min();
415 int max =
iv[0].view.max();
422 return (
x1.assigned() && (min ==
max)) ?
428 (home,
iv,
x0,
x1,*
this,rt)));
438 if (
iv[
i].view.in(
x1.val()))
Domain consistent element propagator for array of views.
void free(void)
Free allocate memory.
void init(void)
Initialize links (self-linked)
Relation may hold or not.
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Binary domain consistent equality propagator.
ExecStatus ES_SUBSUMED(Propagator &p)
const FloatNum max
Largest allowed float value.
RelTest rtest_eq_dom(VX x, VY y)
Test whether views x and y are equal (use full domain information)
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
ExecStatus ES_NOFIX_PARTIAL(Propagator &p, const ModEventDelta &med)
Propagator p has not computed partial fixpoint
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
int ModEvent
Type for modification events.
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c)
Post propagator for .
Base-class for propagators.
void init(const IdxView< View > *, const IdxView< View > *)
static ExecStatus post(Home home, IdxViewArray< VA > &iv, VB x0, VC x1)
Post propagator for .
virtual Actor * copy(Space &home)
Perform copying during cloning.
Value iterator for integer views.
Propagation has computed fixpoint.
Base-class for both propagators and branchers.
Range iterator for integer views.
Class for bounds-equality test.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
bool operator()(void) const
int p
Number of positive literals for node type.
const FloatNum min
Smallest allowed float value.
int val(void) const
Return assigned value (only if assigned)
static ExecStatus post(Home home, IdxViewArray< VA > &iv, VB x0, VC x1)
Post propagator for .
IdxViewArray< VA > iv
Current index-view map.
Gecode::IntArgs i({1, 2, 3, 4})
Execution has resulted in failure.
RelTest
Result of testing relation.
void cancel(Space &home, Propagator &p, PropCond pc)
const Gecode::PropCond PC_INT_BND
Propagate when minimum or maximum of a view changes.
Range iterator for union of iterators.
ModEventDelta med
A set of modification events (used during propagation)
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Binary bounds consistent equality propagator.
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
RelTest operator()(VA, VC)
virtual Actor * copy(Space &home)
Perform copying during cloning.
Base-class for element propagator for array of views.
int size(void) const
Return the current size.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
RelTest rtest_eq_bnd(VX x, VY y)
Test whether views x and y are equal (use bounds information)
Post propagator for SetVar SetOpType SetVar SetRelType r
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Value iterator for indices in index-view map.
ExecStatus scan(Space &home, IdxViewArray< VA > &iv, VB x0, VC x1, Propagator &p, RelTest rt)
Post propagator for SetVar SetOpType SetVar y
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
const Gecode::ModEvent ME_INT_DOM
Domain operation has changed the domain.
bool me_modified(ModEvent me)
Check whether modification event me describes variable modification.
ViewDom(Space &home, ViewDom &p)
Constructor for cloning p.
Post propagator for SetVar x
Propagation has not computed fixpoint.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Gecode toplevel namespace
RelTest operator()(VA, VC)
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
bool shared(ViewArray< ViewX > x, ViewArray< ViewY > y)
void reschedule(Space &home, Propagator &p, IntSet &y)
int ModEventDelta
Modification event deltas.
Home class for posting propagators
Class for pair of index and view.
#define GECODE_NEVER
Assert that this command is never executed.
Class for domain-equality test.
Bounds consistent element propagator for array of views.
bool me_failed(ModEvent me)
Check whether modification event me is failed.
ViewBnd(Space &home, ViewBnd &p)
Constructor for cloning p.
View(Space &home, View &p)
Constructor for cloning p.