// -*- C++ -*- //===-- test_reverse_copy.cpp ---------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #include "pstl_test_config.h" #include #include "pstl/execution" #include "pstl/algorithm" #include "utils.h" using namespace TestUtils; template struct wrapper { T t; wrapper() {} explicit wrapper(T t_) : t(t_) {} wrapper& operator=(const T& t_) { t = t_; return *this; } bool operator==(const wrapper& t_) const { return t == t_.t; } }; template bool eq(const wrapper& a, const wrapper& b) { return a.t == b.t; } template bool eq(const T1& a, const T2& b) { return a == b; } // we need to save state here, because we need to test with different types of iterators // due to the caller invoke_on_all_policies does forcing modification passed iterator type to cover additional usage cases. template struct test_one_policy { Iterator data_b; Iterator data_e; test_one_policy(Iterator b, Iterator e) : data_b(b), data_e(e) {} #if __PSTL_ICC_17_VC141_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN || \ __PSTL_ICC_16_VC14_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN // dummy specialization by policy type, in case of broken configuration template typename std::enable_if::value, void>::type operator()(pstl::execution::unsequenced_policy, Iterator1 actual_b, Iterator1 actual_e) { } template typename std::enable_if::value, void>::type operator()(pstl::execution::parallel_unsequenced_policy, Iterator1 actual_b, Iterator1 actual_e) { } #endif template void operator()(ExecutionPolicy&& exec, Iterator1 actual_b, Iterator1 actual_e) { using namespace std; using T = typename iterator_traits::value_type; using DifferenceType = typename iterator_traits::difference_type; fill(actual_b, actual_e, T(-123)); Iterator1 actual_return = reverse_copy(exec, data_b, data_e, actual_b); EXPECT_TRUE(actual_return == actual_e, "wrong result of reverse_copy"); const auto n = std::distance(data_b, data_e); Sequence res(n); std::copy(std::reverse_iterator(data_e), std::reverse_iterator(data_b), res.begin()); EXPECT_EQ_N(res.begin(), actual_b, n, "wrong effect of reverse_copy"); } }; template void test() { typedef typename Sequence::iterator iterator_type; typedef typename Sequence::const_bidirectional_iterator cbi_iterator_type; const std::size_t max_len = 100000; Sequence actual(max_len); Sequence data(max_len, [](std::size_t i) { return T1(i); }); for (std::size_t len = 0; len < max_len; len = len <= 16 ? len + 1 : std::size_t(3.1415 * len)) { invoke_on_all_policies(test_one_policy(data.begin(), data.begin() + len), actual.begin(), actual.begin() + len); invoke_on_all_policies(test_one_policy(data.cbibegin(), std::next(data.cbibegin(), len)), actual.begin(), actual.begin() + len); } } int32_t main() { // clang-3.8 fails to correctly auto vectorize the loop in some cases of different types of container's elements, // for example: int32_t and int8_t. This issue isn't detected for clang-3.9 and newer versions. test(); test(); test(); test, wrapper>(); std::cout << done() << std::endl; return 0; }