
Base class for no-overlap propagator. More...
#include <no-overlap.hh>
Public Member Functions | |
| virtual PropCost | cost (const Space &home, const ModEventDelta &med) const |
| Cost function. | |
| virtual size_t | dispose (Space &home) |
| Destructor. | |
Protected Member Functions | |
| Base (Home home, Box *b, int n) | |
| Constructor for posting with n mandatory boxes. | |
| Base (Space &home, bool share, Base< Box > &p, int m) | |
| Constructor for cloning p with m boxes. | |
Static Protected Member Functions | |
| static int | partition (Box *b, int i, int n) |
| Partition n boxes b starting at position i. | |
Protected Attributes | |
| Box * | b |
| Boxes. | |
| int | n |
| Number of mandatory boxes: b[0] ... b[n-1]. | |
Base class for no-overlap propagator.
Requires
#include <gecode/int/no-overlap.hh>
Definition at line 230 of file no-overlap.hh.
| Gecode::Int::NoOverlap::Base< Box >::Base | ( | Home | home, |
| Box * | b, | ||
| int | n | ||
| ) | [inline, protected] |
| Gecode::Int::NoOverlap::Base< Box >::Base | ( | Space & | home, |
| bool | share, | ||
| Base< Box > & | p, | ||
| int | m | ||
| ) | [inline, protected] |
| int Gecode::Int::NoOverlap::Base< Box >::partition | ( | Box * | b, |
| int | i, | ||
| int | n | ||
| ) | [inline, static, protected] |
| PropCost Gecode::Int::NoOverlap::Base< Box >::cost | ( | const Space & | home, |
| const ModEventDelta & | med | ||
| ) | const [virtual] |
| size_t Gecode::Int::NoOverlap::Base< Box >::dispose | ( | Space & | home | ) | [inline, virtual] |
Destructor.
Reimplemented from Gecode::Actor.
Reimplemented in Gecode::Int::NoOverlap::OptProp< Dim, d >, and Gecode::Int::NoOverlap::ManProp< Dim, d >.
Box* Gecode::Int::NoOverlap::Base< Box >::b [protected] |
Boxes.
Definition at line 233 of file no-overlap.hh.
int Gecode::Int::NoOverlap::Base< Box >::n [protected] |
Number of mandatory boxes: b[0] ... b[n-1].
Definition at line 235 of file no-overlap.hh.