// -*- C++ -*- //===-- find_first_of.pass.cpp --------------------------------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // UNSUPPORTED: c++98, c++03, c++11, c++14 #include "support/pstl_test_config.h" #include #include #include "support/utils.h" using namespace TestUtils; struct test_one_policy { #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 void operator()(pstl::execution::unsequenced_policy, Iterator1 b, Iterator1 e, Iterator2 bsub, Iterator2 esub, Predicate pred) { } template void operator()(pstl::execution::parallel_unsequenced_policy, Iterator1 b, Iterator1 e, Iterator2 bsub, Iterator2 esub, Predicate pred) { } #endif template void operator()(ExecutionPolicy&& exec, Iterator1 b, Iterator1 e, Iterator2 bsub, Iterator2 esub, Predicate pred) { using namespace std; Iterator1 expected = find_first_of(b, e, bsub, esub, pred); Iterator1 actual = find_first_of(exec, b, e, bsub, esub, pred); EXPECT_TRUE(actual == expected, "wrong return result from find_first_of with a predicate"); expected = find_first_of(b, e, bsub, esub); actual = find_first_of(exec, b, e, bsub, esub); EXPECT_TRUE(actual == expected, "wrong return result from find_first_of"); } }; template void test(Predicate pred) { const std::size_t max_n1 = 1000; const std::size_t max_n2 = (max_n1 * 10) / 8; Sequence in1(max_n1, [](std::size_t) { return T(1); }); Sequence in2(max_n2, [](std::size_t) { return T(0); }); for (std::size_t n1 = 0; n1 <= max_n1; n1 = n1 <= 16 ? n1 + 1 : size_t(3.1415 * n1)) { std::size_t sub_n[] = {0, 1, n1 / 3, n1, (n1 * 10) / 8}; for (const auto n2 : sub_n) { invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.data(), in2.data() + n2, pred); in2[n2 / 2] = T(1); invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + n1, in2.data(), in2.data() + n2, pred); if (n2 >= 3) { in2[2 * n2 / 3] = T(1); invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + n1, in2.begin(), in2.begin() + n2, pred); in2[2 * n2 / 3] = T(0); } in2[n2 / 2] = T(0); } } invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n1 / 10, in1.data(), in1.data() + max_n1 / 10, pred); } template struct test_non_const { template void operator()(Policy&& exec, FirstIterator first_iter, SecondInterator second_iter) { invoke_if(exec, [&]() { find_first_of(exec, first_iter, first_iter, second_iter, second_iter, non_const(std::equal_to())); }); } }; int32_t main() { test(std::equal_to()); test(std::not_equal_to()); test([](const float64_t x, const float64_t y) { return x * x == y * y; }); test_algo_basic_double(run_for_rnd_fw>()); std::cout << done() << std::endl; return 0; }