Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
65 lines
2.4 KiB
MiniZinc
65 lines
2.4 KiB
MiniZinc
include "lex_less_bool.mzn";
|
|
include "lex_less_float.mzn";
|
|
include "lex_less_int.mzn";
|
|
include "lex_less_set.mzn";
|
|
|
|
/** @group globals.lexicographic
|
|
Requires that the array \a x is strictly lexicographically less than
|
|
array \a y. Compares them from first to last element, regardless of indices.
|
|
*/
|
|
predicate lex_less(array[int] of var bool: x,
|
|
array[int] of var bool: y) =
|
|
if length(x)=1 /\ length(y)=1 then x[min(index_set(x))] < y[min(index_set(y))]
|
|
elseif length(x)=0 then length(y)>0
|
|
elseif length(y)=0 then false
|
|
else lex_less_bool(x, y) endif;
|
|
|
|
/** @group globals.lexicographic
|
|
Requires that the array \a x is strictly lexicographically less than
|
|
array \a y. Compares them from first to last element, regardless of indices.
|
|
*/
|
|
predicate lex_less(array[int] of var int: x,
|
|
array[int] of var int: y) =
|
|
if length(x)=1 /\ length(y)=1 then x[min(index_set(x))] < y[min(index_set(y))]
|
|
elseif length(x)=0 then length(y)>0
|
|
elseif length(y)=0 then false
|
|
else lex_less_int(x, y) endif;
|
|
|
|
/** @group globals.lexicographic
|
|
Requires that the array \a x is strictly lexicographically less than
|
|
array \a y. Compares them from first to last element, regardless of indices.
|
|
*/
|
|
predicate lex_less(array[int] of var float: x,
|
|
array[int] of var float: y) =
|
|
if length(x)=1 /\ length(y)=1 then x[min(index_set(x))] < y[min(index_set(y))]
|
|
elseif length(x)=0 then length(y)>0
|
|
elseif length(y)=0 then false
|
|
else lex_less_float(x, y) endif;
|
|
|
|
/** @group globals.lexicographic
|
|
Requires that the array \a x is strictly lexicographically less than
|
|
array \a y. Compares them from first to last element, regardless of indices.
|
|
*/
|
|
predicate lex_less(array[int] of var set of int: x,
|
|
array[int] of var set of int: y) =
|
|
if length(x)=1 /\ length(y)=1 then x[min(index_set(x))] < y[min(index_set(y))]
|
|
elseif length(x)=0 then length(y)>0
|
|
elseif length(y)=0 then false
|
|
else lex_less_set(x, y) endif;
|
|
|
|
% Alternative names for the above.
|
|
%
|
|
predicate lex_lt(array[int] of var bool: x, array[int] of var bool: y) =
|
|
lex_less(x, y);
|
|
|
|
predicate lex_lt(array[int] of var int: x, array[int] of var int: y) =
|
|
lex_less(x, y);
|
|
|
|
predicate lex_lt(array[int] of var float: x, array[int] of var float: y) =
|
|
lex_less(x, y);
|
|
|
|
predicate lex_lt(array[int] of var set of int: x,
|
|
array[int] of var set of int: y) =
|
|
lex_less(x, y);
|
|
|