Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
68 lines
3.1 KiB
MiniZinc
68 lines
3.1 KiB
MiniZinc
/***
|
|
@groupdef stdlib.sort Array sorting operations
|
|
*/
|
|
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of var opt $T: sort_by(array[$$E] of var opt $T: x, array[$$E] of int: y);
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of var $T: sort_by(array[$$E] of var $T: x, array[$$E] of int: y);
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of $T: sort_by(array[$$E] of $T: x, array[$$E] of int: y);
|
|
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of var opt $T: sort_by(array[$$E] of var opt $T: x, array[$$E] of float: y);
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of var $T: sort_by(array[$$E] of var $T: x, array[$$E] of float: y);
|
|
/** @group stdlib.sort Return array \a x sorted by the values in \a y in non-decreasing order
|
|
|
|
The sort is stable, i.e. if \a y[\p i] = \a y[\p j] with \p i < \p j, then
|
|
\a x[\p i] will appear in the output before \a x[\p j].
|
|
*/
|
|
function array[$$E] of $T: sort_by(array[$$E] of $T: x, array[$$E] of float: y);
|
|
|
|
/** @group stdlib.sort Return values from array \a x sorted in non-decreasing order */
|
|
function array[$$E] of int: sort(array[$$E] of int: x);
|
|
/** @group stdlib.sort Return values from array \a x sorted in non-decreasing order */
|
|
function array[$$E] of float: sort(array[$$E] of float: x);
|
|
/** @group stdlib.sort Return values from array \a x sorted in non-decreasing order */
|
|
function array[$$E] of bool: sort(array[$$E] of bool: x);
|
|
|
|
/** @group stdlib.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 $$E: arg_sort(array[$$E] of int:x) =
|
|
sort_by([i | i in index_set(x)], x);
|
|
|
|
/** @group stdlib.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 $$E: arg_sort(array[$$E] of float:x) =
|
|
sort_by([i | i in index_set(x)], x);
|
|
|