1 // -*- C++ -*- 2 //===-- find_if.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 find_if and find_if_not 11 #include "support/pstl_test_config.h" 12 13 #include <execution> 14 #include <algorithm> 15 16 #include "support/utils.h" 17 18 using namespace TestUtils; 19 20 struct test_find_if 21 { 22 #if _PSTL_ICC_17_VC141_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN || \ 23 _PSTL_ICC_16_VC14_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN //dummy specialization by policy type, in case of broken configuration 24 template <typename Iterator, typename Predicate, typename NotPredicate> 25 void 26 operator()(pstl::execution::unsequenced_policy, Iterator first, Iterator last, Predicate pred, 27 NotPredicate not_pred) 28 { 29 } 30 template <typename Iterator, typename Predicate, typename NotPredicate> 31 void 32 operator()(pstl::execution::parallel_unsequenced_policy, Iterator first, Iterator last, Predicate pred, 33 NotPredicate not_pred) 34 { 35 } 36 #endif 37 38 template <typename Policy, typename Iterator, typename Predicate, typename NotPredicate> 39 void 40 operator()(Policy&& exec, Iterator first, Iterator last, Predicate pred, NotPredicate not_pred) 41 { 42 auto i = std::find_if(first, last, pred); 43 auto j = find_if(exec, first, last, pred); 44 EXPECT_TRUE(i == j, "wrong return value from find_if"); 45 auto i_not = find_if_not(exec, first, last, not_pred); 46 EXPECT_TRUE(i_not == i, "wrong return value from find_if_not"); 47 } 48 }; 49 50 template <typename T, typename Predicate, typename Hit, typename Miss> 51 void 52 test(Predicate pred, Hit hit, Miss miss) 53 { 54 auto not_pred = [pred](T x) { return !pred(x); }; 55 // Try sequences of various lengths. 56 for (size_t n = 0; n <= 100000; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) 57 { 58 Sequence<T> in(n, [&](size_t k) -> T { return miss(n ^ k); }); 59 // Try different find positions, including not found. 60 // By going backwards, we can add extra matches that are *not* supposed to be found. 61 // The decreasing exponential gives us O(n) total work for the loop since each find takes O(m) time. 62 for (size_t m = n; m > 0; m *= 0.6) 63 { 64 if (m < n) 65 in[m] = hit(n ^ m); 66 invoke_on_all_policies(test_find_if(), in.begin(), in.end(), pred, not_pred); 67 invoke_on_all_policies(test_find_if(), in.cbegin(), in.cend(), pred, not_pred); 68 } 69 } 70 } 71 72 struct test_non_const 73 { 74 template <typename Policy, typename Iterator> 75 void 76 operator()(Policy&& exec, Iterator iter) 77 { 78 auto is_even = [&](float64_t v) { 79 uint32_t i = (uint32_t)v; 80 return i % 2 == 0; 81 }; 82 83 invoke_if(exec, [&]() { 84 find_if(exec, iter, iter, non_const(is_even)); 85 find_if_not(exec, iter, iter, non_const(is_even)); 86 }); 87 } 88 }; 89 90 int32_t 91 main() 92 { 93 #if !_PSTL_ICC_17_TEST_MAC_RELEASE_32_BROKEN 94 // Note that the "hit" and "miss" functions here avoid overflow issues. 95 test<Number>(IsMultiple(5, OddTag()), [](int32_t j) { return Number(j - j % 5, OddTag()); }, // hit 96 [](int32_t j) { return Number(j % 5 == 0 ? j ^ 1 : j, OddTag()); }); // miss 97 #endif 98 99 // Try type for which algorithm can really be vectorized. 100 test<float32_t>([](float32_t x) { return x >= 0; }, [](float32_t j) { return j * j; }, 101 [](float32_t j) { return -1 - j * j; }); 102 103 test_algo_basic_single<int32_t>(run_for_rnd_fw<test_non_const>()); 104 105 std::cout << done() << std::endl; 106 return 0; 107 } 108