Generated on Sat Oct 20 2018 12:43:45 for Gecode by doxygen 1.8.13
jobshop2x2.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("jobshop2x2",
46 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
47 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
48 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
49 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
50 array [1..4] of int: d = [2, 5, 3, 4];\n\
51 var bool: BOOL____00001 :: is_defined_var :: var_is_introduced;\n\
52 var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;\n\
53 var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\
54 var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;\n\
55 var 5..14: end;\n\
56 array [1..4] of var 0..14: s :: output_array([1..2, 1..2]);\n\
57 constraint array_bool_or([BOOL____00001, BOOL____00002], true);\n\
58 constraint array_bool_or([BOOL____00004, BOOL____00005], true);\n\
59 constraint int_lin_le([-1, 1], [end, s[2]], -5);\n\
60 constraint int_lin_le([-1, 1], [end, s[4]], -4);\n\
61 constraint int_lin_le([1, -1], [s[1], s[2]], -2);\n\
62 constraint int_lin_le([1, -1], [s[3], s[4]], -3);\n\
63 constraint int_lin_le_reif([-1, 1], [s[1], s[3]], -3, BOOL____00002) :: defines_var(BOOL____00002);\n\
64 constraint int_lin_le_reif([-1, 1], [s[2], s[4]], -4, BOOL____00005) :: defines_var(BOOL____00005);\n\
65 constraint int_lin_le_reif([1, -1], [s[1], s[3]], -2, BOOL____00001) :: defines_var(BOOL____00001);\n\
66 constraint int_lin_le_reif([1, -1], [s[2], s[4]], -5, BOOL____00004) :: defines_var(BOOL____00004);\n\
67 solve minimize end;\n\
68 ", "s = array2d(1..2, 1..2, [0, 2, 2, 7]);\n\
69 ----------\n\
70 ==========\n\
71 ");
72  }
73  };
74 
75  Create c;
76  }
77 
78 }}
79 
80 // STATISTICS: test-flatzinc
Gecode::FloatVal c(-8, 8)
General test support.
Definition: afc.cpp:39