38 namespace Gecode {
namespace Int {
namespace Circuit {
44 template<
class View,
class Offset>
49 template<
class View,
class Offset>
54 template<
class View,
class Offset>
60 template<
class View,
class Offset>
66 template<
class View,
class Offset>
82 template<
class View,
class Offset>
92 for (
int i=n;
i--; ) {
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
ExecStatus ES_SUBSUMED(Propagator &p)
Val(Space &home, bool share, Val &p)
Constructor for cloning p.
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
void path(Home home, int offset, const IntVarArgs &x, IntVar s, IntVar e, IntConLevel icl)
Post propagator such that x forms a Hamiltonian path.
Propagation has computed fixpoint.
Base-class for both propagators and branchers.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
int p
Number of positive literals for node type.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
virtual Actor * copy(Space &home, bool share)
Copy propagator during cloning.
"Value-consistent" circuit propagator
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Converter with fixed offset.
static ExecStatus post(Home home, ViewArray< View > &x, Offset &o)
Post propagator for circuit on x.
Node * x
Pointer to corresponding Boolean expression node.
int size(void) const
Return size of array (number of elements)
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (returns high linear)
Gecode toplevel namespace
int ModEventDelta
Modification event deltas.
Home class for posting propagators
Base-class for circuit propagator.