Sorting constraints
[Using finite domain integers]
Collaboration diagram for Sorting constraints:
Detailed Description
- Note:
- The Sortedness propagator described in this section only supports bounds-consistency no matter what value for the argument icl is given!
Functions | |
void | Gecode::sortedness (Space *home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator ![]() | |
void | Gecode::sortedness (Space *, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntConLevel icl=ICL_DEF) |
Post propagator ![]() . |
Function Documentation
|
Post propagator
Taking only two arguments, this interface for Sortedness leaves the sorting permutation Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. Definition at line 26 of file sortedness.cc. |
|
Post propagator
Providing a third argument Throws an exception of type Int::ArgumentSizeMismatch, if x, y and z are of different size. Definition at line 63 of file sortedness.cc. |