40 namespace Gecode {
namespace Set {
namespace Branch {
44 return new (home)
IncNGL(home,share,*
this);
63 return new (home)
ExcNGL(home,share,*
this);
ModEvent include(Space &home, int i, int j)
Update greatest lower bound to include all elements between and including i and j.
The literal is neither failed nor subsumed.
Status
The status of a no-good literal.
SetView x
The stored view.
virtual ExecStatus prune(Space &home)
Propagate the negation of the no-good literal.
Execution has resulted in failure.
virtual NGL * copy(Space &home, bool share)
Create copy.
bool contains(int i) const
Test whether i is in the greatest lower bound.
virtual NGL::Status status(const Space &home) const
Test the status of the no-good literal.
bool notContains(int i) const
Test whether i is not in the least upper bound.
ExcNGL(Space &home, SetView x, int n)
Constructor for creation.
ModEvent exclude(Space &home, int i, int j)
Restrict least upper bound to not contain all elements between and including i and j...
Gecode toplevel namespace
virtual NGL * copy(Space &home, bool share)
Create copy.
virtual ExecStatus prune(Space &home)
Propagate the negation of the no-good literal.
IncNGL(Space &home, SetView x, int n)
Constructor for creation.
bool me_failed(ModEvent me)
Check whether modification event me is failed.
No-good literal recorded during search.
virtual NGL::Status status(const Space &home) const
Test the status of the no-good literal.