// -*- C++ -*- //===-- find_end.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 // //===----------------------------------------------------------------------===// #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; // For find_end { auto expected = find_end(b, e, bsub, esub, pred); auto actual = find_end(exec, b, e, bsub, esub); EXPECT_TRUE(actual == expected, "wrong return result from find_end"); actual = find_end(exec, b, e, bsub, esub, pred); EXPECT_TRUE(actual == expected, "wrong return result from find_end with a predicate"); } // For search { auto expected = search(b, e, bsub, esub, pred); auto actual = search(exec, b, e, bsub, esub); EXPECT_TRUE(actual == expected, "wrong return result from search"); actual = search(exec, b, e, bsub, esub, pred); EXPECT_TRUE(actual == expected, "wrong return result from search with a predicate"); } } }; template void test(const std::size_t bits) { const std::size_t max_n1 = 1000; const std::size_t max_n2 = (max_n1 * 10) / 8; Sequence in(max_n1, [bits](std::size_t k) { return T(2 * HashBits(max_n1, bits - 1) ^ 1); }); Sequence sub(max_n2, [bits](std::size_t k) { return T(2 * HashBits(max_n1, bits - 1)); }); 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, 3, n1, (n1 * 10) / 8}; std::size_t res[] = {0, 1, n1 / 2, n1}; for (auto n2 : sub_n) { for (auto r : res) { std::size_t i = r, isub = 0; for (; i < n1 & isub < n2; ++i, ++isub) in[i] = sub[isub]; invoke_on_all_policies(test_one_policy(), in.begin(), in.begin() + n1, sub.begin(), sub.begin() + n2, std::equal_to()); invoke_on_all_policies(test_one_policy(), in.cbegin(), in.cbegin() + n1, sub.cbegin(), sub.cbegin() + n2, std::equal_to()); } } } } template struct test_non_const { template void operator()(Policy&& exec, FirstIterator first_iter, SecondInterator second_iter) { invoke_if(exec, [&]() { find_end(exec, first_iter, first_iter, second_iter, second_iter, non_const(std::equal_to())); search(exec, first_iter, first_iter, second_iter, second_iter, non_const(std::equal_to())); }); } }; int32_t main() { test(8 * sizeof(int32_t)); test(8 * sizeof(uint16_t)); test(53); #if !_PSTL_ICC_16_17_TEST_REDUCTION_BOOL_TYPE_RELEASE_64_BROKEN test(1); #endif test_algo_basic_double(run_for_rnd_fw>()); std::cout << done() << std::endl; return 0; }