Home
last modified time | relevance | path

Searched refs:min_element (Results 1 – 25 of 49) sorted by relevance

12

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dranges.min_element.pass.cpp33 concept HasMinElement = requires (T t) { std::ranges::min_element(t); };
48 std::same_as<Iter> auto it = std::ranges::min_element(first, last); in test_iterators()
59 std::same_as<Iter> auto it = std::ranges::min_element(std::forward<Range>(rng)); in test_range()
73 std::same_as<It> auto it = std::ranges::min_element(It(first), It(last)); in test()
83 std::same_as<It> auto it = std::ranges::min_element(range); in test()
89 std::same_as<It> auto it = std::ranges::min_element(range); in test()
109 int* ret = std::ranges::min_element(std::views::all(a)); in test_borrowed_range_and_sentinel()
116 int* ret = std::ranges::min_element(a, std::ranges::greater{}); in test_comparator()
148 assert(std::ranges::min_element(arr) == arr); in test_immobile()
149 assert(std::ranges::min_element(arr, arr + 3) == arr); in test_immobile()
[all …]
H A Dmin_element_comp.pass.cpp30 Iter i = std::min_element(first, last, std::greater<int>()); in test()
67 assert(first == std::min_element(first, last, p)); in test_eq0()
89 constexpr auto p = std::min_element(il, il+8, less()); in constexpr_test()
H A Dmin_element.pass.cpp29 Iter i = std::min_element(first, last); in test()
70 constexpr auto p = std::min_element(il, il+8); in constexpr_test()
H A Drequires_forward_iterator.fail.cpp25 std::min_element(Iter(b), Iter(e)); in main()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dmin_element.h50 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in min_element() function
63 min_element(_ForwardIterator __first, _ForwardIterator __last) in min_element() function
65 return _VSTD::min_element(__first, __last, in min_element()
H A Dmin.h63 return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); in min()
H A Dranges_min_element.h66 inline constexpr auto min_element = __min_element::__fn{};
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.min.max/
H A Dminmax_element.pass.cpp30 const Iterator expect = std::min_element(begin, end); in operator ()()
31 const Iterator result = std::min_element(exec, begin, end); in operator ()()
32 const Iterator result_pred = std::min_element(exec, begin, end, std::less<T>()); in operator ()()
171 min_element(exec, iter, iter, non_const(std::less<T>())); in operator ()()
/llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/
H A Dpartial_sort.pass.cpp28 const std::uint8_t nth = *std::min_element(sort_iter, working.end()); in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dpop_heap_comp.pass.cpp33 assert(std::min_element(work, work+i-1) == work); in test()
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Drobust_against_cpp20_hostile_iterators.compile.pass.cpp149 (void) std::min_element(it, it); in test()
150 (void) std::min_element(it, it, pred); in test()
H A Dranges_robust_against_copying_comparators.pass.cpp159 (void)std::ranges::min_element(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
160 (void)std::ranges::min_element(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
H A Dranges_robust_against_copying_projections.pass.cpp142 (void)std::ranges::min_element(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
143 (void)std::ranges::min_element(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DLatencyBenchmarkRunner.cpp50 return *std::min_element(Values.begin(), Values.end()); in findMin()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Drobust_against_adl.compile.pass.cpp132 (void)std::min_element(first, last); in all_the_algorithms()
133 (void)std::min_element(first, last, std::less<void*>()); in all_the_algorithms()
H A Drobust_re_difference_type.compile.pass.cpp169 (void)std::min_element(first, last); in all_the_algorithms()
170 (void)std::min_element(first, last, std::less<void*>()); in all_the_algorithms()
H A Dranges_robust_against_nonbool_predicates.pass.cpp99 test(std::ranges::min_element, in, binary_pred); in test_all()
H A Dranges_robust_against_proxy_iterators.pass.cpp92 test(std::ranges::min_element, in); in run_tests()
/llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/
H A Dnodiscard_extensions.pass.cpp110 std::min_element(std::begin(arr), std::end(arr)); in test_algorithms()
111 std::min_element(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
H A Dnodiscard_extensions.verify.cpp203 std::min_element(std::begin(arr), std::end(arr)); in test_algorithms()
206 std::min_element(std::begin(arr), std::end(arr), std::greater<int>()); in test_algorithms()
/llvm-project-15.0.7/pstl/
H A DREADME.md29 * For `max_element`, `min_element`, `minmax_element`, `partial_sort`, `partial_sort_copy`, `sort`, …
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp316 auto EarliestSU = std::min_element( in schedule()
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dglue_algorithm_impl.h1011 min_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare … in min_element() function
1020 min_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last) in min_element() function
1023 …return std::min_element(std::forward<_ExecutionPolicy>(__exec), __first, __last, std::less<_InputT… in min_element()
1030 return min_element(std::forward<_ExecutionPolicy>(__exec), __first, __last, in max_element()
1039 return std::min_element(std::forward<_ExecutionPolicy>(__exec), __first, __last, in max_element()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DMath.h91 return std::min_element(Data.get(), Data.get() + Length) - Data.get(); in minIndex()
/llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/
H A Dniebloid.compile.pass.cpp103 static_assert(test(std::ranges::min_element, a));

12