Using finite domain integers
[Programming models]
Modules | |
Integer variables | |
Argument arrays | |
Variable arrays | |
Domain constraints | |
Simple relation constraints over integer variables | |
Simple relation constraints over Boolean variables | |
Element constraints | |
Distinct constraints | |
Channel constraints | |
Graph constraints | |
Scheduling constraints | |
Sorted constraints | |
Cardinality constraints | |
Extensional constraints | |
Arithmetic constraints | |
Linear constraints over integer variables | |
Linear constraints over Boolean variables | |
Unsharing variables | |
Branching | |
Assigning | |
Enumerations | |
enum | Gecode::IntRelType { Gecode::IRT_EQ, Gecode::IRT_NQ, Gecode::IRT_LQ, Gecode::IRT_LE, Gecode::IRT_GQ, Gecode::IRT_GR } |
Relation types for integers. More... | |
enum | Gecode::BoolOpType { Gecode::BOT_AND, Gecode::BOT_OR, Gecode::BOT_IMP, Gecode::BOT_EQV, Gecode::BOT_XOR } |
Operation types for Booleans. More... | |
enum | Gecode::IntConLevel { Gecode::ICL_VAL, Gecode::ICL_BND, Gecode::ICL_DOM, Gecode::ICL_DEF } |
Consistency levels for integer propagators. More... |
Enumeration Type Documentation
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.