1 // -*- C++ -*- 2 //===-- inplace_merge.pass.cpp --------------------------------------------===// 3 // 4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5 // See https://llvm.org/LICENSE.txt for license information. 6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "support/pstl_test_config.h" 11 12 #include <execution> 13 #include <algorithm> 14 15 #include "support/utils.h" 16 17 using namespace TestUtils; 18 19 struct test_one_policy 20 { 21 #if _PSTL_ICC_17_VC141_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN || \ 22 _PSTL_ICC_16_VC14_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN // dummy specialization by policy type, in case of broken configuration 23 template <typename BiDirIt1, typename Size, typename Generator1, typename Generator2, typename Compare> 24 void 25 operator()(pstl::execution::unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, 26 Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) 27 { 28 } 29 30 template <typename BiDirIt1, typename Size, typename Generator1, typename Generator2, typename Compare> 31 void 32 operator()(pstl::execution::parallel_unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, 33 BiDirIt1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) 34 { 35 } 36 #endif 37 38 // inplace_merge works with bidirectional iterators at least 39 template <typename Policy, typename BiDirIt1, typename Size, typename Generator1, typename Generator2, 40 typename Compare> 41 typename std::enable_if<!is_same_iterator_category<BiDirIt1, std::forward_iterator_tag>::value, void>::type 42 operator()(Policy&& exec, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, Size n, Size m, 43 Generator1 generator1, Generator2 generator2, Compare comp) 44 { 45 const BiDirIt1 mid1 = std::next(first1, m); 46 fill_data(first1, mid1, generator1); 47 fill_data(mid1, last1, generator2); 48 49 const BiDirIt1 mid2 = std::next(first2, m); 50 fill_data(first2, mid2, generator1); 51 fill_data(mid2, last2, generator2); 52 53 std::inplace_merge(first1, mid1, last1, comp); 54 std::inplace_merge(exec, first2, mid2, last2, comp); 55 EXPECT_EQ_N(first1, first2, n, "wrong effect from inplace_merge with predicate"); 56 } 57 58 template <typename Policy, typename BiDirIt1, typename Size, typename Generator1, typename Generator2, 59 typename Compare> 60 typename std::enable_if<is_same_iterator_category<BiDirIt1, std::forward_iterator_tag>::value, void>::type 61 operator()(Policy&&, BiDirIt1, BiDirIt1, BiDirIt1, BiDirIt1, Size, Size, 62 Generator1, Generator2, Compare) 63 { 64 } 65 }; 66 67 template <typename T, typename Generator1, typename Generator2, typename Compare> 68 void 69 test_by_type(Generator1 generator1, Generator2 generator2, Compare comp) 70 { 71 using namespace std; 72 size_t max_size = 100000; 73 Sequence<T> in1(max_size, [](size_t v) { return T(v); }); 74 Sequence<T> exp(max_size, [](size_t v) { return T(v); }); 75 size_t m; 76 77 for (size_t n = 0; n <= max_size; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) 78 { 79 m = 0; 80 invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n, exp.begin(), exp.begin() + n, n, m, 81 generator1, generator2, comp); 82 83 m = n / 3; 84 invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n, exp.begin(), exp.begin() + n, n, m, 85 generator1, generator2, comp); 86 87 m = 2 * n / 3; 88 invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n, exp.begin(), exp.begin() + n, n, m, 89 generator1, generator2, comp); 90 } 91 } 92 93 template <typename T> 94 struct LocalWrapper 95 { 96 explicit LocalWrapper(int32_t k) : my_val(k) {} 97 LocalWrapper(LocalWrapper&& input) { my_val = std::move(input.my_val); } 98 LocalWrapper& 99 operator=(LocalWrapper&& input) 100 { 101 my_val = std::move(input.my_val); 102 return *this; 103 } 104 bool 105 operator<(const LocalWrapper<T>& w) const 106 { 107 return my_val < w.my_val; 108 } 109 friend bool 110 operator==(const LocalWrapper<T>& x, const LocalWrapper<T>& y) 111 { 112 return x.my_val == y.my_val; 113 } 114 friend std::ostream& 115 operator<<(std::ostream& stream, const LocalWrapper<T>& input) 116 { 117 return stream << input.my_val; 118 } 119 120 private: 121 T my_val; 122 }; 123 124 template <typename T> 125 struct test_non_const 126 { 127 template <typename Policy, typename Iterator> 128 void 129 operator()(Policy&& exec, Iterator iter) 130 { 131 invoke_if(exec, [&]() { inplace_merge(exec, iter, iter, iter, non_const(std::less<T>())); }); 132 } 133 }; 134 135 int32_t 136 main() 137 { 138 test_by_type<float64_t>([](int32_t i) { return -2 * i; }, [](int32_t i) { return -(2 * i + 1); }, 139 [](const float64_t x, const float64_t y) { return x > y; }); 140 141 test_by_type<int32_t>([](int32_t i) { return 10 * i; }, [](int32_t i) { return i + 1; }, std::less<int32_t>()); 142 143 test_by_type<LocalWrapper<float32_t>>([](int32_t i) { return LocalWrapper<float32_t>(2 * i + 1); }, 144 [](int32_t i) { return LocalWrapper<float32_t>(2 * i); }, 145 std::less<LocalWrapper<float32_t>>()); 146 147 test_algo_basic_single<int32_t>(run_for_rnd_bi<test_non_const<int32_t>>()); 148 149 std::cout << done() << std::endl; 150 return 0; 151 } 152