57b08b0944
to reflect the new license. These used slightly different spellings that defeated my regular expressions. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351648
115 lines
4.4 KiB
C++
115 lines
4.4 KiB
C++
// -*- C++ -*-
|
|
//===-- test_partition_copy.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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Tests for stable_partition and partition_copy
|
|
#include "pstl_test_config.h"
|
|
|
|
#include "pstl/execution"
|
|
#include "pstl/algorithm"
|
|
#include "utils.h"
|
|
|
|
#include <cstdlib>
|
|
#include <iterator>
|
|
|
|
using namespace TestUtils;
|
|
|
|
struct test_partition_copy
|
|
{
|
|
template <typename Policy, typename InputIterator, typename OutputIterator, typename OutputIterator2,
|
|
typename UnaryOp>
|
|
void
|
|
operator()(Policy&& exec, InputIterator first, InputIterator last, OutputIterator true_first,
|
|
OutputIterator true_last, OutputIterator2 false_first, OutputIterator2 false_last, UnaryOp unary_op)
|
|
{
|
|
|
|
auto actual_ret = std::partition_copy(exec, first, last, true_first, false_first, unary_op);
|
|
|
|
EXPECT_TRUE(std::distance(true_first, actual_ret.first) == std::count_if(first, last, unary_op),
|
|
"partition_copy has wrong effect from true sequence");
|
|
EXPECT_TRUE(std::distance(false_first, actual_ret.second) ==
|
|
std::count_if(first, last, __pstl::internal::not_pred<UnaryOp>(unary_op)),
|
|
"partition_copy has wrong effect from false sequence");
|
|
}
|
|
|
|
//dummy specialization by iterator type and policy type, in case of broken configuration
|
|
#if __PSTL_ICC_1800_TEST_MONOTONIC_RELEASE_64_BROKEN
|
|
template <typename InputIterator, typename OutputIterator, typename OutputIterator2, typename UnaryOp>
|
|
void
|
|
operator()(pstl::execution::unsequenced_policy, std::reverse_iterator<InputIterator> first,
|
|
std::reverse_iterator<InputIterator> last, std::reverse_iterator<OutputIterator> true_first,
|
|
std::reverse_iterator<OutputIterator> true_last, std::reverse_iterator<OutputIterator2> false_first,
|
|
OutputIterator2 false_last, UnaryOp unary_op)
|
|
{
|
|
}
|
|
template <typename InputIterator, typename OutputIterator, typename OutputIterator2, typename UnaryOp>
|
|
void
|
|
operator()(pstl::execution::parallel_unsequenced_policy, std::reverse_iterator<InputIterator> first,
|
|
std::reverse_iterator<InputIterator> last, std::reverse_iterator<OutputIterator> true_first,
|
|
std::reverse_iterator<OutputIterator> true_last, std::reverse_iterator<OutputIterator2> false_first,
|
|
OutputIterator2 false_last, UnaryOp unary_op)
|
|
{
|
|
}
|
|
#endif
|
|
};
|
|
|
|
template <typename T, typename UnaryPred>
|
|
void
|
|
test(UnaryPred pred)
|
|
{
|
|
|
|
const std::size_t max_size = 100000;
|
|
Sequence<T> in(max_size, [](std::size_t v) -> T { return T(v); });
|
|
Sequence<T> actual_true(max_size);
|
|
Sequence<T> actual_false(max_size);
|
|
for (std::size_t n = 0; n <= max_size; n = n <= 16 ? n + 1 : std::size_t(3.1415 * n))
|
|
{
|
|
|
|
// for non-const input iterators
|
|
invoke_on_all_policies(test_partition_copy(), in.begin(), in.begin() + n, actual_true.begin(),
|
|
actual_true.begin() + n, actual_false.begin(), actual_false.begin() + n, pred);
|
|
|
|
// for const input iterators
|
|
invoke_on_all_policies(test_partition_copy(), in.cbegin(), in.cbegin() + n, actual_true.begin(),
|
|
actual_true.begin() + n, actual_false.begin(), actual_false.begin() + n, pred);
|
|
}
|
|
}
|
|
|
|
struct test_non_const
|
|
{
|
|
template <typename Policy, typename InputIterator, typename OutputInterator>
|
|
void
|
|
operator()(Policy&& exec, InputIterator input_iter, OutputInterator out_iter)
|
|
{
|
|
auto is_even = [&](float64_t v) {
|
|
uint32_t i = (uint32_t)v;
|
|
return i % 2 == 0;
|
|
};
|
|
|
|
partition_copy(exec, input_iter, input_iter, out_iter, out_iter, non_const(is_even));
|
|
}
|
|
};
|
|
|
|
int32_t
|
|
main()
|
|
{
|
|
test<int32_t>([](const int32_t value) { return value % 2; });
|
|
|
|
#if !__PSTL_ICC_16_17_TEST_REDUCTION_RELEASE_BROKEN
|
|
test<int32_t>([](const int32_t value) { return true; });
|
|
#endif
|
|
|
|
test<float64_t>([](const float64_t value) { return value > 2 << 6; });
|
|
test<Wrapper<float64_t>>([](const Wrapper<float64_t>& value) -> bool { return value.get_my_field() != nullptr; });
|
|
|
|
test_algo_basic_double<int32_t>(run_for_rnd_bi<test_non_const>());
|
|
|
|
std::cout << done() << std::endl;
|
|
return 0;
|
|
}
|