36 namespace Gecode {
namespace Int {
namespace Count {
72 (void) home; (void)
p; (void)
y;
82 (void) home; (void)
p;
93 (void) home; (void)
p; (void)
y;
126 if ((
x.max() <
y.min()) || (
y.max() <
x.min()))
171 for (
int i=0;
i<
x.size();
i++)
178 for (
int i=0;
i<
x.size();
i++)
185 for (
int i=0;
i<
x.size();
i++) {
214 for (
int i=0;
i<
x.size();
i++)
221 for (
int i=0;
i<
x.size();
i++)
228 for (
int i=0;
i<
x.size();
i++) {
240 for (
int i=0;
i<
x.size();
i++)
252 for (
int i=0;
i<
x.size();
i++)
291 for (
int i=0;
i<
x.size();
i++)
int p
Number of positive literals for node type.
union Gecode::@602::NNF::@65 u
Union depending on nodetype t.
Node * x
Pointer to corresponding Boolean expression node.
Home class for posting propagators
Range iterator for integer sets.
static ExecStatus post(Home home, View0 x0, View1 x1)
Post domain consistent propagator .
static ExecStatus post(Home home, ViewArray< View > &x)
Post domain consistent propagator .
Binary disequality propagator.
static ExecStatus post(Home home, V0 x0, V1 x1)
Post propagator .
Range iterator for integer views.
Range iterator for union of iterators.
Base-class for propagators.
void update(Space &home, VarImpVar< VarImp > &y)
Update this variable to be a clone of variable y.
bool assigned(void) const
Test whether view is assigned.
@ ES_OK
Execution is okay.
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Post propagator for SetVar SetOpType SetVar y
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
ExecStatus prune(Space &home, ViewArray< VX > &x, ConstIntView)
void cancel(Space &home, Propagator &p, IntSet &y)
RelTest holds(VX x, ConstIntView y)
Test whether x and y are equal.
void subscribe(Space &home, Propagator &p, IntSet &y)
ExecStatus post_true(Home home, VX x, ConstIntView y)
bool isval(VY y)
Return whether y is a value.
bool isintset(VY y)
Return whether y is an integer set.
void update(IntSet &y, Space &home, IntSet &py)
void reschedule(Space &home, Propagator &p, IntSet &y)
ExecStatus post_false(Home home, VX x, ConstIntView y)
RelTest rtest_eq_dom(VX x, VY y)
Test whether views x and y are equal (use full domain information)
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
RelTest
Result of testing relation.
@ RT_TRUE
Relation does hold.
@ RT_MAYBE
Relation may hold or not.
@ RT_FALSE
Relation does not hold.
@ CS_NONE
Neither of the above.
@ CS_SUBSET
First is subset of second iterator.
@ CS_DISJOINT
Intersection is empty.
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Gecode::IntArgs i({1, 2, 3, 4})
#define GECODE_NEVER
Assert that this command is never executed.