Generated on Mon Jul 27 2020 00:00:00 for Gecode by doxygen 1.8.18
product_fd.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("product::fd",
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..2] of int: capacity = [200, 400];\n\
51 array [1..6] of int: consumption = [5, 2, 4, 4, 3, 6];\n\
52 array [1..3] of int: demand = [100, 200, 300];\n\
53 array [1..3] of int: insideCost = [60, 80, 30];\n\
54 array [1..3] of int: outsideCost = [80, 90, 40];\n\
55 var 0..131000: INT____00001 :: is_defined_var :: var_is_introduced;\n\
56 array [1..3] of var 0..400: inside :: output_array([1..3]);\n\
57 array [1..3] of var 0..300: outside :: output_array([1..3]);\n\
58 constraint int_lin_eq([-1, 60, 80, 30, 80, 90, 40], [INT____00001, inside[1], inside[2], inside[3], outside[1], outside[2], outside[3]], 0) :: defines_var(INT____00001);\n\
59 constraint int_lin_le([-1, -1], [inside[1], outside[1]], -100);\n\
60 constraint int_lin_le([-1, -1], [inside[2], outside[2]], -200);\n\
61 constraint int_lin_le([-1, -1], [inside[3], outside[3]], -300);\n\
62 constraint int_lin_le([2, 4, 6], [inside[1], inside[2], inside[3]], 400);\n\
63 constraint int_lin_le([5, 4, 3], [inside[1], inside[2], inside[3]], 200);\n\
64 solve minimize INT____00001;\n\
65 ", "inside = array1d(1..3, [40, 0, 0]);\n\
66 outside = array1d(1..3, [60, 200, 300]);\n\
67 ----------\n\
68 ==========\n\
69 ");
70  }
71  };
72 
73  Create c;
74  }
75 
76 }}
77 
78 // STATISTICS: test-flatzinc
General test support.
Definition: afc.cpp:39
Gecode::FloatVal c(-8, 8)