| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | ranges.max_element.pass.cpp | 33 concept HasMaxElement = requires (T t) { std::ranges::max_element(t); };
48 std::same_as<Iter> auto it = std::ranges::max_element(first, last); in test_iterators()
59 std::same_as<Iter> auto it = std::ranges::max_element(std::forward<Range>(rng)); in test_range()
73 std::same_as<It> auto it = std::ranges::max_element(It(first), It(last)); in test()
83 std::same_as<It> auto it = std::ranges::max_element(range); in test()
89 std::same_as<It> auto it = std::ranges::max_element(range); in test()
109 int* ret = std::ranges::max_element(std::views::all(a)); in test_borrowed_range_and_sentinel()
116 int* ret = std::ranges::max_element(a, std::ranges::greater{}); in test_comparator()
148 assert(std::ranges::max_element(arr) == arr); in test_immobile()
149 assert(std::ranges::max_element(arr, arr + 3) == arr); in test_immobile()
[all …]
|
| H A D | max_element_comp.pass.cpp | 30 Iter i = std::max_element(first, last, std::greater<int>()); in test()
67 assert(first == std::max_element(first, last, p)); in test_eq0()
89 constexpr auto p = std::max_element(il, il+8, less()); in constexpr_test()
|
| H A D | max_element.pass.cpp | 29 Iter i = std::max_element(first, last); in test()
70 constexpr auto p = std::max_element(il,il+8); in constexpr_test()
|
| H A D | requires_forward_iterator.fail.cpp | 29 std::max_element(Iter(b), Iter(e)); in main()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | max_element.h | 41 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in max_element() function
50 max_element(_ForwardIterator __first, _ForwardIterator __last) in max_element() function
52 return _VSTD::max_element(__first, __last, in max_element()
|
| H A D | max.h | 63 return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); in max()
|
| H A D | ranges_max_element.h | 53 inline constexpr auto max_element = __max_element::__fn{};
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | minmax_element.pass.cpp | 45 const Iterator expect = std::max_element(begin, end); in operator ()()
46 const Iterator result = std::max_element(exec, begin, end); in operator ()()
47 const Iterator result_pred = std::max_element(exec, begin, end, std::less<T>()); in operator ()()
170 max_element(exec, iter, iter, non_const(std::less<T>())); in operator ()()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | pop_heap.pass.cpp | 33 assert(std::max_element(work, work+i-1) == work); in test()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopCoalescing.cpp | 65 *std::max_element(std::next(operandsDefinedAbove.begin(), start), in walkLoop()
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ConfusableTable/ |
| H A D | BuildConfusableTable.cpp | 60 std::max_element(Entries.begin(), Entries.end(), in main()
|
| /llvm-project-15.0.7/llvm/utils/FileCheck/ |
| H A D | FileCheck.cpp | 747 : *std::max_element(DumpInputs.begin(), DumpInputs.end()); in main()
754 *std::max_element(DumpInputFilters.begin(), DumpInputFilters.end()); in main()
757 : *std::max_element(DumpInputContexts.begin(), in main()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 145 (void) std::max_element(it, it); in test()
146 (void) std::max_element(it, it, pred); in test()
|
| /llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/ |
| H A D | LatencyBenchmarkRunner.cpp | 56 return *std::max_element(Values.begin(), Values.end()); in findMax()
|
| /llvm-project-15.0.7/mlir/lib/Reducer/ |
| H A D | ReductionNode.cpp | 77 auto maxElement = std::max_element( in generateNewVariants()
|
| /llvm-project-15.0.7/llvm/tools/llvm-pdbutil/ |
| H A D | MinimalTypeDumper.cpp | 309 auto Max = std::max_element(Indices.begin(), Indices.end()); in visitKnownRecord()
324 auto Max = std::max_element(Indices.begin(), Indices.end()); in visitKnownRecord()
494 auto Max = std::max_element(Indices.begin(), Indices.end()); in visitKnownRecord()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 122 (void)std::max_element(first, last); in all_the_algorithms()
123 (void)std::max_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 159 (void)std::max_element(first, last); in all_the_algorithms()
160 (void)std::max_element(first, last, std::less<void*>()); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/ |
| H A D | nodiscard_extensions.pass.cpp | 102 std::max_element(std::begin(arr), std::end(arr)); in test_algorithms()
103 std::max_element(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
|
| H A D | nodiscard_extensions.verify.cpp | 185 std::max_element(std::begin(arr), std::end(arr)); in test_algorithms()
188 std::max_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/compiler-rt/test/tsan/ |
| H A D | real_deadlock_detector_stress_test.cpp | 51 max_locked = *std::max_element(locked.begin(), locked.end()); in Thread()
|
| /llvm-project-15.0.7/llvm/tools/llvm-mca/Views/ |
| H A D | SchedulerStatistics.cpp | 109 std::max_element(IssueWidthPerCycle.begin(), IssueWidthPerCycle.end()); in printSchedulerStats()
|
| /llvm-project-15.0.7/libc/benchmarks/automemcpy/lib/ |
| H A D | ResultAnalyzerMain.cpp | 116 const size_t Max = *std::max_element(GH.begin(), GH.end()); in Serialize()
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/bugprone/ |
| H A D | SuspiciousEnumUsageCheck.cpp | 75 auto EnumConst = std::max_element( in isMaxValAllBitSetLiteral()
|