34namespace Gecode {
namespace Int {
namespace NoOverlap {
40 for (
int i=0;
i<
n;
i++)
49 while (!
b[j].mandatory() && (--j >= 0)) {}
50 while (
b[
i].mandatory() && (++
i <
n)) {}
60 for (
int i=0;
i<
n;
i++)
71 for (
int i=0;
i<m;
i++)
84 for (
int i=0;
i<
n;
i++)
struct Gecode::@603::NNF::@65::@66 b
For binary nodes (and, or, eqv)
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
virtual size_t dispose(Space &home)
Delete actor and return its size.
Home class for posting propagators
Base class for no-overlap propagator.
int n
Number of mandatory boxes: b[0] ... b[n-1].
Base(Home home, Box *b, int n)
Constructor for posting with n mandatory boxes.
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
virtual size_t dispose(Space &home)
Destructor.
static int partition(Box *b, int i, int n)
Partition n boxes b starting at position i.
virtual void reschedule(Space &home)
Schedule function.
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
Base-class for propagators.
int ModEventDelta
Modification event deltas.
void cancel(Space &home, Propagator &p, VY y)
Cancel propagator p for view y.
void update(VY &y, Space &home, bool shared, VY py)
Update view y from py.
void subscribe(Space &home, Propagator &p, VY y)
Subscribe propagator p to view y.
void reschedule(Space &home, Propagator &p, VY y)
Schedule propagator p for view y.
Gecode toplevel namespace
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Gecode::IntArgs i({1, 2, 3, 4})