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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <algorithm>
// UNSUPPORTED: c++03, c++11, c++14, c++17
// template<input_iterator I, sentinel_for<I> S, class Proj = identity,
// indirect_unary_predicate<projected<I, Proj>> Pred>
// constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {});
// template<input_range R, class Proj = identity,
// indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
// constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {});
#include <algorithm>
#include <array>
#include <cassert>
#include <ranges>
#include "almost_satisfies_types.h"
#include "test_iterators.h"
struct UnaryFunctor {
bool operator()(auto&&);
};
template <class It, class Sent = sentinel_wrapper<It>>
concept HasAnyOfIt = requires(It first, Sent last) { std::ranges::any_of(first, last, UnaryFunctor{}); };
static_assert(HasAnyOfIt<int*>);
static_assert(!HasAnyOfIt<InputIteratorNotDerivedFrom>);
static_assert(!HasAnyOfIt<InputIteratorNotIndirectlyReadable>);
static_assert(!HasAnyOfIt<InputIteratorNotInputOrOutputIterator>);
static_assert(!HasAnyOfIt<int*, SentinelForNotSemiregular>);
static_assert(!HasAnyOfIt<int*, SentinelForNotWeaklyEqualityComparableWith>);
template <class Func>
concept HasAnyOfItFunc = requires(int* ptr) { std::ranges::any_of(ptr, ptr, Func{}); };
static_assert(HasAnyOfItFunc<UnaryFunctor>);
static_assert(!HasAnyOfItFunc<IndirectUnaryPredicateNotCopyConstructible>);
static_assert(!HasAnyOfItFunc<IndirectUnaryPredicateNotPredicate>);
template <class Range>
concept HasAnyOfR = requires(Range range) { std::ranges::any_of(range, UnaryFunctor{}); };
static_assert(HasAnyOfR<std::array<int, 10>>);
static_assert(!HasAnyOfR<InputRangeNotDerivedFrom>);
static_assert(!HasAnyOfR<InputRangeNotIndirectlyReadable>);
static_assert(!HasAnyOfR<InputRangeNotInputOrOutputIterator>);
static_assert(!HasAnyOfR<InputRangeNotSentinelSemiregular>);
static_assert(!HasAnyOfR<InputRangeNotSentinelEqualityComparableWith>);
template <class Func>
concept HasAnyOfRFunc = requires(std::array<int, 10> range) { std::ranges::any_of(range, Func{}); };
static_assert(HasAnyOfRFunc<UnaryFunctor>);
static_assert(!HasAnyOfRFunc<IndirectUnaryPredicateNotCopyConstructible>);
static_assert(!HasAnyOfRFunc<IndirectUnaryPredicateNotPredicate>);
template <class It, class Sent = It>
constexpr void test_iterators() {
{ // simple test
{
int a[] = {1, 2, 3, 4};
std::same_as<bool> decltype(auto) ret = std::ranges::any_of(It(a), Sent(It(a + 4)), [](int) { return true; });
assert(ret);
}
{
int a[] = {1, 2, 3, 4};
auto range = std::ranges::subrange(It(a), Sent(It(a + 4)));
std::same_as<bool> decltype(auto) ret = std::ranges::any_of(range, [](int) { return true; });
assert(ret);
}
}
{ // check that an empty range works
std::array<int, 0> a;
assert(!std::ranges::any_of(It(a.data()), Sent(It(a.data())), [](int) { return false; }));
auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data())));
assert(!std::ranges::any_of(range, [](int) { return false; }));
}
{ // check that the complexity requirements are met
{
int predicateCount = 0;
int projectionCount = 0;
auto pred = [&](int) { ++predicateCount; return false; };
auto proj = [&](int i) { ++projectionCount; return i; };
std::array a = {9, 7, 5, 3};
assert(!std::ranges::any_of(It(a.begin()), Sent(It(a.end())), pred, proj));
assert(predicateCount == 4);
assert(projectionCount == 4);
}
{
int predicateCount = 0;
int projectionCount = 0;
auto pred = [&](int) { ++predicateCount; return false; };
auto proj = [&](int i) { ++projectionCount; return i; };
std::array a = {9, 7, 5, 3};
auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data() + a.size())));
assert(!std::ranges::any_of(range, pred, proj));
assert(predicateCount == 4);
assert(projectionCount == 4);
}
}
{ // check that false is returned if no element satisfies the condition
std::array a = {1, 2, 3, 4};
assert(!std::ranges::any_of(It(a.data()), Sent(It(a.data() + a.size())), [](int i) { return i > 5; }));
auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data() + a.size())));
assert(!std::ranges::any_of(range, [](int i) { return i > 5; }));
}
{ // check that true is returned if all elements satisfy the condition
std::array a = {1, 2, 3, 4};
assert(std::ranges::any_of(It(a.data()), Sent(It(a.data() + a.size())), [](int i) { return i < 5; }));
auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data() + a.size())));
assert(std::ranges::any_of(range, [](int i) { return i < 5; }));
}
{ // check that true is returned if ony one elements satisfies the condition
std::array a = {1, 2, 3, 4, 6};
assert(std::ranges::any_of(It(a.data()), Sent(It(a.data() + a.size())), [](int i) { return i > 5; }));
auto range = std::ranges::subrange(It(a.data()), Sent(It(a.data() + a.size())));
assert(std::ranges::any_of(range, [](int i) { return i > 5; }));
}
}
constexpr bool test() {
test_iterators<cpp20_input_iterator<int*>, sentinel_wrapper<cpp20_input_iterator<int*>>>();
test_iterators<forward_iterator<int*>>();
test_iterators<bidirectional_iterator<int*>>();
test_iterators<random_access_iterator<int*>>();
test_iterators<contiguous_iterator<int*>>();
test_iterators<int*>();
{ // check that std::invoke is used
struct S { int check; int other; };
S a[] = {{1, 2}, {1, 7}, {1, 3}};
assert(std::ranges::any_of(a, a + 3, [](int i) { return i == 1; }, &S::check));
assert(std::ranges::any_of(a, [](int i) { return i == 1; }, &S::check));
}
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}
|
