38 namespace Gecode {
namespace Int {
namespace NoOverlap {
53 while (!b[j].mandatory() && (--j >= 0)) {}
54 while (b[i].mandatory() && (++i < n)) {}
76 b[
i].update(home,shared,p.
b[
i]);
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
void cancel(Space &home, Propagator &p, IntSet &y)
virtual size_t dispose(Space &home)
Destructor.
Base-class for propagators.
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.
void subscribe(Space &home, Propagator &p, IntSet &y)
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Base(Home home, Box *b, int n)
Constructor for posting with n mandatory boxes.
virtual size_t dispose(Space &home)
Delete actor and return its size.
Base class for no-overlap propagator.
int n
Number of mandatory boxes: b[0] ... b[n-1].
bool shared(const ConstView< ViewA > &, const ConstView< ViewB > &)
Test whether views share same variable.
static int partition(Box *b, int i, int n)
Partition n boxes b starting at position i.
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
int ModEventDelta
Modification event deltas.
Home class for posting propagators