Modules | |
Set variables | |
Float variables | |
Range and value iterators for set variables | |
Argument arrays | |
Argument arrays are just good enough for passing arguments with automatic memory management. | |
Variable arrays | |
Variable arrays can store variables. They are typically used for storing the variables being part of a solution. However, they can also be used for temporary purposes (even though memory is not reclaimed until the space it is created for is deleted). | |
Domain constraints | |
Relation constraints | |
Set operation/relation constraints | |
Convexity constraints | |
Sequence constraints | |
Branching | |
Enumerations | |
enum | Gecode::SetRelType { Gecode::SRT_EQ, Gecode::SRT_NQ, Gecode::SRT_SUB, Gecode::SRT_SUP, Gecode::SRT_DISJ, Gecode::SRT_CMPL, Gecode::SRT_LQ, Gecode::SRT_LE, Gecode::SRT_GQ, Gecode::SRT_GR } |
Common relation types for sets. More... | |
enum | Gecode::SetOpType { Gecode::SOT_UNION, Gecode::SOT_DUNION, Gecode::SOT_INTER, Gecode::SOT_MINUS } |
Common operations for sets. More... | |
enum Gecode::SetRelType |
Common relation types for sets.
The total order on sets is defined as the lexicographic order on their characteristic functions, e.g., means that either
is empty or the minimal element of the symmetric difference
is in
.
enum Gecode::SetOpType |