e637637ae4
The initial commit of the Parallel STL upstream (under LLVM umbrella) based on Parallel STL 20181204 open source release, which is available by https://github.com/intel/parallelstl Author: Mikhail Dvorskiy <mikhail.dvorskiy@intel.com> Differential Revision: https://reviews.llvm.org/D55889 llvm-svn: 349653
108 lines
3.4 KiB
C++
108 lines
3.4 KiB
C++
// -*- C++ -*-
|
|
//===-- test_search_n.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 "pstl/execution"
|
|
#include "pstl/algorithm"
|
|
#include "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 <typename Iterator, typename Size, typename T, typename Predicate>
|
|
void
|
|
operator()(pstl::execution::unsequenced_policy, Iterator b, Iterator e, Size count, const T& value, Predicate pred)
|
|
{
|
|
}
|
|
template <typename Iterator, typename Size, typename T, typename Predicate>
|
|
void
|
|
operator()(pstl::execution::parallel_unsequenced_policy, Iterator b, Iterator e, Size count, const T& value,
|
|
Predicate pred)
|
|
{
|
|
}
|
|
#endif
|
|
|
|
template <typename ExecutionPolicy, typename Iterator, typename Size, typename T, typename Predicate>
|
|
void
|
|
operator()(ExecutionPolicy&& exec, Iterator b, Iterator e, Size count, const T& value, Predicate pred)
|
|
{
|
|
using namespace std;
|
|
auto expected = search_n(b, e, count, value, pred);
|
|
auto actual = search_n(exec, b, e, count, value);
|
|
EXPECT_TRUE(actual == expected, "wrong return result from search_n");
|
|
|
|
actual = search_n(exec, b, e, count, value, pred);
|
|
EXPECT_TRUE(actual == expected, "wrong return result from search_n with a predicate");
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
void
|
|
test()
|
|
{
|
|
|
|
const std::size_t max_n1 = 100000;
|
|
const T value = T(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)
|
|
{
|
|
// Some of standard libraries return "first" in this case. We return "last" according to the standard
|
|
if (n2 == 0)
|
|
{
|
|
continue;
|
|
}
|
|
for (auto r : res)
|
|
{
|
|
Sequence<T> in(n1, [n1](std::size_t k) { return T(0); });
|
|
std::size_t i = r, isub = 0;
|
|
for (; i < n1 & isub < n2; ++i, ++isub)
|
|
in[i] = value;
|
|
|
|
invoke_on_all_policies(test_one_policy(), in.begin(), in.begin() + n1, n2, value, std::equal_to<T>());
|
|
invoke_on_all_policies(test_one_policy(), in.cbegin(), in.cbegin() + n1, n2, value, std::equal_to<T>());
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
struct test_non_const
|
|
{
|
|
template <typename Policy, typename Iterator>
|
|
void
|
|
operator()(Policy&& exec, Iterator iter)
|
|
{
|
|
invoke_if(exec, [&]() { search_n(exec, iter, iter, 0, T(0), non_const(std::equal_to<T>())); });
|
|
}
|
|
};
|
|
|
|
int32_t
|
|
main()
|
|
{
|
|
test<int32_t>();
|
|
test<uint16_t>();
|
|
test<float64_t>();
|
|
#if !__PSTL_ICC_16_17_TEST_REDUCTION_BOOL_TYPE_RELEASE_64_BROKEN
|
|
test<bool>();
|
|
#endif
|
|
|
|
test_algo_basic_single<int32_t>(run_for_rnd_fw<test_non_const<int32_t>>());
|
|
|
|
std::cout << done() << std::endl;
|
|
return 0;
|
|
}
|