1 // -*- C++ -*- 2 //===-- replace_copy.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 // Tests for replace_copy and replace_copy_if 11 12 #include "support/pstl_test_config.h" 13 14 #include <execution> 15 #include <algorithm> 16 17 #include "support/utils.h" 18 19 using namespace TestUtils; 20 21 struct test_replace_copy 22 { 23 template <typename Policy, typename InputIterator, typename OutputIterator, typename OutputIterator2, typename Size, 24 typename Predicate, typename T> 25 void 26 operator()(Policy&& exec, InputIterator first, InputIterator last, OutputIterator out_first, 27 OutputIterator out_last, OutputIterator2 expected_first, OutputIterator2, Size n, 28 Predicate pred, const T& old_value, const T& new_value, T trash) 29 { 30 // Cleaning 31 std::fill_n(expected_first, n, trash); 32 std::fill_n(out_first, n, trash); 33 // Run replace_copy 34 auto i = std::replace_copy(first, last, expected_first, old_value, new_value); 35 auto k = std::replace_copy(exec, first, last, out_first, old_value, new_value); 36 EXPECT_EQ_N(expected_first, out_first, n, "wrong replace_copy effect"); 37 EXPECT_TRUE(out_last == k, "wrong return value from replace_copy"); 38 39 // Cleaning 40 std::fill_n(expected_first, n, trash); 41 std::fill_n(out_first, n, trash); 42 // Run replace_copy_if 43 i = replace_copy_if(first, last, expected_first, pred, new_value); 44 k = replace_copy_if(exec, first, last, out_first, pred, new_value); 45 EXPECT_EQ_N(expected_first, out_first, n, "wrong replace_copy_if effect"); 46 EXPECT_TRUE(out_last == k, "wrong return value from replace_copy_if"); 47 } 48 }; 49 50 template <typename T, typename Convert, typename Predicate> 51 void 52 test(T trash, const T& old_value, const T& new_value, Predicate pred, Convert convert) 53 { 54 // Try sequences of various lengths. 55 for (size_t n = 0; n <= 100000; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) 56 { 57 Sequence<T> in(n, [&](size_t k) -> T { return convert(n ^ k); }); 58 Sequence<T> out(n, [=](size_t) { return trash; }); 59 Sequence<T> expected(n, [=](size_t) { return trash; }); 60 61 invoke_on_all_policies(test_replace_copy(), in.begin(), in.end(), out.begin(), out.end(), expected.begin(), 62 expected.end(), out.size(), pred, old_value, new_value, trash); 63 invoke_on_all_policies(test_replace_copy(), in.cbegin(), in.cend(), out.begin(), out.end(), expected.begin(), 64 expected.end(), out.size(), pred, old_value, new_value, trash); 65 } 66 } 67 68 template <typename T> 69 struct test_non_const 70 { 71 template <typename Policy, typename InputIterator, typename OutputInterator> 72 void 73 operator()(Policy&& exec, InputIterator input_iter, OutputInterator out_iter) 74 { 75 auto is_even = [&](float64_t v) { 76 uint32_t i = (uint32_t)v; 77 return i % 2 == 0; 78 }; 79 80 invoke_if(exec, [&]() { replace_copy_if(exec, input_iter, input_iter, out_iter, non_const(is_even), T(0)); }); 81 } 82 }; 83 84 int32_t 85 main() 86 { 87 88 test<float64_t>(-666.0, 8.5, 0.33, [](const float64_t& x) { return x * x <= 1024; }, 89 [](size_t j) { return ((j + 1) % 7 & 2) != 0 ? 8.5 : float64_t(j % 32 + j); }); 90 91 test<int32_t>(-666, 42, 99, [](const int32_t& x) { return x != 42; }, 92 [](size_t j) { return ((j + 1) % 5 & 2) != 0 ? 42 : -1 - int32_t(j); }); 93 94 #if !_PSTL_ICC_17_TEST_MAC_RELEASE_32_BROKEN 95 test<Number>(Number(42, OddTag()), Number(2001, OddTag()), Number(2017, OddTag()), IsMultiple(3, OddTag()), 96 [](int32_t j) { return ((j + 1) % 3 & 2) != 0 ? Number(2001, OddTag()) : Number(j, OddTag()); }); 97 #endif 98 99 test_algo_basic_double<int32_t>(run_for_rnd_fw<test_non_const<int32_t>>()); 100 101 std::cout << done() << std::endl; 102 return 0; 103 } 104