Generated on Sat Feb 7 2015 02:01:10 for Gecode by doxygen 1.8.9.1
alpha.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Guido Tack <tack@gecode.org>
5  *
6  * Copyright:
7  * Guido Tack, 2014
8  *
9  * Last modified:
10  * $Date: 2014-11-04 13:28:32 +0100 (Tue, 04 Nov 2014) $ by $Author: schulte $
11  * $Revision: 14287 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include "test/flatzinc.hh"
39 
40 namespace Test { namespace FlatZinc {
41 
42  namespace {
44  class Create {
45  public:
46 
48  Create(void) {
49  (void) new FlatZincTest("alpha",
50 "predicate all_different_int(array [int] of var int: x);\n\
51 predicate all_equal_int(array [int] of var int: x);\n\
52 predicate among(var int: n, array [int] of var int: x, set of int: v);\n\
53 predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\
54 predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\
55 predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\
56 predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\
57 predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\
58 predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\
59 predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\
60 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
61 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
62 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
63 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
64 predicate count(array [int] of var int: x, var int: y, var int: c);\n\
65 predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\
66 predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\
67 predicate decreasing_bool(array [int] of var bool: x);\n\
68 predicate decreasing_int(array [int] of var int: x);\n\
69 predicate disjoint(var set of int: s1, var set of int: s2);\n\
70 predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\
71 predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\
72 predicate gecode_circuit(int: offset, array [int] of var int: x);\n\
73 predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\
74 predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\
75 predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\
76 predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\
77 predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\
78 predicate gecode_nooverlap(array [int] of var int: x, array [int] of var int: w, array [int] of var int: y, array [int] of var int: h);\n\
79 predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\
80 predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\
81 predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\
82 predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\
83 predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
84 predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
85 predicate global_cardinality_low_up(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\
86 predicate global_cardinality_low_up_closed(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\
87 predicate increasing_bool(array [int] of var bool: x);\n\
88 predicate increasing_int(array [int] of var int: x);\n\
89 predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\
90 predicate maximum_int(var int: m, array [int] of var int: x);\n\
91 predicate member_bool(array [int] of var bool: x, var bool: y);\n\
92 predicate member_int(array [int] of var int: x, var int: y);\n\
93 predicate minimum_int(var int: m, array [int] of var int: x);\n\
94 predicate nvalue(var int: n, array [int] of var int: x);\n\
95 predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\
96 predicate sort(array [int] of var int: x, array [int] of var int: y);\n\
97 predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\
98 predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\
99 var 1..26: a :: output_var;\n\
100 var 1..26: b :: output_var;\n\
101 var 1..26: c :: output_var;\n\
102 var 1..26: d :: output_var;\n\
103 var 1..26: e :: output_var;\n\
104 var 1..26: f :: output_var;\n\
105 var 1..26: g :: output_var;\n\
106 var 1..26: h :: output_var;\n\
107 var 1..26: i :: output_var;\n\
108 var 1..26: j :: output_var;\n\
109 var 1..26: k :: output_var;\n\
110 var 1..26: l :: output_var;\n\
111 var 1..26: m :: output_var;\n\
112 var 1..26: n :: output_var;\n\
113 var 1..26: o :: output_var;\n\
114 var 1..26: p :: output_var;\n\
115 var 1..26: q :: output_var;\n\
116 var 1..26: r :: output_var;\n\
117 var 1..26: s :: output_var;\n\
118 var 1..26: t :: output_var;\n\
119 var 1..26: u :: output_var;\n\
120 var 1..26: v :: output_var;\n\
121 var 1..26: w :: output_var;\n\
122 var 1..26: x :: output_var;\n\
123 var 1..26: y :: output_var;\n\
124 var 1..26: z :: output_var;\n\
125 constraint all_different_int([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z]);\n\
126 constraint int_lin_eq([1, 1, 2], [a, j, z], 58);\n\
127 constraint int_lin_eq([1, 1, 2], [b, e, o], 53);\n\
128 constraint int_lin_eq([1, 2, 1], [l, o, s], 37);\n\
129 constraint int_lin_eq([2, 1, 1], [e, g, l], 66);\n\
130 constraint int_lin_eq([1, 1, 1, 1], [e, l, r, y], 47);\n\
131 constraint int_lin_eq([1, 1, 1, 1], [g, n, o, s], 61);\n\
132 constraint int_lin_eq([1, 1, 1, 2], [e, f, g, u], 50);\n\
133 constraint int_lin_eq([1, 1, 2, 1], [c, e, l, o], 43);\n\
134 constraint int_lin_eq([2, 1, 1, 1], [e, h, m, t], 72);\n\
135 constraint int_lin_eq([1, 1, 1, 1, 1], [a, c, e, l, s], 51);\n\
136 constraint int_lin_eq([1, 1, 1, 1, 1], [a, e, o, p, r], 65);\n\
137 constraint int_lin_eq([1, 1, 1, 1, 1], [a, k, l, o, p], 59);\n\
138 constraint int_lin_eq([1, 1, 1, 1, 1], [a, l, t, w, z], 34);\n\
139 constraint int_lin_eq([1, 1, 1, 1, 1], [e, f, l, t, u], 30);\n\
140 constraint int_lin_eq([1, 1, 1, 2, 1], [a, b, e, l, t], 45);\n\
141 constraint int_lin_eq([2, 1, 1, 1, 1], [i, l, n, o, v], 100);\n\
142 constraint int_lin_eq([1, 1, 1, 1, 2, 1], [a, e, q, r, t, u], 50);\n\
143 constraint int_lin_eq([1, 1, 2, 1, 1, 1], [a, n, o, p, r, s], 82);\n\
144 constraint int_lin_eq([2, 1, 1, 1, 1, 1], [c, e, n, o, r, t], 74);\n\
145 constraint int_lin_eq([1, 1, 1, 1, 2, 1, 1, 1], [a, e, h, n, o, p, s, x], 134);\n\
146 solve satisfy;\n\
147 ", "a = 5;\n\
148 b = 13;\n\
149 c = 9;\n\
150 d = 16;\n\
151 e = 20;\n\
152 f = 4;\n\
153 g = 24;\n\
154 h = 21;\n\
155 i = 25;\n\
156 j = 17;\n\
157 k = 23;\n\
158 l = 2;\n\
159 m = 8;\n\
160 n = 12;\n\
161 o = 10;\n\
162 p = 19;\n\
163 q = 7;\n\
164 r = 11;\n\
165 s = 15;\n\
166 t = 3;\n\
167 u = 1;\n\
168 v = 26;\n\
169 w = 6;\n\
170 x = 22;\n\
171 y = 14;\n\
172 z = 18;\n\
173 ----------\n\
174 ");
175  }
176  };
177 
178  Create c;
179  }
180 
181 }}
182 
183 // STATISTICS: test-flatzinc
Gecode::FloatVal c(-8, 8)
General test support.
Definition: afc.cpp:43