Selection constraints
[Using finite integer sets]
Collaboration diagram for Selection constraints:
Detailed Description
A selection constraint selects zero, one or more elements out of a sequence. We write for the sequence, and for the selector variable.Set selection constraints are closely related to the element constraint on finite domain variables.
Functions | |
void | Gecode::selectUnion (Space *home, const SetVarArgs &x, SetVar y, SetVar z) |
Post propagator for If y is the empty set, z will also be constrained to be empty (as an empty union is empty). | |
void | Gecode::selectInter (Space *home, const SetVarArgs &x, SetVar y, SetVar z) |
void | Gecode::selectInterIn (Space *home, const SetVarArgs &x, SetVar y, SetVar z, const IntSet &universe) |
void | Gecode::selectDisjoint (Space *home, const SetVarArgs &x, SetVar y) |
Post propagator for . | |
void | Gecode::selectSet (Space *home, const SetVarArgs &x, IntVar y, SetVar z) |
Post propagator for . |
Function Documentation
|
Post propagator for If y is the empty set, z will also be constrained to be empty (as an empty union is empty).
|
|
Post propagator for using as universe If y is empty, z will be constrained to be the universe (as an empty intersection is the universe). |
|
Post propagator for using u as universe If y is empty, z will be constrained to be the given universe u (as an empty intersection is the universe). |
|
Post propagator for .
|
|
Post propagator for .
|