Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
57 lines
2.2 KiB
MiniZinc
57 lines
2.2 KiB
MiniZinc
include "arg_sort_int.mzn";
|
|
include "arg_sort_float.mzn";
|
|
include "analyse_all_different.mzn";
|
|
|
|
/** @group globals.sort
|
|
Returns the permutation \a p which causes \a x to be in sorted order hence
|
|
\a x[\a p[\p i]] <= \a x[\a p[\p i+1]].
|
|
|
|
The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p[\p i] < \a p[\p i+1].
|
|
*/
|
|
function array[int] of var int: arg_sort(array[int] of var int:x) :: promise_total =
|
|
if length(x) = 0 then []
|
|
else
|
|
let { int: l = min(index_set(x));
|
|
int: u = max(index_set(x));
|
|
array[1..u-l+1] of var l..u: p;
|
|
constraint analyse_all_different(p);
|
|
constraint arg_sort_int(x,p); }
|
|
in p
|
|
endif;
|
|
|
|
|
|
/** @group globals.sort
|
|
Returns the permutation \a p which causes \a x to be in sorted order hence
|
|
\a x[\a p[\p i]] <= \a x[\a p[\p i+1]].
|
|
|
|
The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p[\p i] < \a p[\p i+1].
|
|
*/
|
|
function array[int] of var int: arg_sort(array[int] of var float:x) :: promise_total =
|
|
if length(x) = 0 then []
|
|
else
|
|
let { int: l = min(index_set(x));
|
|
int: u = max(index_set(x));
|
|
array[1..u-l+1] of var l..u: p;
|
|
constraint analyse_all_different(p);
|
|
constraint arg_sort_float(x,p); }
|
|
in p
|
|
endif;
|
|
|
|
/** @group globals.sort
|
|
Constrains \a p to be the permutation which causes \a x to be in sorted order hence
|
|
\a x[\a p[\p i]] <= \a x[\a p[\p i+1]].
|
|
|
|
The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p[\p i] < \a p[\p i+1].
|
|
*/
|
|
predicate arg_sort(array[int] of var int:x,
|
|
array[int] of var int:p) = fzn_arg_sort_int(x,p);
|
|
|
|
/** @group globals.sort
|
|
Constrains \a p to be the permutation which causes \a x to be in sorted order hence
|
|
\a x[\a p[\p i]] <= \a x[\a p[\p i+1]].
|
|
|
|
The permutation is the stable sort hence \a x[\a p[\p i]] = \a x[\a p[\p i+1]] \(\rightarrow\) \a p[\p i] < \a p[\p i+1].
|
|
*/
|
|
predicate arg_sort(array[int] of var float:x,
|
|
array[int] of var int:p) = arg_sort_float(x,p);
|