1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // UNSUPPORTED: c++03, c++11, c++14, c++17
10 // UNSUPPORTED: libcpp-has-no-incomplete-ranges
11
12 // <algorithm>
13 //
14 // Range algorithms that take predicates should support predicates that return a non-boolean value as long as the
15 // returned type is implicitly convertible to bool.
16
17 #include <algorithm>
18
19 #include <array>
20 #include <concepts>
21 #include <initializer_list>
22 #include <iterator>
23 #include <ranges>
24
25 #include "boolean_testable.h"
26
__anonb5b6cf1d0102(int i) 27 auto unary_pred = [](int i) { return BooleanTestable(i > 0); };
28 static_assert(!std::same_as<decltype(unary_pred(1)), bool>);
29 static_assert(std::convertible_to<decltype(unary_pred(1)), bool>);
30
__anonb5b6cf1d0202(int i, int j) 31 auto binary_pred = [](int i, int j) { return BooleanTestable(i < j); };
32 static_assert(!std::same_as<decltype(binary_pred(1, 2)), bool>);
33 static_assert(std::convertible_to<decltype(binary_pred(1, 2)), bool>);
34
35 // Invokes both the (iterator, sentinel, ...) and the (range, ...) overloads of the given niebloid.
36
37 // (in, ...)
38 template <class Func, std::ranges::range Input, class... Args>
test(Func && func,Input & in,Args &&...args)39 constexpr void test(Func&& func, Input& in, Args&&... args) {
40 func(in.begin(), in.end(), std::forward<Args>(args)...);
41 func(in, std::forward<Args>(args)...);
42 }
43
44 // (in1, in2, ...)
45 template <class Func, std::ranges::range Input, class... Args>
test(Func && func,Input & in1,Input & in2,Args &&...args)46 constexpr void test(Func&& func, Input& in1, Input& in2, Args&&... args) {
47 func(in1.begin(), in1.end(), in2.begin(), in2.end(), std::forward<Args>(args)...);
48 func(in1, in2, std::forward<Args>(args)...);
49 }
50
51 // (in, mid, ...)
52 template <class Func, std::ranges::range Input, class... Args>
test_mid(Func && func,Input & in,std::ranges::iterator_t<Input> mid,Args &&...args)53 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&&... args) {
54 func(in.begin(), mid, in.end(), std::forward<Args>(args)...);
55 func(in, mid, std::forward<Args>(args)...);
56 }
57
test_all()58 constexpr bool test_all() {
59 std::array in = {1, 2, 3};
60 std::array in2 = {4, 5, 6};
61 auto mid = in.begin() + 1;
62
63 std::array output = {7, 8, 9, 10, 11, 12};
64 auto out = output.begin();
65 auto out2 = output.begin() + 1;
66
67 int x = 2;
68 int count = 1;
69
70 test(std::ranges::any_of, in, unary_pred);
71 test(std::ranges::all_of, in, unary_pred);
72 test(std::ranges::none_of, in, unary_pred);
73 test(std::ranges::find_if, in, unary_pred);
74 test(std::ranges::find_if_not, in, unary_pred);
75 test(std::ranges::find_first_of, in, in2, binary_pred);
76 test(std::ranges::adjacent_find, in, binary_pred);
77 test(std::ranges::mismatch, in, in2, binary_pred);
78 test(std::ranges::equal, in, in2, binary_pred);
79 test(std::ranges::lexicographical_compare, in, in2, binary_pred);
80 test(std::ranges::partition_point, in, unary_pred);
81 test(std::ranges::lower_bound, in, x, binary_pred);
82 test(std::ranges::upper_bound, in, x, binary_pred);
83 test(std::ranges::equal_range, in, x, binary_pred);
84 test(std::ranges::binary_search, in, x, binary_pred);
85
86 // min
87 std::ranges::min(1, 2, binary_pred);
88 std::ranges::min(std::initializer_list<int>{1, 2}, binary_pred);
89 std::ranges::min(in, binary_pred);
90 // max
91 std::ranges::max(1, 2, binary_pred);
92 std::ranges::max(std::initializer_list<int>{1, 2}, binary_pred);
93 std::ranges::max(in, binary_pred);
94 // minmax
95 std::ranges::minmax(1, 2, binary_pred);
96 std::ranges::minmax(std::initializer_list<int>{1, 2}, binary_pred);
97 std::ranges::minmax(in, binary_pred);
98
99 test(std::ranges::min_element, in, binary_pred);
100 test(std::ranges::max_element, in, binary_pred);
101 test(std::ranges::minmax_element, in, binary_pred);
102 test(std::ranges::count_if, in, unary_pred);
103 test(std::ranges::search, in, in2, binary_pred);
104 test(std::ranges::search_n, in, count, x, binary_pred);
105 test(std::ranges::find_end, in, in2, binary_pred);
106 test(std::ranges::is_partitioned, in, unary_pred);
107 test(std::ranges::is_sorted, in, binary_pred);
108 test(std::ranges::is_sorted_until, in, binary_pred);
109 test(std::ranges::includes, in, in2, binary_pred);
110 test(std::ranges::is_heap, in, binary_pred);
111 test(std::ranges::is_heap_until, in, binary_pred);
112 std::ranges::clamp(2, 1, 3, binary_pred);
113 test(std::ranges::is_permutation, in, in2, binary_pred);
114 test(std::ranges::copy_if, in, out, unary_pred);
115 test(std::ranges::remove_copy_if, in, out, unary_pred);
116 test(std::ranges::replace_if, in, unary_pred, x);
117 test(std::ranges::replace_copy_if, in, out, unary_pred, x);
118 test(std::ranges::unique_copy, in, out, binary_pred);
119 test(std::ranges::partition_copy, in, out, out2, unary_pred);
120 test(std::ranges::partial_sort_copy, in, in2, binary_pred);
121 test(std::ranges::merge, in, in2, out, binary_pred);
122 test(std::ranges::set_difference, in, in2, out, binary_pred);
123 test(std::ranges::set_intersection, in, in2, out, binary_pred);
124 test(std::ranges::set_symmetric_difference, in, in2, out, binary_pred);
125 test(std::ranges::set_union, in, in2, out, binary_pred);
126 test(std::ranges::remove_if, in, unary_pred);
127 test(std::ranges::unique, in, binary_pred);
128 test(std::ranges::partition, in, unary_pred);
129 if (!std::is_constant_evaluated())
130 test(std::ranges::stable_partition, in, unary_pred);
131 test(std::ranges::sort, in, binary_pred);
132 if (!std::is_constant_evaluated())
133 test(std::ranges::stable_sort, in, binary_pred);
134 test_mid(std::ranges::partial_sort, in, mid, binary_pred);
135 test_mid(std::ranges::nth_element, in, mid, binary_pred);
136 if (!std::is_constant_evaluated())
137 test_mid(std::ranges::inplace_merge, in, mid, binary_pred);
138 test(std::ranges::make_heap, in, binary_pred);
139 test(std::ranges::push_heap, in, binary_pred);
140 test(std::ranges::pop_heap, in, binary_pred);
141 test(std::ranges::sort_heap, in, binary_pred);
142 test(std::ranges::prev_permutation, in, binary_pred);
143 test(std::ranges::next_permutation, in, binary_pred);
144
145 return true;
146 }
147
main(int,char **)148 int main(int, char**) {
149 test_all();
150 static_assert(test_all());
151
152 return 0;
153 }
154