1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2014
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include "test/flatzinc.hh"
namespace Test { namespace FlatZinc {
namespace {
/// Helper class to create and register tests
class Create {
public:
/// Perform creation and registration
Create(void) {
(void) new FlatZincTest("multidim_knapsack_simple",
"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
array [1..3] of int: Capacities = [5, 10, 15];\n\
array [1..5] of int: Profits = [5, 6, 3, 7, 4];\n\
array [1..15] of int: Weights = [2, 3, 2, 1, 4, 4, 1, 2, 5, 3, 2, 3, 1, 3, 5];\n\
var 0..25: INT____00001 :: is_defined_var :: var_is_introduced;\n\
array [1..5] of var 0..1: x :: output_array([1..5]);\n\
constraint int_lin_eq([-1, 5, 6, 3, 7, 4], [INT____00001, x[1], x[2], x[3], x[4], x[5]], 0) :: defines_var(INT____00001);\n\
constraint int_lin_le([2, 1, 1, 3, 1], [x[1], x[2], x[3], x[4], x[5]], 5);\n\
constraint int_lin_le([2, 4, 5, 3, 5], [x[1], x[2], x[3], x[4], x[5]], 15);\n\
constraint int_lin_le([3, 4, 2, 2, 3], [x[1], x[2], x[3], x[4], x[5]], 10);\n\
solve maximize INT____00001;\n\
", "x = array1d(1..5, [0, 1, 0, 1, 1]);\n\
----------\n\
==========\n\
");
}
};
Create c;
}
}}
// STATISTICS: test-flatzinc
|
