]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/fusion/test/Jamfile
update sources to v12.2.3
[ceph.git] / ceph / src / boost / libs / fusion / test / Jamfile
1 ##==============================================================================
2 # Copyright (c) 2003-2006 Joel de Guzman
3 # Copyright (c) 2013 Mateusz Loskot
4 # Copyright (c) 2014-2017 Kohei Takahashi
5 #
6 # Use, modification and distribution is subject to the Boost Software
7 # License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
8 # http://www.boost.org/LICENSE_1_0.txt)
9 #==============================================================================
10 # bring in rules for testing
11 import testing ;
12 import ../../config/checks/config : requires ;
13
14 project
15 : requirements
16 ;
17
18 {
19 test-suite fusion :
20
21 [ run algorithm/all.cpp ]
22 [ run algorithm/any.cpp ]
23 [ run algorithm/clear.cpp ]
24 [ run algorithm/copy.cpp ]
25 [ run algorithm/count.cpp ]
26 [ run algorithm/count_if.cpp ]
27 [ run algorithm/erase.cpp ]
28 [ run algorithm/erase_key.cpp ]
29 [ run algorithm/filter.cpp ]
30 [ run algorithm/filter_if.cpp ]
31 [ run algorithm/find.cpp ]
32 [ run algorithm/find_if.cpp ]
33 [ run algorithm/fold.cpp ]
34 [ run algorithm/for_each.cpp ]
35 [ run algorithm/insert.cpp ]
36 [ run algorithm/insert_range.cpp ]
37 [ run algorithm/iter_fold.cpp ]
38 [ run algorithm/move.cpp ]
39 [ run algorithm/none.cpp ]
40 [ run algorithm/pop_back.cpp ]
41 [ run algorithm/pop_front.cpp ]
42 [ run algorithm/push_back.cpp ]
43 [ run algorithm/push_front.cpp ]
44 [ run algorithm/remove.cpp ]
45 [ run algorithm/remove_if.cpp ]
46 [ run algorithm/replace.cpp ]
47 [ run algorithm/replace_if.cpp ]
48 [ run algorithm/reverse_fold.cpp ]
49 [ run algorithm/reverse_iter_fold.cpp ]
50 [ run algorithm/reverse.cpp ]
51 [ run algorithm/segmented_for_each.cpp ]
52 [ run algorithm/segmented_find.cpp ]
53 [ run algorithm/segmented_find_if.cpp ]
54 [ run algorithm/segmented_fold.cpp ]
55 [ run algorithm/transform.cpp ]
56 [ run algorithm/join.cpp ]
57 [ run algorithm/zip.cpp ]
58 [ run algorithm/zip2.cpp ]
59 [ run algorithm/zip_ignore.cpp ]
60 [ run algorithm/flatten.cpp ]
61
62 [ run sequence/as_deque.cpp ]
63 [ run sequence/as_list.cpp ]
64 [ run sequence/as_map.cpp ]
65 [ run sequence/as_map_assoc.cpp ]
66 [ run sequence/as_set.cpp ]
67 [ run sequence/as_vector.cpp ]
68 [ run sequence/boost_tuple.cpp ]
69 [ run sequence/boost_tuple_iterator.cpp ]
70 [ run sequence/cons.cpp ]
71 [ run sequence/convert_boost_tuple.cpp ]
72 [ run sequence/convert_deque.cpp ]
73 [ run sequence/convert_list.cpp ]
74 [ run sequence/convert_std_pair.cpp ]
75 [ run sequence/convert_std_tuple.cpp : :
76 : [ requires cxx11_variadic_templates cxx11_hdr_tuple ] ]
77 [ run sequence/convert_vector.cpp ]
78 [ run sequence/filter_view.cpp ]
79 [ run sequence/hash.cpp ]
80 [ run sequence/io.cpp ]
81 [ run sequence/iterator_range.cpp ]
82 [ run sequence/joint_view.cpp ]
83 [ run sequence/list_comparison.cpp ]
84 [ run sequence/list_construction.cpp ]
85 [ run sequence/list_copy.cpp ]
86 [ run sequence/list_iterator.cpp ]
87 [ run sequence/list_hash.cpp ]
88 [ run sequence/list_make.cpp ]
89 [ run sequence/list_misc.cpp ]
90 [ run sequence/list_mutate.cpp ]
91 [ run sequence/list_nest.cpp ]
92 [ run sequence/list_tie.cpp ]
93 [ run sequence/list_value_at.cpp ]
94 [ run sequence/deque_comparison.cpp ]
95 [ run sequence/deque_construction.cpp ]
96 [ run sequence/deque_copy.cpp ]
97 [ run sequence/deque_iterator.cpp ]
98 [ run sequence/deque_hash.cpp ]
99 [ compile sequence/deque_is_constructible.cpp ]
100 [ run sequence/deque_make.cpp ]
101 [ run sequence/deque_misc.cpp ]
102 [ run sequence/deque_move.cpp ]
103 [ run sequence/deque_mutate.cpp ]
104 [ run sequence/deque_nest.cpp ]
105 [ run sequence/deque_tie.cpp ]
106 [ run sequence/deque_value_at.cpp ]
107 [ run sequence/front_extended_deque.cpp ]
108 [ run sequence/back_extended_deque.cpp ]
109 [ run sequence/make_list.cpp ]
110 [ run sequence/make_vector.cpp ]
111 [ run sequence/map.cpp ]
112 [ run sequence/map_comparison.cpp ]
113 [ run sequence/map_construction.cpp ]
114 [ run sequence/map_copy.cpp ]
115 [ run sequence/map_misc.cpp ]
116 [ run sequence/map_move.cpp ]
117 [ run sequence/map_mutate.cpp ]
118 [ run sequence/map_tie.cpp ]
119 [ run sequence/nil.cpp ]
120 [ run sequence/nview.cpp ]
121 [ run sequence/reverse_view.cpp ]
122 [ run sequence/segmented_iterator_range.cpp ]
123 [ run sequence/set.cpp ]
124 [ run sequence/single_view.cpp ]
125 [ run sequence/std_pair.cpp ]
126 [ run sequence/boost_array.cpp ]
127 [ run sequence/array.cpp ]
128 [ run sequence/std_array.cpp : :
129 : [ requires cxx11_hdr_array ] ]
130 [ run sequence/tuple_comparison.cpp ]
131 [ run sequence/tuple_construction.cpp ]
132 [ run sequence/tuple_conversion.cpp ]
133 [ run sequence/tuple_copy.cpp ]
134 [ run sequence/tuple_element.cpp ]
135 [ run sequence/tuple_make.cpp ]
136 [ run sequence/tuple_misc.cpp ]
137 [ run sequence/tuple_mutate.cpp ]
138 [ run sequence/tuple_nest.cpp ]
139 [ run sequence/tuple_hash.cpp ]
140 [ run sequence/tuple_tie.cpp ]
141 [ run sequence/tuple_traits.cpp : :
142 :
143 : tuple_traits__maybe_variadic ]
144 [ run sequence/tuple_traits.cpp : :
145 : <define>BOOST_FUSION_DISABLE_VARIADIC_VECTOR
146 : tuple_traits__no_variadic ]
147 [ run sequence/transform_view.cpp ]
148 [ run sequence/vector_comparison.cpp ]
149 [ run sequence/vector_construction.cpp ]
150 [ run sequence/vector_conversion.cpp ]
151 [ run sequence/vector_copy.cpp ]
152 [ run sequence/vector_iterator.cpp ]
153 [ run sequence/vector_make.cpp ]
154 [ run sequence/vector_misc.cpp ]
155 [ run sequence/vector_move.cpp ]
156 [ run sequence/vector_mutate.cpp ]
157 [ run sequence/vector_n.cpp ]
158 [ run sequence/vector_nest.cpp ]
159 [ run sequence/vector_hash.cpp ]
160 [ run sequence/vector_tie.cpp ]
161 [ run sequence/vector_traits.cpp : :
162 :
163 : vector_traits__maybe_variadic ]
164 [ run sequence/vector_traits.cpp : :
165 : <define>BOOST_FUSION_DISABLE_VARIADIC_VECTOR
166 : vector_traits__no_variadic ]
167 [ run sequence/vector_value_at.cpp ]
168 [ run sequence/zip_view.cpp ]
169 [ run sequence/zip_view2.cpp ]
170 [ run sequence/zip_view_ignore.cpp ]
171 [ run sequence/repetitive_view.cpp ]
172 [ run sequence/deduce_sequence.cpp ]
173 [ run sequence/adapt_adt_named.cpp ]
174 [ run sequence/adapt_adt_named_empty.cpp ]
175 [ run sequence/adapt_adt.cpp ]
176 [ run sequence/adapt_adt_empty.cpp ]
177 [ run sequence/adapt_assoc_adt_named.cpp ]
178 [ run sequence/adapt_assoc_adt_named_empty.cpp ]
179 [ run sequence/adapt_assoc_adt.cpp ]
180 [ run sequence/adapt_assoc_adt_empty.cpp ]
181 [ run sequence/adapt_assoc_struct_named.cpp ]
182 [ run sequence/adapt_assoc_struct_named_empty.cpp ]
183 [ run sequence/adapt_assoc_struct.cpp ]
184 [ run sequence/adapt_assoc_struct_empty.cpp ]
185 [ run sequence/adapt_assoc_tpl_adt.cpp ]
186 [ run sequence/adapt_assoc_tpl_adt_empty.cpp ]
187 [ run sequence/adapt_assoc_tpl_struct.cpp ]
188 [ run sequence/adapt_assoc_tpl_struct_empty.cpp ]
189 [ run sequence/adapt_struct_named.cpp ]
190 [ run sequence/adapt_struct_named_empty.cpp ]
191 [ run sequence/adapt_struct.cpp ]
192 [ run sequence/adapt_struct_empty.cpp ]
193 [ run sequence/adapt_tpl_adt.cpp ]
194 [ run sequence/adapt_tpl_adt_empty.cpp ]
195 [ run sequence/adapt_tpl_struct.cpp ]
196 [ run sequence/adapt_tpl_struct_empty.cpp ]
197 [ run sequence/adt_attribute_proxy.cpp ]
198 [ run sequence/define_struct.cpp ]
199 [ run sequence/define_struct_empty.cpp ]
200 [ run sequence/define_struct_move.cpp ]
201 [ run sequence/define_struct_inline.cpp ]
202 [ run sequence/define_struct_inline_empty.cpp ]
203 [ run sequence/define_struct_inline_move.cpp ]
204 [ run sequence/define_assoc_struct.cpp ]
205 [ run sequence/define_assoc_struct_empty.cpp ]
206 [ run sequence/define_assoc_struct_move.cpp ]
207 [ run sequence/define_tpl_struct.cpp ]
208 [ run sequence/define_tpl_struct_empty.cpp ]
209 [ run sequence/define_tpl_struct_move.cpp ]
210 [ run sequence/define_tpl_struct_inline.cpp ]
211 [ run sequence/define_tpl_struct_inline_empty.cpp ]
212 [ run sequence/define_tpl_struct_inline_move.cpp ]
213 [ run sequence/define_assoc_tpl_struct.cpp ]
214 [ run sequence/define_assoc_tpl_struct_empty.cpp ]
215 [ run sequence/define_assoc_tpl_struct_move.cpp ]
216 [ run sequence/std_tuple.cpp : :
217 : [ requires cxx11_variadic_templates cxx11_hdr_tuple ] ]
218 [ run sequence/std_tuple_iterator.cpp : :
219 : [ requires cxx11_variadic_templates cxx11_hdr_tuple ] ]
220 [ run sequence/ref_vector.cpp ]
221 [ run sequence/flatten_view.cpp ]
222 [ compile sequence/github-159.cpp ]
223
224 [ compile sequence/size.cpp ]
225
226 [ run functional/fused.cpp ]
227 [ run functional/fused_function_object.cpp ]
228 [ run functional/fused_procedure.cpp ]
229 [ run functional/unfused.cpp ]
230 [ run functional/unfused_typed.cpp ]
231 [ run functional/make_fused.cpp ]
232 [ run functional/make_fused_function_object.cpp ]
233 [ run functional/make_fused_procedure.cpp ]
234 [ run functional/make_unfused.cpp ]
235 [ run functional/invoke.cpp ]
236 [ run functional/invoke_function_object.cpp ]
237 [ run functional/invoke_procedure.cpp ]
238 [ run sequence/swap.cpp ]
239
240 [ compile support/pair_deque.cpp ]
241 [ compile support/pair_list.cpp ]
242 [ compile support/pair_map.cpp ]
243 [ compile support/pair_set.cpp ]
244 [ compile support/pair_vector.cpp ]
245 [ compile support/pair_nest.cpp ]
246 [ compile support/index_sequence.cpp ]
247 [ compile support/and.cpp ]
248
249 # [ compile-fail xxx.cpp ]
250
251 ;
252 }