| /llvm-project-15.0.7/libcxx/test/support/ |
| H A D | boolean_testable.h | 16 class BooleanTestable {
22 …friend constexpr BooleanTestable operator==(const BooleanTestable& lhs, const BooleanTestable& rhs…
26 …friend constexpr BooleanTestable operator!=(const BooleanTestable& lhs, const BooleanTestable& rhs…
30 constexpr BooleanTestable operator!() {
31 return BooleanTestable{!value_};
35 constexpr BooleanTestable(bool value) : value_{value} {} in BooleanTestable() function
36 constexpr BooleanTestable(const BooleanTestable&) = delete;
37 constexpr BooleanTestable(BooleanTestable&&) = delete;
49 …friend constexpr BooleanTestable operator==(const StrictComparable& lhs, const StrictComparable& r…
53 …friend constexpr BooleanTestable operator!=(const StrictComparable& lhs, const StrictComparable& r…
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| H A D | ranges.replace_if.pass.cpp | 140 …std::ranges::replace_if(std::begin(a), std::end(a), [](int) { return BooleanTestable{false}; }, 2); in test()
145 auto ret = std::ranges::replace_if(a, [](int) { return BooleanTestable{false}; }, 2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| H A D | ranges.adjacent_find.pass.cpp | 179 …auto ret = std::ranges::adjacent_find(a, a + 4, [](int i, int j) { return BooleanTestable{i == j};… in test()
184 … auto ret = std::ranges::adjacent_find(a, [](int i, int j) { return BooleanTestable{i == j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | ranges.sort.pass.cpp | 191 …auto last = std::ranges::sort(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < … in test()
198 auto last = std::ranges::sort(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| H A D | ranges_make_heap.pass.cpp | 200 … std::ranges::make_heap(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < j}; }); in test()
206 auto last = std::ranges::make_heap(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| H A D | ranges_push_heap.pass.cpp | 202 … std::ranges::push_heap(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < j}; }); in test()
208 auto last = std::ranges::push_heap(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 197 … std::ranges::sort_heap(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < j}; }); in test()
203 auto last = std::ranges::sort_heap(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find/ |
| H A D | ranges.find_if.pass.cpp | 232 … auto ret = std::ranges::find_if(a, a + 4, [](const int& i) { return BooleanTestable{i == 3}; }); in test()
237 auto ret = std::ranges::find_if(a, [](const int& b) { return BooleanTestable{b == 3}; }); in test()
|
| H A D | ranges.find_if_not.pass.cpp | 226 …auto ret = std::ranges::find_if_not(a, a + 4, [](const int& i) { return BooleanTestable{i != 3}; }… in test()
231 auto ret = std::ranges::find_if_not(a, [](const int& b) { return BooleanTestable{b != 3}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| H A D | ranges.remove_if.pass.cpp | 205 … auto ret = std::ranges::remove_if(a, a + 4, [](const int& i) { return BooleanTestable{i == 3}; }); in test()
210 auto ret = std::ranges::remove_if(a, [](const int& b) { return BooleanTestable{b == 3}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | ranges_pop_heap.pass.cpp | 199 …= std::ranges::pop_heap(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < j}; }); in test()
205 auto last = std::ranges::pop_heap(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | ranges.stable.sort.pass.cpp | 245 …td::ranges::stable_sort(in.begin(), in.end(), [](int i, int j) { return BooleanTestable{i < j}; }); in test()
252 auto last = std::ranges::stable_sort(in, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 27 auto unary_pred = [](int i) { return BooleanTestable(i > 0); }; in __anonb5b6cf1d0102()
31 auto binary_pred = [](int i, int j) { return BooleanTestable(i < j); }; in __anonb5b6cf1d0202()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | ranges.lexicographical_compare.pass.cpp | 194 … [](int i, int j) { return BooleanTestable{i < j}; }); in test()
199 … = std::ranges::lexicographical_compare(a, a, [](int i, int j) { return BooleanTestable{i < j}; }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | ranges_nth_element.pass.cpp | 263 auto pred = [](int i, int j) { return BooleanTestable{i < j}; }; in test()
|