Debian Codegraph @

tests/spec/unit/globals/count/count_overloads.mzn

raw
1 /***
2 !Test
3 solvers: [gecode]
4 expected:
5 - !Result
6 solution: !Solution
7 xi: [1, 2, 1, 2]
8 yi: 1
9 xoi: [1, null, 1, 2]
10 yoi: 1
11 xb: [true, false, true, false]
12 yb: false
13 xf: [1.5, 2.0, 1.5, 2.0]
14 yf: 1.5
15 xs: [!!set {1,2}, !!set {2}, !!set {1,2}, !!set {1}]
16 ys: !!set {1,2}
17 eq_vi: 2
18 eq_vb: 2
19 eq_vf: 2
20 eq_vs: 2
21 eq_vo: 2
22 geq_vi: 3
23 geq_vb: 3
24 geq_vf: 3
25 geq_vs: 3
26 geq_vo: 3
27 gt_vi: 3
28 gt_vb: 3
29 gt_vf: 3
30 gt_vs: 3
31 gt_vo: 3
32 leq_vi: 1
33 leq_vb: 1
34 leq_vf: 1
35 leq_vs: 1
36 leq_vo: 1
37 lt_vi: 1
38 lt_vb: 1
39 lt_vf: 1
40 lt_vs: 1
41 lt_vo: 1
42 neq_vi: 1
43 neq_vb: 1
44 neq_vf: 1
45 neq_vs: 1
46 neq_vo: 1
47 ***/
48
49 array[1..4] of var 1..3: xi = [1, 2, 1, _];
50 var 1..3: yi;
51
52 array[1..4] of var opt 1..2: xoi = [1, <>, 1, _];
53 var 1..3: yoi;
54
55 array[1..4] of var bool: xb = [true, false, true, _];
56 var bool: yb;
57
58 array[1..4] of var {1.5, 2.0, 3.0}: xf = [1.5, 2.0, 1.5, _];
59 var {1.0, 1.5, 2.0, 3.0}: yf;
60
61 array[1..4] of var set of 1..3: xs = [{1, 2}, {2}, {1, 2}, _];
62 var set of 1..3: ys;
63
64 var 1..3: eq_vi;
65 var 1..3: eq_vb;
66 var 1..3: eq_vf;
67 var 1..3: eq_vs;
68 var 1..3: eq_vo;
69
70 var 2..4: geq_vi;
71 var 2..4: geq_vb;
72 var 2..4: geq_vf;
73 var 2..4: geq_vs;
74 var 2..4: geq_vo;
75
76 var 2..4: gt_vi;
77 var 2..4: gt_vb;
78 var 2..4: gt_vf;
79 var 2..4: gt_vs;
80 var 2..4: gt_vo;
81
82 var 0..2: leq_vi;
83 var 0..2: leq_vb;
84 var 0..2: leq_vf;
85 var 0..2: leq_vs;
86 var 0..2: leq_vo;
87
88 var 0..2: lt_vi;
89 var 0..2: lt_vb;
90 var 0..2: lt_vf;
91 var 0..2: lt_vs;
92 var 0..2: lt_vo;
93
94 var 0..2: neq_vi;
95 var 0..2: neq_vb;
96 var 0..2: neq_vf;
97 var 0..2: neq_vs;
98 var 0..2: neq_vo;
99
100 % count_eq overloads
101 constraint count_eq(xi, yi, eq_vi);
102 constraint count_eq(xb, yb, eq_vb);
103 constraint count_eq(xf, yf, eq_vf);
104 constraint count_eq(xs, ys, eq_vs);
105 constraint count_eq(xoi, yoi, eq_vo);
106 constraint count_eq(xi, 1, 2);
107 constraint count_eq(xb, true, 2);
108 constraint count_eq(xf, 1.5, 2);
109 constraint count_eq(xs, {1, 2}, 2);
110
111 % count_geq overloads
112 constraint count_geq(xi, yi, geq_vi);
113 constraint count_geq(xb, yb, geq_vb);
114 constraint count_geq(xf, yf, geq_vf);
115 constraint count_geq(xs, ys, geq_vs);
116 constraint count_geq(xoi, yoi, geq_vo);
117 constraint count_geq(xi, 1, 3);
118 constraint count_geq(xb, true, 3);
119 constraint count_geq(xf, 1.5, 3);
120 constraint count_geq(xs, {1, 2}, 3);
121
122 % count_gt overloads
123 constraint count_gt(xi, yi, gt_vi);
124 constraint count_gt(xb, yb, gt_vb);
125 constraint count_gt(xf, yf, gt_vf);
126 constraint count_gt(xs, ys, gt_vs);
127 constraint count_gt(xoi, yoi, gt_vo);
128 constraint count_gt(xi, 1, 3);
129 constraint count_gt(xb, true, 3);
130 constraint count_gt(xf, 1.5, 3);
131 constraint count_gt(xs, {1, 2}, 3);
132
133 % count_leq overloads
134 constraint count_leq(xi, yi, leq_vi);
135 constraint count_leq(xb, yb, leq_vb);
136 constraint count_leq(xf, yf, leq_vf);
137 constraint count_leq(xs, ys, leq_vs);
138 constraint count_leq(xoi, yoi, leq_vo);
139 constraint count_leq(xi, 1, 1);
140 constraint count_leq(xb, true, 1);
141 constraint count_leq(xf, 1.5, 1);
142 constraint count_leq(xs, {1, 2}, 1);
143
144 % count_lt overloads
145 constraint count_lt(xi, yi, lt_vi);
146 constraint count_lt(xb, yb, lt_vb);
147 constraint count_lt(xf, yf, lt_vf);
148 constraint count_lt(xs, ys, lt_vs);
149 constraint count_lt(xoi, yoi, lt_vo);
150 constraint count_lt(xi, 1, 1);
151 constraint count_lt(xb, true, 1);
152 constraint count_lt(xf, 1.5, 1);
153 constraint count_lt(xs, {1, 2}, 1);
154
155 % count_neq overloads
156 constraint count_neq(xi, yi, neq_vi);
157 constraint count_neq(xb, yb, neq_vb);
158 constraint count_neq(xf, yf, neq_vf);
159 constraint count_neq(xs, ys, neq_vs);
160 constraint count_neq(xoi, yoi, neq_vo);
161 constraint count_neq(xi, 1, 1);
162 constraint count_neq(xb, true, 1);
163 constraint count_neq(xf, 1.5, 1);
164 constraint count_neq(xs, {1, 2}, 1);
165
166 any: obj :: output = sum([
167 xi[4],
168 yi,
169 xoi[4],
170 yoi,
171 xb[4],
172 yb,
173 xf[4],
174 yf,
175 max(xs[4]),
176 max(ys),
177 abs(eq_vi - 2),
178 abs(eq_vb - 2),
179 abs(eq_vf - 2),
180 abs(eq_vs - 2),
181 abs(eq_vo - 2),
182 abs(geq_vi - 3),
183 abs(geq_vb - 3),
184 abs(geq_vf - 3),
185 abs(geq_vs - 3),
186 abs(geq_vo - 3),
187 abs(gt_vi - 3),
188 abs(gt_vb - 3),
189 abs(gt_vf - 3),
190 abs(gt_vs - 3),
191 abs(gt_vo - 3),
192 abs(leq_vi - 1),
193 abs(leq_vb - 1),
194 abs(leq_vf - 1),
195 abs(leq_vs - 1),
196 abs(leq_vo - 1),
197 abs(lt_vi - 1),
198 abs(lt_vb - 1),
199 abs(lt_vf - 1),
200 abs(lt_vs - 1),
201 abs(lt_vo - 1),
202 abs(neq_vi - 1),
203 abs(neq_vb - 1),
204 abs(neq_vf - 1),
205 abs(neq_vs - 1),
206 abs(neq_vo - 1),
207 ]);
208
209 constraint obj = 12.5;