| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | ranges.minmax_element.pass.cpp | 32 concept HasMinMaxElementR = requires(T t) { std::ranges::minmax_element(t); };
54 concept HasMinMaxElementIt = requires(It it, Sent sent) { std::ranges::minmax_element(it, sent); };
70 std::same_as<Expected> auto it = std::ranges::minmax_element(It(first), It(last)); in test_iterators()
76 std::same_as<Expected> auto it = std::ranges::minmax_element(It(first), Sent(It(last))); in test_iterators()
82 std::same_as<Expected> auto it = std::ranges::minmax_element(range); in test_iterators()
89 std::same_as<Expected> auto it = std::ranges::minmax_element(range); in test_iterators()
111 std::ranges::minmax_element_result<int*> ret = std::ranges::minmax_element(std::views::all(a)); in test_borrowed_range_and_sentinel()
120 …std::ranges::minmax_element_result<int*> ret = std::ranges::minmax_element(a, std::ranges::greater… in test_comparator()
131 … std::ranges::minmax_element(a, std::ranges::less{}, [](int i) { return i == 5 ? -100 : i; }); in test_projection()
140 std::ranges::minmax_element(a, std::less<int*>{}, [](int& i) { return &i; }); in test_projection()
[all …]
|
| H A D | minmax_element.pass.cpp | 29 std::pair<Iter, Iter> p = std::minmax_element(first, last); in test()
73 std::pair<Iter, Iter> p = std::minmax_element(Iter(a), Iter(a+N)); in test()
87 constexpr auto p = std::minmax_element(il, il+8); in constexpr_test()
|
| H A D | minmax_element_comp.pass.cpp | 32 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp); in test()
78 std::pair<Iter, Iter> p = std::minmax_element(Iter(a), Iter(a+N), comp); in test()
93 constexpr auto p = std::minmax_element(il, il+8, less()); in constexpr_test()
|
| H A D | requires_forward_iterator.verify.cpp | 33 (void) std::minmax_element(Iter(b), Iter(e)); in main()
|
| /llvm-project/libcxx/include/__algorithm/ |
| H A D | minmax_element.h | 83 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in minmax_element() function
85 __has_forward_iterator_category<_ForwardIterator>::value, "std::minmax_element requires a ForwardIterator"); in minmax_element()
94 minmax_element(_ForwardIterator __first, _ForwardIterator __last) { in minmax_element() function
95 return std::minmax_element(__first, __last, __less<>()); in minmax_element()
|
| H A D | ranges_minmax_element.h | 13 #include <__algorithm/minmax_element.h>
65 inline constexpr auto minmax_element = __minmax_element{};
|
| /llvm-project/pstl/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | minmax_element.pass.cpp | 60 const std::pair<Iterator, Iterator> expect = std::minmax_element(begin, end); in operator ()()
61 const std::pair<Iterator, Iterator> got = std::minmax_element(exec, begin, end); in operator ()()
62 …const std::pair<Iterator, Iterator> got_pred = std::minmax_element(exec, begin, end, std::less<T>(… in operator ()()
172 minmax_element(exec, iter, iter, non_const(std::less<T>())); in operator ()()
|
| /llvm-project/libcxx/test/libcxx/algorithms/ |
| H A D | callable.verify.cpp | |
| H A D | robust_against_using_non_transparent_comparators.pass.cpp | 76 (void)std::minmax_element(first, last); in main()
|
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 156 (void) std::minmax_element(it, it); in test()
157 (void) std::minmax_element(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 176 (void)std::ranges::minmax_element(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
177 (void)std::ranges::minmax_element(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 173 (void)std::ranges::minmax_element(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
174 (void)std::ranges::minmax_element(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project/libcxx/test/libcxx/diagnostics/ |
| H A D | algorithm.nodiscard.verify.cpp | 216 std::minmax_element(std::begin(arr), std::end(arr)); in test()
219 std::minmax_element(std::begin(arr), std::end(arr), std::greater<int>()); in test()
343 std::ranges::minmax_element(range); // expected-warning {{ignoring return value of function declared with 'nodiscard' attribute}} in test()
344 std::ranges::minmax_element(iter, iter); // expected-warning {{ignoring return value of function declared with 'nodiscard' attribute}} in test()
|
| /llvm-project/libcxx/benchmarks/algorithms/ |
| H A D | min_max_element.bench.cpp | |
| /llvm-project/libcxx/test/support/ |
| H A D | maths.h | 24 auto [min, max] = std::ranges::minmax_element(input); in triangular_sum()
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 143 (void)std::minmax_element(first, last); in all_the_algorithms()
144 (void)std::minmax_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 183 (void)std::minmax_element(first, last); in all_the_algorithms()
184 (void)std::minmax_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 103 test(std::ranges::minmax_element, in); in run_tests()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 113 test(std::ranges::minmax_element, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project/clang-tools-extra/docs/clang-tidy/checks/modernize/ |
| H A D | use-ranges.rst | 63 ``std::minmax_element``,
|
| /llvm-project/pstl/ |
| H A D | README.md | 29 * For `max_element`, `min_element`, `minmax_element`, `partial_sort`, `partial_sort_copy`, `sort`, …
|
| /llvm-project/clang-tools-extra/clang-tidy/bugprone/ |
| H A D | SuspiciousEnumUsageCheck.cpp | 39 const auto MinMaxVal = std::minmax_element( in ValueRange()
|
| /llvm-project/libcxx/modules/std/ |
| H A D | algorithm.inc | 581 using std::minmax_element;
586 using std::ranges::minmax_element;
|
| /llvm-project/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 120 static_assert(test(std::ranges::minmax_element, a));
|
| /llvm-project/pstl/include/pstl/internal/ |
| H A D | glue_algorithm_defs.h | 536 minmax_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compa…
540 minmax_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last);
|