| 1 | // -*- C++ -*- |
| 2 | //===-- none_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_none_of |
| 31 | { |
| 32 | template <typename ExecutionPolicy, typename Iterator, typename Predicate> |
| 33 | void |
| 34 | operator()(ExecutionPolicy&& exec, Iterator begin, Iterator end, Predicate pred, bool expected) |
| 35 | { |
| 36 | |
| 37 | auto actualr = std::none_of(exec, begin, end, pred); |
| 38 | EXPECT_EQ(expected, actualr, "result for none_of" ); |
| 39 | } |
| 40 | }; |
| 41 | |
| 42 | template <typename T> |
| 43 | void |
| 44 | test(size_t bits) |
| 45 | { |
| 46 | for (size_t n = 0; n <= 100000; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) |
| 47 | { |
| 48 | |
| 49 | // Sequence of odd values |
| 50 | Sequence<T> in(n, [n, bits](size_t) { return T(2 * HashBits(i: n, bits: bits - 1) ^ 1); }); |
| 51 | |
| 52 | // Even value, or false when T is bool. |
| 53 | T spike(2 * HashBits(i: n, bits: bits - 1)); |
| 54 | |
| 55 | invoke_on_all_policies(test_none_of(), in.begin(), in.end(), is_equal_to<T>(spike), true); |
| 56 | invoke_on_all_policies(test_none_of(), in.cbegin(), in.cend(), is_equal_to<T>(spike), true); |
| 57 | if (n > 0) |
| 58 | { |
| 59 | // Sprinkle in a hit |
| 60 | in[2 * n / 3] = spike; |
| 61 | invoke_on_all_policies(test_none_of(), in.begin(), in.end(), is_equal_to<T>(spike), false); |
| 62 | invoke_on_all_policies(test_none_of(), in.cbegin(), in.cend(), is_equal_to<T>(spike), false); |
| 63 | |
| 64 | // Sprinkle in a few more hits |
| 65 | in[n / 3] = spike; |
| 66 | in[n / 2] = spike; |
| 67 | invoke_on_all_policies(test_none_of(), in.begin(), in.end(), is_equal_to<T>(spike), false); |
| 68 | invoke_on_all_policies(test_none_of(), in.cbegin(), in.cend(), is_equal_to<T>(spike), false); |
| 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 | none_of(exec, iter, iter, non_const(is_even)); |
| 84 | } |
| 85 | }; |
| 86 | |
| 87 | int |
| 88 | main() |
| 89 | { |
| 90 | test<int32_t>(bits: 8 * sizeof(int32_t)); |
| 91 | test<uint16_t>(bits: 8 * sizeof(uint16_t)); |
| 92 | test<float64_t>(bits: 53); |
| 93 | #if !defined(_PSTL_ICC_16_17_TEST_REDUCTION_BOOL_TYPE_RELEASE_64_BROKEN) |
| 94 | test<bool>(bits: 1); |
| 95 | #endif |
| 96 | |
| 97 | test_algo_basic_single<int32_t>(f: run_for_rnd_fw<test_non_const>()); |
| 98 | |
| 99 | std::cout << done() << std::endl; |
| 100 | return 0; |
| 101 | } |
| 102 | |