1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
// -*- C++ -*-
//===-- all_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++03, c++11, c++14
#include "support/pstl_test_config.h"
#include <execution>
#include <algorithm>
#include "support/utils.h"
/*
TODO: consider implementing the following tests for a better code coverage
- correctness
- bad input argument (if applicable)
- data corruption around/of input and output
- correctly work with nested parallelism
- check that algorithm does not require anything more than is described in its requirements section
*/
using namespace TestUtils;
struct test_all_of
{
template <typename ExecutionPolicy, typename Iterator, typename Predicate>
void
operator()(ExecutionPolicy&& exec, Iterator begin, Iterator end, Predicate pred, bool expected)
{
auto actualr = std::all_of(exec, begin, end, pred);
EXPECT_EQ(expected, actualr, "result for all_of");
}
};
template <typename T>
struct Parity
{
bool parity;
public:
Parity(bool parity_) : parity(parity_) {}
bool
operator()(T value) const
{
return (size_t(value) ^ parity) % 2 == 0;
}
};
template <typename T>
void
test(size_t bits)
{
for (size_t n = 0; n <= 100000; n = n <= 16 ? n + 1 : size_t(3.1415 * n))
{
// Sequence of odd values
Sequence<T> in(n, [n, bits](size_t) { return T(2 * HashBits(n, bits - 1) ^ 1); });
// Even value, or false when T is bool.
T spike(2 * HashBits(n, bits - 1));
Sequence<T> inCopy(in);
invoke_on_all_policies(test_all_of(), in.begin(), in.end(), Parity<T>(1), true);
invoke_on_all_policies(test_all_of(), in.cbegin(), in.cend(), Parity<T>(1), true);
EXPECT_EQ(in, inCopy, "all_of modified input sequence");
if (n > 0)
{
// Sprinkle in a miss
in[2 * n / 3] = spike;
invoke_on_all_policies(test_all_of(), in.begin(), in.end(), Parity<T>(1), false);
invoke_on_all_policies(test_all_of(), in.cbegin(), in.cend(), Parity<T>(1), false);
// Sprinkle in a few more misses
in[n / 2] = spike;
in[n / 3] = spike;
invoke_on_all_policies(test_all_of(), in.begin(), in.end(), Parity<T>(1), false);
invoke_on_all_policies(test_all_of(), in.cbegin(), in.cend(), Parity<T>(1), false);
}
}
}
struct test_non_const
{
template <typename Policy, typename Iterator>
void
operator()(Policy&& exec, Iterator iter)
{
auto is_even = [&](float64_t v) {
uint32_t i = (uint32_t)v;
return i % 2 == 0;
};
all_of(exec, iter, iter, non_const(is_even));
}
};
int
main()
{
test<int32_t>(8 * sizeof(int32_t));
test<uint16_t>(8 * sizeof(uint16_t));
test<float64_t>(53);
#if !defined(_PSTL_ICC_16_17_TEST_REDUCTION_BOOL_TYPE_RELEASE_64_BROKEN)
test<bool>(1);
#endif
test_algo_basic_single<int32_t>(run_for_rnd_fw<test_non_const>());
std::cout << done() << std::endl;
return 0;
}
|
