Generated on Tue Apr 18 10:22:48 2017 for Gecode by doxygen 1.6.3

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:

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 $\forall i\in\{0,\dots,|x|-1\}: x_i=y_{z_i} $.

Might throw the following exceptions: