Go to the documentation of this file.
40 namespace Gecode {
namespace Int {
namespace Count {
76 (void) home; (void)
p; (void)
y;
86 (void) home; (void)
p;
97 (void) home; (void)
p; (void)
y;
119 if ((
x.max() <
y.min()) || (
y.max() <
x.min()))
164 for (
int i =
x.size();
i--; )
171 for (
int i =
x.size();
i--; )
178 for (
int i =
x.size();
i--; ) {
207 for (
int i =
x.size();
i--; )
214 for (
int i =
x.size();
i--; )
221 for (
int i =
x.size();
i--; ) {
233 for (
int i =
x.size();
i--; )
245 for (
int i =
x.size();
i--; )
284 for (
int i=
x.size();
i--; )
Post propagator for SetVar x
Post propagator for SetVar SetOpType SetVar y
@ CS_NONE
Neither of the above.
static ExecStatus post(Home home, V0 x0, V1 x1)
Post propagator .
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Gecode::IntArgs i(4, 1, 2, 3, 4)
ExecStatus post_false(Home home, VX x, ConstIntView y)
static ExecStatus post(Home home, View0 x0, View1 x1)
Post domain consistent propagator .
@ RT_TRUE
Relation does hold.
bool assigned(void) const
Test whether view is assigned.
union Gecode::@579::NNF::@61 u
Union depending on nodetype t.
Range iterator for integer sets.
Binary disequality propagator.
Gecode toplevel namespace
Base-class for propagators.
bool isintset(VY y)
Return whether y is an integer set.
@ RT_MAYBE
Relation may hold or not.
@ CS_SUBSET
First is subset of second iterator.
Range iterator for integer views.
RelTest rtest_eq_dom(VX x, VY y)
Test whether views x and y are equal (use full domain information)
@ RT_FALSE
Relation does not hold.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
void reschedule(Space &home, Propagator &p, IntSet &y)
Home class for posting propagators
Post propagator for SetVar SetOpType SetVar SetRelType r
ExecStatus post_true(Home home, VX x, ConstIntView y)
static ExecStatus post(Home home, ViewArray< View > &x)
Post domain consistent propagator .
bool isval(VY y)
Return whether y is a value.
Range iterator for union of iterators.
#define GECODE_NEVER
Assert that this command is never executed.
ExecStatus prune(Space &home, ViewArray< VX > &x, ConstIntView)
void cancel(Space &home, Propagator &p, IntSet &y)
RelTest
Result of testing relation.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
RelTest holds(VX x, ConstIntView y)
Test whether x and y are equal.
void subscribe(Space &home, Propagator &p, IntSet &y)
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
@ ES_OK
Execution is okay.
int p
Number of positive literals for node type.
@ CS_DISJOINT
Intersection is empty.