Sorted constraints
[Using finite domain integers]

---

Detailed Description

All sorted constraints support bounds consistency.

Functions
void	Gecode::sorted (Space *home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)
	Post propagator that y is x sorted in increasing order.
void	Gecode::sorted (Space *, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)
	Post propagator that y is x sorted in increasing order.

---

Function Documentation

void Gecode::sorted	(	Space *	home,
		const IntVarArgs &	x,
		const IntVarArgs &	y,
		IntConLevel	icl = ICL_DEF,
		PropKind	pk = PK_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.

Definition at line 60 of file sorted.cc.

void Gecode::sorted	(	Space *	,
		const IntVarArgs &	x,
		const IntVarArgs &	y,
		const IntVarArgs &	z,
		IntConLevel	icl = ICL_DEF,
		PropKind	pk = PK_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.

Definition at line 43 of file sorted.cc.