Debian Codegraph @

tests/spec/unit/optional/opt_array_access.mzn

raw
1 /***
2 !Test
3 solvers: [gecode]
4 expected: !Result
5 solution: !Solution
6 ***/
7
8 array [1..0] of var 1..2: x0;
9 array [1..2] of var 1..2: x1;
10 array [1..2, 1..2] of var 1..2: x2;
11 array [1..2, 1..2, 1..2] of var 1..2: x3;
12 array [1..2, 1..2, 1..2, 1..2] of var 1..2: x4;
13 array [1..2, 1..2, 1..2, 1..2, 1..2] of var 1..2: x5;
14 array [1..2, 1..2, 1..2, 1..2, 1..2, 1..2] of var 1..2: x6;
15
16 array [1..0] of var opt 1..2: y0;
17 array [1..2] of var opt 1..2: y1;
18 array [1..2, 1..2] of var opt 1..2: y2;
19 array [1..2, 1..2, 1..2] of var opt 1..2: y3;
20 array [1..2, 1..2, 1..2, 1..2] of var opt 1..2: y4;
21 array [1..2, 1..2, 1..2, 1..2, 1..2] of var opt 1..2: y5;
22 array [1..2, 1..2, 1..2, 1..2, 1..2, 1..2] of var opt 1..2: y6;
23
24 var 0..3: i;
25 any: vi :: output = [x1[i], x2[i, i], x3[i, i, i], x4[i, i, i, i], x5[i, i, i, i, i], x6[i, i, i, i, i, i]];
26 any: ui :: output = [y1[i], y2[i, i], y3[i, i, i], y4[i, i, i, i], y5[i, i, i, i, i], y6[i, i, i, i, i, i]];
27
28 var opt 0..3: j;
29 any: vj :: output = [x1[j], x2[i, j], x3[i, j, i], x4[i, j, i, j], x5[i, j, i, j, i], x6[i, j, i, j, i, j]];
30 any: uj :: output = [y1[j], y2[i, j], y3[i, j, i], y4[i, j, i, j], y5[i, j, i, j, i], y6[i, j, i, j, i, j]];
31
32 var opt 1..3: k;
33 any: vk :: output = x1[k];
34 any: uk :: output = y1[k];
35
36 var opt 1..2: l;
37 any: el :: output = x0[l];
38 any: fl :: output = y0[l];
39
40 constraint occurs(y1[1]) /\ occurs(y2[1, 1]) /\ occurs(y3[1, 1, 1]) /\ occurs(y4[1, 1, 1, 1]) /\ occurs(y5[1, 1, 1, 1, 1]) /\ occurs(y6[1, 1, 1, 1, 1, 1]);
41 solve minimize sum(x0 ++ x1 ++ array1d(x2) ++ array1d(x3) ++ array1d(x4) ++ array1d(x5) ++ array1d(x6) ++ y0 ++ y1 ++ array1d(y2) ++ array1d(y3) ++ array1d(y4) ++ array1d(y5) ++ array1d(y6));