Classes | |
class | Gecode::Reify |
Reification specification. More... | |
Typedefs | |
typedef PrimArgArray< TaskType > | Gecode::TaskTypeArgs |
Argument arrays for passing task type arguments. More... | |
Enumerations |
Functions | |
Reify | Gecode::eqv (BoolVar x) |
Use equivalence for reification. More... | |
Reify | Gecode::imp (BoolVar x) |
Use implication for reification. More... | |
Reify | Gecode::pmi (BoolVar x) |
Use reverse implication for reification. More... | |
typedef PrimArgArray<TaskType> Gecode::TaskTypeArgs |
enum Gecode::ReifyMode |
Mode for reification.
enum Gecode::IntRelType |
enum Gecode::BoolOpType |
enum Gecode::IntConLevel |
Consistency levels for integer propagators.
The descriptions are meant to be suggestions. It is not required that a propagator achieves full domain consistency or full bounds consistency. It is more like: which level of consistency comes closest.
If in the description of a constraint below no consistency level is mentioned, the propagator for the constraint implements domain consistency.
Enumerator | |
---|---|
ICL_VAL |
Value propagation or consistency (naive) |
ICL_BND |
Bounds propagation or consistency. |
ICL_DOM |
Domain propagation or consistency. |
ICL_DEF |
The default consistency for a constraint. |
enum Gecode::TaskType |
|
inline |
|
inline |