Generated on Sat Feb 7 2015 02:01:31 for Gecode by doxygen 1.8.9.1
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  * 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("product::fd",
50 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
51 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
52 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
53 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
54 array [1..2] of int: capacity = [200, 400];\n\
55 array [1..6] of int: consumption = [5, 2, 4, 4, 3, 6];\n\
56 array [1..3] of int: demand = [100, 200, 300];\n\
57 array [1..3] of int: insideCost = [60, 80, 30];\n\
58 array [1..3] of int: outsideCost = [80, 90, 40];\n\
59 var 0..131000: INT____00001 :: is_defined_var :: var_is_introduced;\n\
60 array [1..3] of var 0..400: inside :: output_array([1..3]);\n\
61 array [1..3] of var 0..300: outside :: output_array([1..3]);\n\
62 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\
63 constraint int_lin_le([-1, -1], [inside[1], outside[1]], -100);\n\
64 constraint int_lin_le([-1, -1], [inside[2], outside[2]], -200);\n\
65 constraint int_lin_le([-1, -1], [inside[3], outside[3]], -300);\n\
66 constraint int_lin_le([2, 4, 6], [inside[1], inside[2], inside[3]], 400);\n\
67 constraint int_lin_le([5, 4, 3], [inside[1], inside[2], inside[3]], 200);\n\
68 solve minimize INT____00001;\n\
69 ", "inside = array1d(1..3, [40, 0, 0]);\n\
70 outside = array1d(1..3, [60, 200, 300]);\n\
71 ----------\n\
72 ==========\n\
73 ");
74  }
75  };
76 
77  Create c;
78  }
79 
80 }}
81 
82 // STATISTICS: test-flatzinc
Gecode::FloatVal c(-8, 8)
General test support.
Definition: afc.cpp:43