Distinct propagators
More...
|
void | pathset_t (HallInfo hall[], int start, int end, int to) |
|
void | pathset_h (HallInfo hall[], int start, int end, int to) |
|
int | pathmin_h (const HallInfo hall[], int i) |
|
int | pathmin_t (const HallInfo hall[], int i) |
|
int | pathmax_h (const HallInfo hall[], int i) |
|
int | pathmax_t (const HallInfo hall[], int i) |
|
template<class View > |
ExecStatus | prop_bnd (Space &home, ViewArray< View > &x, int &min_x, int &max_x) |
| Perform bounds consistent distinct propagation. More...
|
|
template<class View > |
ExecStatus | prop_bnd (Space &home, ViewArray< View > &x) |
| Perform bounds consistent distinct propagation. More...
|
|
template<class View , bool complete> |
ExecStatus | prop_val (Space &home, ViewArray< View > &) |
| Eliminate singletons by naive value propagation. More...
|
|
◆ pathset_t()
void Gecode::Int::Distinct::pathset_t |
( |
HallInfo |
hall[], |
|
|
int |
start, |
|
|
int |
end, |
|
|
int |
to |
|
) |
| |
|
inline |
◆ pathset_h()
void Gecode::Int::Distinct::pathset_h |
( |
HallInfo |
hall[], |
|
|
int |
start, |
|
|
int |
end, |
|
|
int |
to |
|
) |
| |
|
inline |
◆ pathmin_h()
int Gecode::Int::Distinct::pathmin_h |
( |
const HallInfo |
hall[], |
|
|
int |
i |
|
) |
| |
|
inline |
◆ pathmin_t()
int Gecode::Int::Distinct::pathmin_t |
( |
const HallInfo |
hall[], |
|
|
int |
i |
|
) |
| |
|
inline |
◆ pathmax_h()
int Gecode::Int::Distinct::pathmax_h |
( |
const HallInfo |
hall[], |
|
|
int |
i |
|
) |
| |
|
inline |
◆ pathmax_t()
int Gecode::Int::Distinct::pathmax_t |
( |
const HallInfo |
hall[], |
|
|
int |
i |
|
) |
| |
|
inline |
◆ prop_bnd() [1/2]
Perform bounds consistent distinct propagation.
This is actually the propagation algorithm for Distinct::Bnd. It is available as separate function as it is reused for both bounds consistent and domain consistent distinct propagators.
Definition at line 186 of file bnd.hpp.
◆ prop_bnd() [2/2]
Perform bounds consistent distinct propagation.
This is actually the propagation algorithm for Distinct::Bnd. It is available as separate function as it is reused for both bounds consistent and domain consistent distinct propagators.
Definition at line 344 of file bnd.hpp.
◆ prop_val()
template<class View , bool complete>
Eliminate singletons by naive value propagation.
This is actually the propagation algorithm for Distinct::Val. It is available as separate function as it is reused for both bounds consistent and domain consistent distinct propagators.
If complete is true, computes fixpoint, otherwise might not compute fixpoint. This can be helpful when used together with bounds or domain propagation to protect from pathological cases which can be handled more efficiently with bounds propagation.
Definition at line 46 of file val.hpp.