]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/mp11/test/Jamfile
update sources to v12.2.3
[ceph.git] / ceph / src / boost / libs / mp11 / test / Jamfile
1 # Boost.Mp11 Library Test Jamfile
2 #
3 # Copyright 2015-2017 Peter Dimov
4 #
5 # Distributed under the Boost Software License, Version 1.0.
6 # See accompanying file LICENSE_1_0.txt or copy at
7 # http://www.boost.org/LICENSE_1_0.txt
8
9 import testing ;
10 import ../../config/checks/config : requires ;
11
12 project : requirements [ requires cxx11_variadic_templates cxx11_template_aliases cxx11_decltype cxx11_hdr_tuple ] ;
13
14 # include-only
15 compile mp11.cpp ;
16
17 # list
18 run mp_size.cpp ;
19 run mp_empty.cpp ;
20 run mp_front.cpp ;
21 run mp_pop_front.cpp ;
22 run mp_second.cpp ;
23 run mp_third.cpp ;
24 run mp_push_front.cpp ;
25 run mp_push_back.cpp ;
26 run mp_rename.cpp ;
27 run mp_append.cpp ;
28 run mp_append_2.cpp ;
29 run mp_replace_front.cpp ;
30 run mp_replace_second.cpp ;
31 run mp_replace_third.cpp ;
32 run mp_apply_q.cpp ;
33 run mp_is_list.cpp ;
34 run mp_list_c.cpp ;
35
36 # algorithm
37 run mp_assign.cpp ;
38 run mp_clear.cpp ;
39 run mp_transform.cpp ;
40 run mp_transform_q.cpp ;
41 run mp_transform_sf.cpp ;
42 run mp_transform_if.cpp ;
43 run mp_transform_if_q.cpp ;
44 run mp_fill.cpp ;
45 run mp_count.cpp ;
46 run mp_count_if.cpp ;
47 run mp_count_if_q.cpp ;
48 run mp_contains.cpp ;
49 run mp_repeat.cpp ;
50 run mp_product.cpp ;
51 run mp_drop.cpp ;
52 run mp_iota.cpp ;
53 run mp_at.cpp ;
54 run mp_at_sf.cpp ;
55 run mp_take.cpp ;
56 run mp_replace.cpp ;
57 run mp_replace_if.cpp ;
58 run mp_replace_if_q.cpp ;
59 run mp_copy_if.cpp ;
60 run mp_copy_if_q.cpp ;
61 run mp_remove.cpp ;
62 run mp_remove_if.cpp ;
63 run mp_remove_if_q.cpp ;
64 run mp_partition.cpp ;
65 run mp_partition_q.cpp ;
66 run mp_sort.cpp ;
67 run mp_sort_q.cpp ;
68 run mp_find.cpp ;
69 run mp_find_if.cpp ;
70 run mp_find_if_q.cpp ;
71 run mp_reverse.cpp ;
72 run mp_fold.cpp ;
73 run mp_fold_q.cpp ;
74 run mp_reverse_fold.cpp ;
75 run mp_reverse_fold_q.cpp ;
76 run mp_unique.cpp ;
77 run mp_all_of.cpp ;
78 run mp_all_of_q.cpp ;
79 run mp_any_of.cpp ;
80 run mp_any_of_q.cpp ;
81 run mp_none_of.cpp ;
82 run mp_none_of_q.cpp ;
83 run mp_replace_at.cpp ;
84 run mp_replace_at_c.cpp ;
85 run mp_for_each.cpp ;
86 run mp_insert.cpp ;
87 run mp_erase.cpp ;
88 run mp_with_index.cpp ;
89 run mp_with_index_cx.cpp ;
90 run mp_from_sequence.cpp ;
91 run mp_min_element.cpp ;
92 run mp_min_element_q.cpp ;
93 run mp_max_element.cpp ;
94 run mp_max_element_q.cpp ;
95 run mp_nth_element.cpp ;
96 run mp_nth_element_q.cpp ;
97
98 # integral
99 run integral.cpp ;
100
101 # utility
102 run mp_identity.cpp ;
103 run mp_inherit.cpp ;
104 run mp_if.cpp ;
105 run mp_if_sf.cpp ;
106 run mp_eval_if.cpp ;
107 run mp_eval_if_sf.cpp ;
108 run mp_valid.cpp ;
109 run mp_defer.cpp ;
110 run mp_quote.cpp ;
111 run mp_invoke.cpp ;
112 run mp_invoke_sf.cpp ;
113 run mp_quote_trait.cpp ;
114 run mp_cond.cpp ;
115 run mp_cond_sf.cpp ;
116
117 # integer_sequence
118 run integer_sequence.cpp ;
119
120 # tuple
121 run tuple_for_each.cpp ;
122 compile tuple_for_each_cx.cpp ;
123 run tuple_apply.cpp ;
124 compile tuple_apply_cx.cpp ;
125 run construct_from_tuple.cpp ;
126 compile construct_from_tuple_cx.cpp ;
127
128 # set
129 run mp_set_contains.cpp ;
130 run mp_set_push_back.cpp ;
131 run mp_set_push_front.cpp ;
132 run mp_is_set.cpp ;
133
134 # function
135 run mp_all.cpp ;
136 run mp_and.cpp ;
137 run mp_any.cpp ;
138 run mp_or.cpp ;
139 run mp_same.cpp ;
140 run mp_plus.cpp ;
141 run mp_less.cpp ;
142 run mp_min.cpp ;
143 run mp_max.cpp ;
144
145 # map
146 run mp_map_find.cpp ;
147 run mp_map_contains.cpp ;
148 run mp_map_insert.cpp ;
149 run mp_map_replace.cpp ;
150 run mp_map_erase.cpp ;
151 run mp_map_update.cpp ;
152 run mp_map_update_q.cpp ;
153 run mp_map_keys.cpp ;
154 run mp_is_map.cpp ;
155
156 # bind
157 run mp_bind.cpp ;
158 run mp_bind_q.cpp ;
159 run mp_bind_front.cpp ;
160 run mp_bind_back.cpp ;
161
162 # mpl
163 run mpl.cpp ;
164
165 # quick (for CI)
166 alias quick : mp11 mp_size ;
167 explicit quick ;