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