Go to the documentation of this file.
38 namespace Gecode {
namespace Set {
namespace Rel {
40 template<
class View0,
class View1, ReifyMode rm,
bool strict>
50 template<
class View0,
class View1, ReifyMode rm,
bool strict>
54 x0.update(home,share,
p.x0);
55 x1.update(home,share,
p.x1);
59 template<
class View0,
class View1, ReifyMode rm,
bool strict>
66 template<
class View0,
class View1, ReifyMode rm,
bool strict>
74 template<
class View0,
class View1, ReifyMode rm,
bool strict>
84 template<
class View0,
class View1, ReifyMode rm,
bool strict>
92 template<
class View0,
class View1, ReifyMode rm,
bool strict>
98 template<
class View0,
class View1, ReifyMode rm,
bool strict>
112 if (x0.cardMax() == 0) {
113 if ( (!strict) || x1.cardMin() > 0) {
118 if (strict && x1.cardMax() == 0) {
125 if (x0.assigned() && x1.assigned()) {
133 if ((!strict) && x0.cardMax() == x1.cardMax()) {
152 if (strict && x0.cardMax() == x1.cardMax()) {
166 assert(min01 != min10);
178 if (x1.cardMax() > 0) {
181 int x1umin=x1u.
min();
183 if (
d() &&
d.
min() < x1umin) {
190 if (x0.cardMax() > 0) {
193 int x0umin=x0u.
min();
195 if (
d() &&
d.
min() < x0umin) {
int min(int i) const
Return minimum of range at position i.
@ RM_PMI
Inverse implication for reification.
ExecStatus ES_SUBSUMED(Propagator &p)
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to view.
@ RM_IMP
Implication for reification.
Base-class for both propagators and branchers.
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Boolean view for Boolean variables.
virtual Actor * copy(Space &home, bool)
Copy propagator during cloning.
Gecode toplevel namespace
Base-class for propagators.
Home class for posting propagators
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
ReLq(Space &home, bool share, ReLq &p)
Constructor for cloning p.
Range iterator for computing set difference.
static ExecStatus post(Home home, View0 x, View1 y, Gecode::Int::BoolView b)
Post propagator for .
Range iterator for the greatest lower bound.
void update(Space &home, bool share, VarImpView< Var > &y)
Update this view to be a clone of view y.
static PropCost ternary(PropCost::Mod m)
Three variables for modifier pcm.
const Gecode::PropCond PC_INT_VAL
Propagate when a view becomes assigned (single value)
Reified propagator for set less than or equal
@ ES_FIX
Propagation has computed fixpoint.
Range iterator for the least upper bound.
virtual void reschedule(Space &home)
Schedule function.
const Gecode::PropCond PC_SET_ANY
Propagate when any bound or the cardinality of a view changes.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
virtual size_t dispose(Space &home)
Delete actor and return its size.
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Propagator for set less than or equal
int min(void) const
Return smallest value of range.
int ModEventDelta
Modification event deltas.
#define GECODE_REWRITE(prop, post)
Rewrite propagator by executing post function.
@ ES_OK
Execution is okay.
int p
Number of positive literals for node type.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as PC_TERNARY_LO)