40 namespace Gecode {
namespace Search {
namespace Meta {
98 while ((l != NULL) && l->
leaf()) {
110 while ((l != NULL) && l->
leaf()) {
130 while ((l != NULL) && l->
leaf()) {
131 switch (l->
status(home)) {
144 p =
l; l = l->
next();
152 switch (l->
status(home)) {
164 while ((l != NULL) && l->
leaf()) {
192 }
else if (
root != NULL) {
195 while ((l != NULL) && l->
leaf())
204 return sizeof(*this);
virtual void subscribe(Space &home, Propagator &p)=0
Subscribe propagator p to all views of the no-good literal.
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
ExecStatus ES_SUBSUMED(Propagator &p)
virtual ExecStatus prune(Space &home)=0
Propagate the negation of the no-good literal.
NGL * next(void) const
Return pointer to next literal.
Actor must always be disposed.
The literal is neither failed nor subsumed.
Status
The status of a no-good literal.
Base-class for propagators.
bool failed(void) const
Check whether space is failed.
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.
int n
Number of negative literals for node type.
virtual NGL::Status status(const Space &home) const =0
Test the status of the no-good literal.
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
virtual size_t dispose(Space &home)
Delete actor and return its size.
virtual void cancel(Space &home, Propagator &p)=0
Cancel propagator p from all views of the no-good literal.
virtual size_t dispose(Space &home)
Dispose.
Propagation has not computed fixpoint.
Gecode toplevel namespace
bool leaf(void) const
Test whether literal is a leaf.
int ModEventDelta
Modification event deltas.
#define GECODE_NEVER
Assert that this command is never executed.
void rfree(void *p, size_t s)
Free memory previously allocated with alloc (might be reused later)
No-good literal recorded during search.