Using integer variables and constraints
[Programming models]
Typedef Documentation
typedef ArgArray<TaskType> Gecode::TaskTypeArgs |
Enumeration Type Documentation
enum Gecode::ReifyMode |
Mode for reification.
- Enumerator:
enum Gecode::IntRelType |
enum Gecode::BoolOpType |
enum Gecode::IntPropLevel |
Propagation levels for integer propagators.
The descriptions are meant to be approximate. 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 to the level of propagation the propagator implements.
If in the description of a constraint below no propagation level is mentioned, the propagation level for the constraint is domain propagation and the implementation in fact enforces domain consistency.
- Enumerator:
IPL_DEF Simple propagation levels.
Default level of propagation
IPL_VAL Value propagation.
IPL_BND Bounds propagation.
IPL_DOM Domain propagation Options: basic versus advanced propagation.
IPL_BASIC Use basic propagation algorithm.
IPL_ADVANCED Use advanced propagation algorithm.
IPL_BASIC_ADVANCED Use both.
_IPL_BITS Number of bits required (internal).
enum Gecode::TaskType |
Function Documentation
Reify Gecode::eqv | ( | BoolVar | x | ) | [inline] |
Use equivalence for reification.
Reify Gecode::imp | ( | BoolVar | x | ) | [inline] |
Use implication for reification.
Reify Gecode::pmi | ( | BoolVar | x | ) | [inline] |
Use reverse implication for reification.