Gecode::Int::Sorted::Sorted< View, Tuple, Perm > Class Template Reference
[Integer propagators]
#include <sorted.hh>
Inherits Gecode::Propagator.
Detailed Description
template<class View, class Tuple, bool Perm>
class Gecode::Int::Sorted::Sorted< View, Tuple, Perm >
Bounds-consistent sortedness propagator.
The algorithm is taken from: Sven Thiel, Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions, PhD thesis, Universität des Saarlandes, Germany, 2004, pages 39-59.
Requires
#include "gecode/int/sorted.hh"
Definition at line 63 of file sorted.hh.
Public Member Functions | |
virtual size_t | dispose (Space *home) |
Delete propagator and return its size. | |
virtual Actor * | copy (Space *home, bool share) |
Copy propagator during cloning. | |
virtual PropCost | cost (ModEventDelta med) const |
Cost function returning PC_LINEAR_HI. | |
virtual ExecStatus | propagate (Space *home, ModEventDelta med) |
Perform propagation. | |
Static Public Member Functions | |
static ExecStatus | post (Space *, ViewArray< Tuple > &, ViewArray< View > &) |
Post propagator for the views xz and y. | |
Protected Member Functions | |
Sorted (Space *, ViewArray< Tuple > &, ViewArray< View > &) | |
Constructor for posting. | |
Sorted (Space *home, bool share, Sorted< View, Tuple, Perm > &p) | |
Constructor for cloning. | |
Protected Attributes | |
ViewArray< Tuple > | xz |
Views to be sorted. | |
ViewArray< View > | y |
Views denoting the sorted version of x. | |
ViewArray< View > | w |
original y array | |
int | reachable |
connection to dropped view |
Constructor & Destructor Documentation
Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::Sorted | ( | Space * | home, | |
ViewArray< Tuple > & | xz0, | |||
ViewArray< View > & | y0 | |||
) | [inline, protected] |
Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::Sorted | ( | Space * | home, | |
bool | share, | |||
Sorted< View, Tuple, Perm > & | p | |||
) | [inline, protected] |
Member Function Documentation
size_t Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::dispose | ( | Space * | home | ) | [inline, virtual] |
Delete propagator and return its size.
Reimplemented from Gecode::Actor.
Definition at line 379 of file propagate.icc.
Actor * Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::copy | ( | Space * | home, | |
bool | share | |||
) | [inline, virtual] |
Copy propagator during cloning.
Implements Gecode::Actor.
Definition at line 388 of file propagate.icc.
PropCost Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::cost | ( | ModEventDelta | med | ) | const [inline, virtual] |
Cost function returning PC_LINEAR_HI.
Implements Gecode::Propagator.
Definition at line 393 of file propagate.icc.
ExecStatus Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::propagate | ( | Space * | home, | |
ModEventDelta | med | |||
) | [inline, virtual] |
ExecStatus Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::post | ( | Space * | home, | |
ViewArray< Tuple > & | xz0, | |||
ViewArray< View > & | y0 | |||
) | [inline, static] |
Member Data Documentation
ViewArray<Tuple> Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::xz [protected] |
Views to be sorted.
If Tuple is instantiated to ViewTuple<View,2>, is a pair
, where
denotes an unsorted view and
is the explicit permutation view mapping
to its unsorted counterpart
. If Tuple is instantiated to ViewTuple<View,1>,
is the unsorted view
lifted to a ViewTuple.
ViewArray<View> Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::y [protected] |
ViewArray<View> Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::w [protected] |
int Gecode::Int::Sorted::Sorted< View, Tuple, Perm >::reachable [protected] |
The documentation for this class was generated from the following files:
- gecode/int/sorted.hh (Revision: 5862)
- gecode/int/sorted/propagate.icc (Revision: 5862)