Jip J. Dekker
f2a1c4e389
git-subtree-dir: software/mza git-subtree-split: f970a59b177c13ca3dd8aaef8cc6681d83b7e813
26 lines
957 B
MiniZinc
26 lines
957 B
MiniZinc
%-----------------------------------------------------------------------------%
|
|
% Requires that the array 'x' is strictly lexicographically less than array 'y'.
|
|
% Compares them from first to last element, regardless of indices
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
predicate fzn_lex_less_int(array[int] of var int: x,
|
|
array[int] of var int: y) =
|
|
let { int: lx = min(index_set(x)),
|
|
int: ux = max(index_set(x)),
|
|
int: ly = min(index_set(y)),
|
|
int: uy = max(index_set(y)),
|
|
int: size = max(ux - lx, uy - ly),
|
|
array[0..size+1] of var bool: b }
|
|
in
|
|
b[0]
|
|
/\
|
|
forall(i in 0..size) (
|
|
b[i] = ( x[lx + i] <= y[ly + i]
|
|
/\
|
|
(x[lx + i] < y[ly + i] \/ b[i+1]) )
|
|
)
|
|
/\
|
|
b[size + 1] = (ux - lx < uy - ly);
|
|
|
|
%-----------------------------------------------------------------------------%
|