Generated on Mon Feb 8 2021 00:00:00 for Gecode by doxygen 1.8.20
shared_array_element.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, 2018
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("SharedArrayElement",
46 "predicate count(array [int] of var int: x,var int: y,var int: c);\n\
47 array [1..6] of int: X_INTRODUCED_25_ = [0,0,1,1,0,1];\n\
48 array [1..6] of int: X_INTRODUCED_27_ = [1,0,0,0,1,0];\n\
49 array [1..6] of int: X_INTRODUCED_29_ = [1,1,0,1,0,0];\n\
50 array [1..3] of int: X_INTRODUCED_43_ = [1,1,1];\n\
51 array [1..5] of int: X_INTRODUCED_49_ = [1,1,1,1,1];\n\
52 var 1..3: X_INTRODUCED_0_;\n\
53 var 1..3: X_INTRODUCED_1_;\n\
54 var 1..3: X_INTRODUCED_2_;\n\
55 var 1..3: X_INTRODUCED_3_;\n\
56 var 1..3: X_INTRODUCED_4_;\n\
57 var 1..3: X_INTRODUCED_5_;\n\
58 var 1..3: X_INTRODUCED_6_;\n\
59 var 1..3: X_INTRODUCED_7_;\n\
60 var 1..3: X_INTRODUCED_8_;\n\
61 var 1..3: X_INTRODUCED_9_;\n\
62 var 0..1: X_INTRODUCED_26_ ::var_is_introduced :: is_defined_var;\n\
63 var 0..1: X_INTRODUCED_28_ ::var_is_introduced :: is_defined_var;\n\
64 var 0..1: X_INTRODUCED_30_ ::var_is_introduced :: is_defined_var;\n\
65 var 0..1: X_INTRODUCED_31_ ::var_is_introduced :: is_defined_var;\n\
66 var 0..1: X_INTRODUCED_32_ ::var_is_introduced :: is_defined_var;\n\
67 var 0..1: X_INTRODUCED_33_ ::var_is_introduced :: is_defined_var;\n\
68 var 0..1: X_INTRODUCED_34_ ::var_is_introduced :: is_defined_var;\n\
69 var 0..1: X_INTRODUCED_35_ ::var_is_introduced :: is_defined_var;\n\
70 var 0..0: X_INTRODUCED_36_ ::var_is_introduced :: is_defined_var;\n\
71 var 0..0: X_INTRODUCED_37_ ::var_is_introduced :: is_defined_var;\n\
72 var 0..0: X_INTRODUCED_38_ ::var_is_introduced :: is_defined_var;\n\
73 var 0..1: X_INTRODUCED_39_ ::var_is_introduced :: is_defined_var;\n\
74 var 0..1: X_INTRODUCED_40_ ::var_is_introduced :: is_defined_var;\n\
75 var 0..1: X_INTRODUCED_41_ ::var_is_introduced :: is_defined_var;\n\
76 var 0..1: X_INTRODUCED_42_ ::var_is_introduced :: is_defined_var;\n\
77 array [1..10] of var int: X:: output_array([1..10]) = [X_INTRODUCED_0_,X_INTRODUCED_1_,X_INTRODUCED_2_,X_INTRODUCED_3_,X_INTRODUCED_4_,X_INTRODUCED_5_,X_INTRODUCED_6_,X_INTRODUCED_7_,X_INTRODUCED_8_,X_INTRODUCED_9_];\n\
78 array [1..15] of var int: Y:: output_array([1..15]) = [X_INTRODUCED_26_,X_INTRODUCED_28_,X_INTRODUCED_30_,X_INTRODUCED_31_,X_INTRODUCED_32_,X_INTRODUCED_33_,X_INTRODUCED_34_,X_INTRODUCED_35_,X_INTRODUCED_36_,X_INTRODUCED_37_,X_INTRODUCED_38_,X_INTRODUCED_39_,X_INTRODUCED_40_,X_INTRODUCED_41_,X_INTRODUCED_42_];\n\
79 constraint array_int_element(X_INTRODUCED_0_,X_INTRODUCED_25_,X_INTRODUCED_26_):: defines_var(X_INTRODUCED_26_);\n\
80 constraint array_int_element(X_INTRODUCED_0_,X_INTRODUCED_27_,X_INTRODUCED_28_):: defines_var(X_INTRODUCED_28_);\n\
81 constraint array_int_element(X_INTRODUCED_0_,X_INTRODUCED_29_,X_INTRODUCED_30_):: defines_var(X_INTRODUCED_30_);\n\
82 constraint array_int_element(X_INTRODUCED_1_,X_INTRODUCED_27_,X_INTRODUCED_31_):: defines_var(X_INTRODUCED_31_);\n\
83 constraint array_int_element(X_INTRODUCED_1_,X_INTRODUCED_29_,X_INTRODUCED_32_):: defines_var(X_INTRODUCED_32_);\n\
84 constraint array_int_element(X_INTRODUCED_2_,X_INTRODUCED_27_,X_INTRODUCED_33_):: defines_var(X_INTRODUCED_33_);\n\
85 constraint array_int_element(X_INTRODUCED_2_,X_INTRODUCED_29_,X_INTRODUCED_34_):: defines_var(X_INTRODUCED_34_);\n\
86 constraint array_int_element(X_INTRODUCED_3_,X_INTRODUCED_27_,X_INTRODUCED_35_):: defines_var(X_INTRODUCED_35_);\n\
87 constraint array_int_element(X_INTRODUCED_3_,X_INTRODUCED_29_,X_INTRODUCED_36_):: defines_var(X_INTRODUCED_36_);\n\
88 constraint array_int_element(X_INTRODUCED_4_,X_INTRODUCED_27_,X_INTRODUCED_37_):: defines_var(X_INTRODUCED_37_);\n\
89 constraint array_int_element(X_INTRODUCED_4_,X_INTRODUCED_29_,X_INTRODUCED_38_):: defines_var(X_INTRODUCED_38_);\n\
90 constraint array_int_element(X_INTRODUCED_5_,X_INTRODUCED_27_,X_INTRODUCED_39_):: defines_var(X_INTRODUCED_39_);\n\
91 constraint array_int_element(X_INTRODUCED_5_,X_INTRODUCED_29_,X_INTRODUCED_40_):: defines_var(X_INTRODUCED_40_);\n\
92 constraint array_int_element(X_INTRODUCED_6_,X_INTRODUCED_27_,X_INTRODUCED_41_):: defines_var(X_INTRODUCED_41_);\n\
93 constraint array_int_element(X_INTRODUCED_6_,X_INTRODUCED_29_,X_INTRODUCED_42_):: defines_var(X_INTRODUCED_42_);\n\
94 constraint int_lin_eq(X_INTRODUCED_43_,[X_INTRODUCED_31_,X_INTRODUCED_28_,X_INTRODUCED_33_],1);\n\
95 constraint int_lin_eq(X_INTRODUCED_43_,[X_INTRODUCED_33_,X_INTRODUCED_31_,X_INTRODUCED_35_],1);\n\
96 constraint int_lin_eq(X_INTRODUCED_43_,[X_INTRODUCED_35_,X_INTRODUCED_33_,X_INTRODUCED_37_],1);\n\
97 constraint int_lin_eq(X_INTRODUCED_43_,[X_INTRODUCED_37_,X_INTRODUCED_35_,X_INTRODUCED_39_],1);\n\
98 constraint int_lin_eq(X_INTRODUCED_43_,[X_INTRODUCED_39_,X_INTRODUCED_37_,X_INTRODUCED_41_],1);\n\
99 constraint int_lin_eq(X_INTRODUCED_49_,[X_INTRODUCED_36_,X_INTRODUCED_34_,X_INTRODUCED_32_,X_INTRODUCED_30_,X_INTRODUCED_38_],2);\n\
100 constraint int_lin_eq(X_INTRODUCED_49_,[X_INTRODUCED_38_,X_INTRODUCED_36_,X_INTRODUCED_34_,X_INTRODUCED_32_,X_INTRODUCED_40_],2);\n\
101 constraint int_lin_eq(X_INTRODUCED_49_,[X_INTRODUCED_40_,X_INTRODUCED_38_,X_INTRODUCED_36_,X_INTRODUCED_34_,X_INTRODUCED_42_],2);\n\
102 constraint count(X,2,1);\n\
103 solve satisfy;\n\
104 ",
105 "X = array1d(1..10, [2, 3, 1, 3, 3, 1, 3, 1, 1, 1]);\n\
106 Y = array1d(1..15, [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0]);\n\
107 ----------\n\
108 "
109 );
110  }
111  };
112 
113  Create c;
114  }
115 
116 }}
117 
118 // STATISTICS: test-flatzinc
General test support.
Definition: afc.cpp:39
Gecode::FloatVal c(-8, 8)