Sorted constraints
[Using integer variables and constraints]
Functions | |
void | Gecode::sorted (Home home, const IntVarArgs &x, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) |
Post propagator that y is x sorted in increasing order. | |
void | Gecode::sorted (Home home, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntPropLevel ipl=IPL_DEF) |
Post propagator that y is x sorted in increasing order. |
Detailed Description
All sorted constraints support bounds consistency only.
Function Documentation
void Gecode::sorted | ( | Home | home, | |
const IntVarArgs & | x, | |||
const IntVarArgs & | y, | |||
IntPropLevel | ipl = IPL_DEF | |||
) |
Post propagator that y is x sorted in increasing order.
Might throw the following exceptions:
- Int::ArgumentSizeMismatch, if x and y differ in size.
- Int::ArgumentSame, if x or y contain shared unassigned variables.
void Gecode::sorted | ( | Home | home, | |
const IntVarArgs & | x, | |||
const IntVarArgs & | y, | |||
const IntVarArgs & | z, | |||
IntPropLevel | ipl = IPL_DEF | |||
) |
Post propagator that y is x sorted in increasing order.
The values in z describe the sorting permutation, that is .
Might throw the following exceptions:
- Int::ArgumentSizeMismatch, if x and y differ in size.
- Int::ArgumentSame, if x or y contain shared unassigned variables.