Generated on Sat Jan 12 2019 20:58:51 for Gecode by doxygen 1.8.13
magicsq_4.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  * 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 
36 namespace Test { namespace FlatZinc {
37 
38  namespace {
40  class Create {
41  public:
42 
44  Create(void) {
45  (void) new FlatZincTest("magic_square::4",
46 "predicate all_different_int(array [int] of var int: x);\n\
47 predicate all_equal_int(array [int] of var int: x);\n\
48 predicate among(var int: n, array [int] of var int: x, set of int: v);\n\
49 predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\
50 predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\
51 predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\
52 predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\
53 predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\
54 predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\
55 predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\
56 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
57 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
58 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
59 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
60 predicate count(array [int] of var int: x, var int: y, var int: c);\n\
61 predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\
62 predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\
63 predicate decreasing_bool(array [int] of var bool: x);\n\
64 predicate decreasing_int(array [int] of var int: x);\n\
65 predicate disjoint(var set of int: s1, var set of int: s2);\n\
66 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\
67 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\
68 predicate gecode_circuit(int: offset, array [int] of var int: x);\n\
69 predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\
70 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\
71 predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\
72 predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\
73 predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\
74 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\
75 predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\
76 predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\
77 predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\
78 predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\
79 predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
80 predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
81 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\
82 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\
83 predicate increasing_bool(array [int] of var bool: x);\n\
84 predicate increasing_int(array [int] of var int: x);\n\
85 predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\
86 predicate maximum_int(var int: m, array [int] of var int: x);\n\
87 predicate member_bool(array [int] of var bool: x, var bool: y);\n\
88 predicate member_int(array [int] of var int: x, var int: y);\n\
89 predicate minimum_int(var int: m, array [int] of var int: x);\n\
90 predicate nvalue(var int: n, array [int] of var int: x);\n\
91 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\
92 predicate sort(array [int] of var int: x, array [int] of var int: y);\n\
93 predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\
94 predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\
95 array [1..16] of var 1..16: a :: output_array([1..4, 1..4]);\n\
96 constraint all_different_int([a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[14], a[15], a[16]]);\n\
97 constraint int_lin_eq([1, 1, 1, 1], [a[1], a[2], a[3], a[4]], 34);\n\
98 constraint int_lin_eq([1, 1, 1, 1], [a[1], a[5], a[9], a[13]], 34);\n\
99 constraint int_lin_eq([1, 1, 1, 1], [a[1], a[6], a[11], a[16]], 34);\n\
100 constraint int_lin_eq([1, 1, 1, 1], [a[2], a[6], a[10], a[14]], 34);\n\
101 constraint int_lin_eq([1, 1, 1, 1], [a[3], a[7], a[11], a[15]], 34);\n\
102 constraint int_lin_eq([1, 1, 1, 1], [a[4], a[7], a[10], a[13]], 34);\n\
103 constraint int_lin_eq([1, 1, 1, 1], [a[4], a[8], a[12], a[16]], 34);\n\
104 constraint int_lin_eq([1, 1, 1, 1], [a[5], a[6], a[7], a[8]], 34);\n\
105 constraint int_lin_eq([1, 1, 1, 1], [a[9], a[10], a[11], a[12]], 34);\n\
106 constraint int_lin_eq([1, 1, 1, 1], [a[13], a[14], a[15], a[16]], 34);\n\
107 solve satisfy;\n\
108 ", "a = array2d(1..4, 1..4, [13, 2, 7, 12, 3, 16, 9, 6, 10, 5, 4, 15, 8, 11, 14, 1]);\n\
109 ----------\n\
110 ");
111  }
112  };
113 
114  Create c;
115  }
116 
117 }}
118 
119 // STATISTICS: test-flatzinc
Gecode::FloatVal c(-8, 8)
General test support.
Definition: afc.cpp:39