main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
test
flatzinc
2dpacking.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
(
"2DPacking"
,
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..4] of int: ItemHeight = [4, 4, 4, 3];\n\
55
array [1..4] of int: ItemWidth = [1, 1, 2, 3];\n\
56
var 0..2: INT____00001 :: is_defined_var :: var_is_introduced;\n\
57
array [1..2] of var 0..1: bin;\n\
58
array [1..8] of var 0..1: item :: output_array([1..2, 1..4]);\n\
59
var 0..2: obj :: output_var = INT____00001;\n\
60
array [1..16] of var 0..1: x____00002;\n\
61
array [1..16] of var 0..1: x____00003;\n\
62
constraint int_eq(x____00002[5], 0);\n\
63
constraint int_eq(x____00002[9], 0);\n\
64
constraint int_eq(x____00002[10], 0);\n\
65
constraint int_eq(x____00002[13], 0);\n\
66
constraint int_eq(x____00002[14], 0);\n\
67
constraint int_eq(x____00002[15], 0);\n\
68
constraint int_eq(x____00003[5], 0);\n\
69
constraint int_eq(x____00003[9], 0);\n\
70
constraint int_eq(x____00003[10], 0);\n\
71
constraint int_eq(x____00003[13], 0);\n\
72
constraint int_eq(x____00003[14], 0);\n\
73
constraint int_eq(x____00003[15], 0);\n\
74
constraint int_lin_eq([1, -1], [item[1], x____00002[1]], 0);\n\
75
constraint int_lin_eq([1, -1], [item[5], x____00003[1]], 0);\n\
76
constraint int_lin_eq([1, 1], [item[1], item[5]], 1);\n\
77
constraint int_lin_eq([1, 1], [item[2], item[6]], 1);\n\
78
constraint int_lin_eq([1, 1], [item[3], item[7]], 1);\n\
79
constraint int_lin_eq([1, 1], [item[4], item[8]], 1);\n\
80
constraint int_lin_eq([1, -1, -1], [item[1], x____00002[2], x____00002[6]], 0);\n\
81
constraint int_lin_eq([1, -1, -1], [item[5], x____00003[2], x____00003[6]], 0);\n\
82
constraint int_lin_eq([1, -1, -1, -1], [item[1], x____00002[3], x____00002[7], x____00002[11]], 0);\n\
83
constraint int_lin_eq([1, -1, -1, -1], [item[5], x____00003[3], x____00003[7], x____00003[11]], 0);\n\
84
constraint int_lin_eq([1, -1, -1, -1, -1], [item[1], x____00002[4], x____00002[8], x____00002[12], x____00002[16]], 0);\n\
85
constraint int_lin_eq([1, -1, -1, -1, -1], [item[5], x____00003[4], x____00003[8], x____00003[12], x____00003[16]], 0);\n\
86
constraint int_lin_le([-2], [x____00002[16]], 0);\n\
87
constraint int_lin_le([-2], [x____00003[16]], 0);\n\
88
constraint int_lin_le([-3, 3], [x____00002[11], x____00002[12]], 0);\n\
89
constraint int_lin_le([-3, 3], [x____00003[11], x____00003[12]], 0);\n\
90
constraint int_lin_le([-4, 2, 3], [x____00002[6], x____00002[7], x____00002[8]], 0);\n\
91
constraint int_lin_le([-4, 2, 3], [x____00003[6], x____00003[7], x____00003[8]], 0);\n\
92
constraint int_lin_le([-4, 1, 2, 3], [x____00002[1], x____00002[2], x____00002[3], x____00002[4]], 0);\n\
93
constraint int_lin_le([-4, 1, 2, 3], [x____00003[1], x____00003[2], x____00003[3], x____00003[4]], 0);\n\
94
constraint int_lin_le([-10, 4, 4, 4, 3], [bin[1], x____00002[1], x____00002[6], x____00002[11], x____00002[16]], 0);\n\
95
constraint int_lin_le([-10, 4, 4, 4, 3], [bin[2], x____00003[1], x____00003[6], x____00003[11], x____00003[16]], 0);\n\
96
constraint int_plus(bin[1], bin[2], INT____00001) :: defines_var(INT____00001);\n\
97
solve minimize INT____00001;\n\
98
"
,
99
"item = array2d(1..2, 1..4, [1, 1, 1, 1, 0, 0, 0, 0]);\n\
100
obj = 1;\n\
101
----------\n\
102
==========\n\
103
"
);
104
}
105
};
106
107
Create
c
;
108
}
109
110
}}
111
112
// STATISTICS: test-flatzinc
Test
General test support.
Definition:
afc.cpp:43
Test::FlatZinc::FlatZincTest
Base class for tests for FlatZinc
Definition:
flatzinc.hh:55
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
flatzinc.hh