34 namespace Gecode {
namespace Int {
namespace Count {
36 template<
class VX,
class VY>
48 template<
class VX,
class VY>
60 template<
class VX,
class VY>
68 template<
class VX,
class VY>
74 template<
class VX,
class VY>
ViewArray< VX > x
Views still to count.
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
void update(Space &home, ViewArray< View > &a)
Update array to be a clone of array a.
int n_s
Views from x[0] ... x[n_s-1] have subscriptions.
Actor must always be disposed.
void cancel(Space &home, Propagator &p, IntSet &y)
Base-class for propagators.
Baseclass for count propagators (integer)
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
Gecode::IntArgs i({1, 2, 3, 4})
void subscribe(Space &home, Propagator &p, IntSet &y)
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
int c
Number of views which are equal and have been eliminated.
virtual void reschedule(Space &home)
Schedule function.
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Post propagator for SetVar SetOpType SetVar y
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
virtual size_t dispose(Space &home)
Delete actor and return its size.
IntBase(Space &home, IntBase &p)
Constructor for cloning p.
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Post propagator for SetVar x
bool isintset(VY y)
Return whether y is an integer set.
Gecode toplevel namespace
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low linear)
void reschedule(Space &home, Propagator &p, IntSet &y)
int size(void) const
Return size of array (number of elements)
int ModEventDelta
Modification event deltas.
Home class for posting propagators
void update(IntSet &y, Space &home, IntSet &py)