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