| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | ranges.minmax_element.pass.cpp | 83 std::same_as<Expected> auto it = std::ranges::minmax_element(range); in test_iterators() 162 auto ret = std::ranges::minmax_element(arr); in test_immobile() 168 auto ret = std::ranges::minmax_element(arr, arr + 3); in test_immobile() 236 auto ret = std::ranges::minmax_element(a, a + 3, {}, &S::comp); in test() 248 auto ret = std::ranges::minmax_element(a, {}, &S::comp); in test() 259 auto ret = std::ranges::minmax_element(a.begin(), a.end()); in test() 265 auto ret = std::ranges::minmax_element(a); in test() 274 auto ret = std::ranges::minmax_element(a, a + 3); in test() 282 auto ret = std::ranges::minmax_element(a); in test() 293 auto ret = std::ranges::minmax_element(a, a + 3); in test() [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.fail.cpp | 33 std::minmax_element(Iter(b), Iter(e)); in main()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | minmax_element.h | 84 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in minmax_element() function 95 pair<_ForwardIterator, _ForwardIterator> minmax_element(_ForwardIterator __first, _ForwardIterator … in minmax_element() function 96 …return std::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::val… in minmax_element()
|
| H A D | ranges_minmax_element.h | 63 inline constexpr auto minmax_element = __minmax_element::__fn{};
|
| /llvm-project-15.0.7/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-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | callable.verify.cpp | 29 …std::minmax_element(a, a + 4, &S::compare); // expected-error@*:* {{The comparator has to be calla… in main()
|
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 151 (void) std::minmax_element(it, it); in test() 152 (void) std::minmax_element(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 164 (void)std::ranges::minmax_element(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms() 165 (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 | 147 (void)std::ranges::minmax_element(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms() 148 (void)std::ranges::minmax_element(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 164 (void)std::minmax_element(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/benchmarks/algorithms/ |
| H A D | min_max_element.bench.cpp | 20 benchmark::DoNotOptimize(std::minmax_element(Copy.begin(), Copy.end())); in run()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 140 (void)std::minmax_element(first, last); in all_the_algorithms() 141 (void)std::minmax_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 177 (void)std::minmax_element(first, last); in all_the_algorithms() 178 (void)std::minmax_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 101 test(std::ranges::minmax_element, in, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 94 test(std::ranges::minmax_element, in); in run_tests()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 127 dangling_1st<minmax_result<dangling>>(std::ranges::minmax_element, in); in test_all()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 107 test(std::ranges::minmax_element, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/ |
| H A D | nodiscard_extensions.pass.cpp | 118 std::minmax_element(std::begin(arr), std::end(arr)); in test_algorithms() 119 std::minmax_element(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
|
| H A D | nodiscard_extensions.verify.cpp | 221 std::minmax_element(std::begin(arr), std::end(arr)); in test_algorithms() 224 std::minmax_element(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
|
| /llvm-project-15.0.7/pstl/ |
| H A D | README.md | 29 * For `max_element`, `min_element`, `minmax_element`, `partial_sort`, `partial_sort_copy`, `sort`, …
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/bugprone/ |
| H A D | SuspiciousEnumUsageCheck.cpp | 41 const auto MinMaxVal = std::minmax_element( in ValueRange()
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 105 static_assert(test(std::ranges::minmax_element, a));
|
| /llvm-project-15.0.7/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);
|