this repo has no description
dekker.one
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include "test/flatzinc.hh"
35
36namespace Test { namespace FlatZinc {
37
38 namespace {
39 /// Helper class to create and register tests
40 class Create {
41 public:
42
43 /// Perform creation and registration
44 Create(void) {
45 (void) new FlatZincTest("magic_square::3",
46"predicate all_different_int(array [int] of var int: x);\n\
47predicate all_equal_int(array [int] of var int: x);\n\
48predicate among(var int: n, array [int] of var int: x, set of int: v);\n\
49predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\
50predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\
51predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\
52predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\
53predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\
54predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\
55predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\
56predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
57predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
58predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
59predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
60predicate count(array [int] of var int: x, var int: y, var int: c);\n\
61predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\
62predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\
63predicate decreasing_bool(array [int] of var bool: x);\n\
64predicate decreasing_int(array [int] of var int: x);\n\
65predicate disjoint(var set of int: s1, var set of int: s2);\n\
66predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\
67predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\
68predicate gecode_circuit(int: offset, array [int] of var int: x);\n\
69predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\
70predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\
71predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\
72predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\
73predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\
74predicate 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\
75predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\
76predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\
77predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\
78predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\
79predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
80predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
81predicate 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\
82predicate 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\
83predicate increasing_bool(array [int] of var bool: x);\n\
84predicate increasing_int(array [int] of var int: x);\n\
85predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\
86predicate maximum_int(var int: m, array [int] of var int: x);\n\
87predicate member_bool(array [int] of var bool: x, var bool: y);\n\
88predicate member_int(array [int] of var int: x, var int: y);\n\
89predicate minimum_int(var int: m, array [int] of var int: x);\n\
90predicate nvalue(var int: n, array [int] of var int: x);\n\
91predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\
92predicate sort(array [int] of var int: x, array [int] of var int: y);\n\
93predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\
94predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\
95array [1..9] of var 1..9: a :: output_array([1..3, 1..3]);\n\
96constraint all_different_int([a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9]]);\n\
97constraint int_lin_eq([1, 1, 1], [a[1], a[2], a[3]], 15);\n\
98constraint int_lin_eq([1, 1, 1], [a[1], a[4], a[7]], 15);\n\
99constraint int_lin_eq([1, 1, 1], [a[1], a[5], a[9]], 15);\n\
100constraint int_lin_eq([1, 1, 1], [a[2], a[5], a[8]], 15);\n\
101constraint int_lin_eq([1, 1, 1], [a[3], a[5], a[7]], 15);\n\
102constraint int_lin_eq([1, 1, 1], [a[3], a[6], a[9]], 15);\n\
103constraint int_lin_eq([1, 1, 1], [a[4], a[5], a[6]], 15);\n\
104constraint int_lin_eq([1, 1, 1], [a[7], a[8], a[9]], 15);\n\
105solve satisfy;\n\
106", "a = array2d(1..3, 1..3, [4, 3, 8, 9, 5, 1, 2, 7, 6]);\n\
107----------\n\
108");
109 }
110 };
111
112 Create c;
113 }
114
115}}
116
117// STATISTICS: test-flatzinc