Gecode::Int::Rel::LexLqLe< View > Class Template Reference
[Integer propagators]
Lexical ordering propagator. More...
#include <rel.hh>
Public Member Functions | |
virtual Actor * | copy (Space &home, bool share) |
Copy propagator during cloning. | |
virtual PropCost | cost (const Space &home, const ModEventDelta &med) const |
Cost function (defined as low linear). | |
virtual ExecStatus | propagate (Space &home, const ModEventDelta &med) |
Perform propagation. | |
virtual size_t | dispose (Space &home) |
Delete propagator and return its size. | |
Static Public Member Functions | |
static ExecStatus | post (Home home, ViewArray< View > &x, ViewArray< View > &y, bool strict) |
Post propagator for lexical order between x and y. | |
Protected Member Functions | |
LexLqLe (Space &home, bool share, LexLqLe< View > &p) | |
Constructor for cloning p. | |
LexLqLe (Home home, ViewArray< View > &x, ViewArray< View > &y, bool strict) | |
Constructor for posting. | |
Protected Attributes | |
ViewArray< View > | x |
View arrays. | |
ViewArray< View > | y |
bool | strict |
Determines whether propagator is strict or not. |
Detailed Description
template<class View>
class Gecode::Int::Rel::LexLqLe< View >
Lexical ordering propagator.
The propagator uses the algorithm (and also the automaton) from: Mats Carlsson, Nicolas Beldiceanu, Revisiting the Lexicographic Ordering Constraint. SICS Technical Report T2002:17, SICS, Sweden, 2002.
It deviates in the following two main aspects:
- Assigned variables are eagerly eliminated This yields the same incremental behaviour with respect to states 1 and 2 of the automaton. With respect to the values of q and r in the report:
- q is always 0 after elimination
- r is always 1 after elimination
- It is not incremental with respect to states 3 and 4 as no propagation event information is available
Requires
#include <gecode/int/rel.hh>
Definition at line 597 of file rel.hh.
Constructor & Destructor Documentation
template<class View >
Gecode::Int::Rel::LexLqLe< View >::LexLqLe | ( | Space & | home, | |
bool | share, | |||
LexLqLe< View > & | p | |||
) | [inline, protected] |
template<class View >
Gecode::Int::Rel::LexLqLe< View >::LexLqLe | ( | Home | home, | |
ViewArray< View > & | x, | |||
ViewArray< View > & | y, | |||
bool | strict | |||
) | [inline, protected] |
Member Function Documentation
template<class View >
Actor * Gecode::Int::Rel::LexLqLe< View >::copy | ( | Space & | home, | |
bool | share | |||
) | [inline, virtual] |
template<class View >
PropCost Gecode::Int::Rel::LexLqLe< View >::cost | ( | const Space & | home, | |
const ModEventDelta & | med | |||
) | const [inline, virtual] |
Cost function (defined as low linear).
Implements Gecode::Propagator.
template<class View >
ExecStatus Gecode::Int::Rel::LexLqLe< View >::propagate | ( | Space & | home, | |
const ModEventDelta & | med | |||
) | [inline, virtual] |
template<class View >
ExecStatus Gecode::Int::Rel::LexLqLe< View >::post | ( | Home | home, | |
ViewArray< View > & | x, | |||
ViewArray< View > & | y, | |||
bool | strict | |||
) | [inline, static] |
template<class View >
size_t Gecode::Int::Rel::LexLqLe< View >::dispose | ( | Space & | home | ) | [inline, virtual] |
Delete propagator and return its size.
Reimplemented from Gecode::Actor.
Member Data Documentation
template<class View>
ViewArray<View> Gecode::Int::Rel::LexLqLe< View >::x [protected] |
template<class View>
ViewArray<View> Gecode::Int::Rel::LexLqLe< View >::y [protected] |
template<class View>
bool Gecode::Int::Rel::LexLqLe< View >::strict [protected] |
The documentation for this class was generated from the following files:
- gecode/int/rel.hh (Revision: 12151)
- gecode/int/rel/lex.hpp (Revision: 12163)