| /third_party/boost/libs/range/test/algorithm_test/ |
| D | includes.cpp | 26 void test(Container1& cont1, Container2& cont2) in test() argument
28 Container1 old_cont1(cont1); in test()
32 = std::includes(cont1.begin(), cont1.end(), in test()
35 bool test_result = boost::includes(cont1, cont2); in test()
41 cont1.begin(), cont1.end() in test()
49 BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), cont2) ); in test()
50 BOOST_CHECK( test_result == boost::includes(cont1, boost::make_iterator_range(cont2)) ); in test()
51 …BOOST_CHECK( test_result == boost::includes(boost::make_iterator_range(cont1), boost::make_iterato… in test()
67 void test_pred(Container1 cont1, Container2 cont2, in test_pred() argument
70 sort_container(cont1, pred); in test_pred()
[all …]
|
| D | equal.cpp | 37 Container1& cont1 = mcont1; in test_equal_impl() local
40 BOOST_CHECK( boost::equal(cont1, cont2) ); in test_equal_impl()
41 BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2) ); in test_equal_impl()
42 BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2)) ); in test_equal_impl()
43 … BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2)) ); in test_equal_impl()
44 BOOST_CHECK( boost::equal(cont1, cont2, std::equal_to<int>()) ); in test_equal_impl()
45 … BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), cont2, std::equal_to<int>()) ); in test_equal_impl()
46 … BOOST_CHECK( boost::equal(cont1, boost::make_iterator_range(cont2), std::equal_to<int>()) ); in test_equal_impl()
47 …BOOST_CHECK( boost::equal(boost::make_iterator_range(cont1), boost::make_iterator_range(cont2), st… in test_equal_impl()
48 BOOST_CHECK( boost::equal(cont1, cont2, std::not_equal_to<int>()) ); in test_equal_impl()
[all …]
|
| D | search_n.cpp | 105 void test_search_n_pred_impl(Container1& cont1, Value value, Pred pred) in test_search_n_pred_impl() argument
110 const Container1& ccont1 = cont1; in test_search_n_pred_impl()
112 for (std::size_t n = 0; n < cont1.size(); ++n) in test_search_n_pred_impl()
114 iterator1_t it = boost::search_n(cont1, n, value, pred); in test_search_n_pred_impl()
115 BOOST_CHECK( it == boost::search_n(boost::make_iterator_range(cont1), n, value, pred) ); in test_search_n_pred_impl()
116 BOOST_CHECK( it == reference_search_n(cont1.begin(), cont1.end(), n, value, pred) ); in test_search_n_pred_impl()
125 void test_search_n_impl(Container1& cont1, Value value) in test_search_n_impl() argument
130 const Container1& ccont1 = cont1; in test_search_n_impl()
132 for (std::size_t n = 0; n < cont1.size(); ++n) in test_search_n_impl()
134 iterator1_t it = boost::search_n(cont1, n, value); in test_search_n_impl()
[all …]
|
| D | set_intersection.cpp | 46 void test(Container1& cont1, Container2& cont2) in test() argument
51 std::vector<value_t> reference(cont1.size() + cont2.size()); in test()
55 = std::set_intersection(cont1.begin(), cont1.end(), in test()
60 = boost::set_intersection(cont1, cont2, test_cont.begin()); in test()
66 boost::make_iterator_range(cont1), cont2, in test()
73 cont1, boost::make_iterator_range(cont2), in test()
80 boost::make_iterator_range(cont1), in test()
101 void test_pred(Container1 cont1, Container2 cont2, in test_pred() argument
107 sort_container(cont1, pred); in test_pred()
110 std::vector<value_t> reference(cont1.size() + cont2.size()); in test_pred()
[all …]
|
| D | set_union.cpp | 46 void test(Container1& cont1, Container2& cont2) in test() argument
51 std::vector<value_t> reference(cont1.size() + cont2.size()); in test()
55 = std::set_union(cont1.begin(), cont1.end(), in test()
60 = boost::set_union(cont1, cont2, test_cont.begin()); in test()
65 test_result = boost::set_union(boost::make_iterator_range(cont1), in test()
71 test_result = boost::set_union(cont1, in test()
78 test_result = boost::set_union(boost::make_iterator_range(cont1), in test()
99 void test_pred(Container1 cont1, Container2 cont2, in test_pred() argument
105 sort_container(cont1, pred); in test_pred()
108 std::vector<value_t> reference(cont1.size() + cont2.size()); in test_pred()
[all …]
|
| D | set_difference.cpp | 46 void test(Container1& cont1, Container2& cont2) in test() argument
51 std::vector<value_t> reference(cont1.size() + cont2.size()); in test()
55 = std::set_difference(cont1.begin(), cont1.end(), in test()
60 = boost::set_difference(cont1, cont2, test_cont.begin()); in test()
66 boost::make_iterator_range(cont1), cont2, in test()
73 cont1, boost::make_iterator_range(cont2), in test()
80 boost::make_iterator_range(cont1), in test()
101 void test_pred(Container1 cont1, Container2 cont2, in test_pred() argument
107 sort_container(cont1, pred); in test_pred()
110 std::vector<value_t> reference(cont1.size() + cont2.size()); in test_pred()
[all …]
|
| D | set_symmetric_difference.cpp | 46 void test(Container1& cont1, Container2& cont2) in test() argument
51 std::vector<value_t> reference(cont1.size() + cont2.size()); in test()
55 = std::set_symmetric_difference(cont1.begin(), cont1.end(), in test()
60 = boost::set_symmetric_difference(cont1, cont2, in test()
67 boost::make_iterator_range(cont1), cont2, in test()
74 cont1, boost::make_iterator_range(cont2), in test()
81 boost::make_iterator_range(cont1), in test()
102 void test_pred(Container1 cont1, Container2 cont2, in test_pred() argument
108 sort_container(cont1, pred); in test_pred()
111 std::vector<value_t> reference(cont1.size() + cont2.size()); in test_pred()
[all …]
|
| D | mismatch.cpp | 27 void eval_mismatch(Container1& cont1, in eval_mismatch() argument
37 result_pair_t result = boost::mismatch(cont1, cont2); in eval_mismatch()
41 result = boost::mismatch(boost::make_iterator_range(cont1), in eval_mismatch()
46 result = boost::mismatch(cont1, in eval_mismatch()
51 result = boost::mismatch(boost::make_iterator_range(cont1), in eval_mismatch()
58 void eval_mismatch(Container1& cont1, in eval_mismatch() argument
69 result_pair_t result = boost::mismatch(cont1, cont2, pred); in eval_mismatch()
73 result = boost::mismatch(boost::make_iterator_range(cont1), in eval_mismatch()
78 result = boost::mismatch(cont1, in eval_mismatch()
83 result = boost::mismatch(boost::make_iterator_range(cont1), in eval_mismatch()
[all …]
|
| D | inplace_merge.cpp | 27 void test(Container1& cont1, Container2& cont2) in test() argument
34 std::vector<value_t> reference_target(cont1.begin(), cont1.end()); in test()
42 reference_target.begin() + cont1.size(), in test()
46 test_target.begin() + cont1.size()); in test()
54 test_target2.begin() + cont1.size()); in test()
75 void test_pred(Container1 cont1, Container2 cont2, BinaryPredicate pred) in test_pred() argument
81 sort_container(cont1, pred); in test_pred()
84 std::vector<value_t> reference_target(cont1.begin(), cont1.end()); in test_pred()
92 reference_target.begin() + cont1.size(), in test_pred()
96 test_target.begin() + cont1.size(), in test_pred()
[all …]
|
| D | search.cpp | 27 void test_search_impl(Container1& cont1, Container2& cont2) in test_search_impl() argument
32 const Container1& ccont1 = cont1; in test_search_impl()
35 iterator1_t it = boost::search(cont1, cont2); in test_search_impl()
36 BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1), cont2) ); in test_search_impl()
37 BOOST_CHECK( it == boost::search(cont1, boost::make_iterator_range(cont2)) ); in test_search_impl()
38 BOOST_CHECK( it == boost::search(boost::make_iterator_range(cont1), in test_search_impl()
40 iterator1_t it2 = boost::search(cont1, ccont2); in test_search_impl()
41 BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1), ccont2) ); in test_search_impl()
42 BOOST_CHECK( it2 == boost::search(cont1, boost::make_iterator_range(ccont2)) ); in test_search_impl()
43 BOOST_CHECK( it2 == boost::search(boost::make_iterator_range(cont1), in test_search_impl()
[all …]
|
| D | merge.cpp | 27 void test(Container1& cont1, Container2& cont2) in test() argument
32 std::vector<value_t> reference_target( cont1.size() + cont2.size() ); in test()
35 = std::merge(cont1.begin(), cont1.end(), in test()
39 std::vector<value_t> test_target( cont1.size() + cont2.size() ); in test()
42 = boost::merge(cont1, cont2, test_target.begin()); in test()
54 test_it = boost::merge(boost::make_iterator_range(cont1), in test()
67 test_it = boost::merge(cont1, boost::make_iterator_range(cont2), in test()
80 test_it = boost::merge(boost::make_iterator_range(cont1), in test()
108 void test_pred(Container1 cont1, Container2 cont2, BinaryPredicate pred) in test_pred() argument
113 sort_container(cont1, pred); in test_pred()
[all …]
|
| D | lexicographical_compare.cpp | 63 void test_lexicographical_compare_impl(Container1& cont1, in test_lexicographical_compare_impl() argument
68 test_lexicographical_compare_impl_nopred(cont1, cont2); in test_lexicographical_compare_impl()
69 test_lexicographical_compare_impl_pred(cont1, cont2, std::less<value_t>()); in test_lexicographical_compare_impl()
70 test_lexicographical_compare_impl_pred(cont1, cont2, std::greater<value_t>()); in test_lexicographical_compare_impl()
81 container1_t cont1; in test_lexicographical_compare_impl() local
83 test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2); in test_lexicographical_compare_impl()
85 cont1.clear(); in test_lexicographical_compare_impl()
87 cont1.push_back(1); in test_lexicographical_compare_impl()
89 test_lexicographical_compare_impl<Container1,Container2>(cont1, cont2); in test_lexicographical_compare_impl()
91 cont1.clear(); in test_lexicographical_compare_impl()
[all …]
|
| D | transform.cpp | 88 void test_transform_impl2(Container1& cont1, Container2& cont2) in test_transform_impl2() argument
90 const Container1& ccont1 = cont1; in test_transform_impl2()
93 BOOST_CHECK_EQUAL( cont1.size(), cont2.size() ); in test_transform_impl2()
97 std::vector<value_t> target(cont1.size()); in test_transform_impl2()
98 std::vector<value_t> reference(cont1.size()); in test_transform_impl2()
104 = std::transform(cont1.begin(), cont1.end(), in test_transform_impl2()
110 = boost::transform(cont1, cont2, target.begin(), fn); in test_transform_impl2()
116 …BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(cont1), cont2, target.begin(),… in test_transform_impl2()
120 …BOOST_CHECK( test_it == boost::transform(cont1, boost::make_iterator_range(cont2), target.begin(),… in test_transform_impl2()
124 BOOST_CHECK( test_it == boost::transform(boost::make_iterator_range(cont1), in test_transform_impl2()
[all …]
|
| D | find_first_of.cpp | 134 void run_tests(Container1& cont1, Container2& cont2) in run_tests() argument
137 test_driver(cont1, find_first_of_test_policy<Container2>(cont2)); in run_tests()
138 test_driver(cont1, find_first_of_pred_test_policy<Container2, std::less<int> >(cont2)); in run_tests()
151 Container1& cont1 = mcont1; in test_find_first_of_impl() local
155 run_tests(cont1, cont2); in test_find_first_of_impl()
158 run_tests(cont1, cont2); in test_find_first_of_impl()
161 run_tests(cont1, cont2); in test_find_first_of_impl()
165 run_tests(cont1, cont2); in test_find_first_of_impl()
169 run_tests(cont1, cont2); in test_find_first_of_impl()
|
| D | find_end.cpp | 136 void run_tests(Container1& cont1, Container2& cont2) in run_tests() argument
139 test_driver(cont1, find_end_test_policy<Container2>(cont2)); in run_tests()
140 test_driver(cont1, find_end_pred_test_policy<Container2, std::less<int> >(cont2)); in run_tests()
153 Container1& cont1 = mcont1; in test_find_end_impl() local
157 run_tests(cont1, cont2); in test_find_end_impl()
160 run_tests(cont1, cont2); in test_find_end_impl()
163 run_tests(cont1, cont2); in test_find_end_impl()
167 run_tests(cont1, cont2); in test_find_end_impl()
171 run_tests(cont1, cont2); in test_find_end_impl()
|
| D | heap.cpp | 27 void check_equal(const Container1& cont1, const Container2& cont2) in check_equal() argument
30 cont1.begin(), cont1.end(), in check_equal()
|
| /third_party/boost/boost/multi_index/detail/ |
| D | safe_mode.hpp | 103 #define BOOST_MULTI_INDEX_CHECK_DIFFERENT_CONTAINER(cont0,cont1) \ argument
105 safe_mode::check_different_container(cont0,cont1), \
108 #define BOOST_MULTI_INDEX_CHECK_EQUAL_ALLOCATORS(cont0,cont1) \ argument
110 safe_mode::check_equal_allocators(cont0,cont1), \
231 const Container& cont0,const Container& cont1) in check_different_container() argument
233 return &cont0!=&cont1; in check_different_container()
238 const Container0& cont0,const Container1& cont1) in check_equal_allocators() argument
240 return cont0.get_allocator()==cont1.get_allocator(); in check_equal_allocators()
|