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
void Gecode::sortedness | ( | Space * | home, | |
const IntVarArgs & | x, | |||
const IntVarArgs & | y, | |||
IntConLevel | icl = ICL_DEF | |||
) |
Post propagator .
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if x and y differ in size. Int::ArgumentSame thrown if x or y contain shared variables.

Definition at line 26 of file sortedness.cc.
void Gecode::sortedness | ( | Space * | , | |
const IntVarArgs & | x, | |||
const IntVarArgs & | y, | |||
const IntVarArgs & | z, | |||
IntConLevel | icl = ICL_DEF | |||
) |
Post propagator
.
- Exceptions:
-
Int::ArgumentSizeMismatch thrown if x, y or z differ in size. Int::ArgumentSame thrown if x, y or z contain shared variables.



Definition at line 66 of file sortedness.cc.