Generated on Fri Aug 24 2012 04:52:24 for Gecode by doxygen 1.8.1.1
Sorted constraints

Functions

void Gecode::sorted (Home home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_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, IntConLevel icl=ICL_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,
IntConLevel  icl = ICL_DEF 
)

Post propagator that y is x sorted in increasing order.

Might throw the following exceptions:

Definition at line 62 of file sorted.cpp.

void Gecode::sorted ( Home  home,
const IntVarArgs &  x,
const IntVarArgs &  y,
const IntVarArgs &  z,
IntConLevel  icl = ICL_DEF 
)

Post propagator that y is x sorted in increasing order.

The values in \a z describe the sorting permutation, that is

$\forall i\in\{0,\dots,|x|-1\}: x_i=y_{z_i} $.

Might throw the following exceptions:
 - Int::ArgumentSizeMismatch, if \a x and \a y differ in size.
 - Int::ArgumentSame, if \a x or \a y contain
            shared unassigned variables.

Definition at line 43 of file sorted.cpp.