| /src/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | min_element.h | 52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in min_element() function 63 min_element(_ForwardIterator __first, _ForwardIterator __last) { in min_element() function 64 return std::min_element(__first, __last, __less<>()); in min_element()
|
| H A D | min.h | 49 return *std::min_element(__t.begin(), __t.end(), __less<>()); in min()
|
| H A D | ranges_min_element.h | 71 inline constexpr auto min_element = __min_element::__fn{};
|
| /src/contrib/llvm-project/libcxx/modules/std/ |
| H A D | algorithm.inc | 569 using std::min_element; 572 using std::ranges::min_element;
|
| /src/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNILPSched.cpp | 315 llvm::min_element(PendingQueue, [=](const Candidate &C1, in schedule()
|
| /src/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Math.h | 91 return std::min_element(Data.get(), Data.get() + Length) - Data.get(); in minIndex()
|
| /src/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RegAllocPBQP.h | 465 NodeSet::iterator NItr = llvm::min_element(NotProvablyAllocatableNodes, in reduce()
|
| /src/contrib/llvm-project/clang/lib/Format/ |
| H A D | MacroCallReconstructor.cpp | 532 std::min_element(N->Children.begin(), N->Children.end(), in createUnwrappedLine()
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopLoadElimination.cpp | 363 llvm::min_element(Candidates, in findPointersWrittenOnForwardingPath()
|
| /src/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | STLExtras.h | 1978 template <typename R> auto min_element(R &&Range) { 1979 return std::min_element(adl_begin(Range), adl_end(Range)); 1982 template <typename R, typename Compare> auto min_element(R &&Range, Compare C) { 1983 return std::min_element(adl_begin(Range), adl_end(Range), C);
|
| /src/contrib/llvm-project/libcxx/include/ |
| H A D | algorithm | 50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); 54 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); 1705 min_element(ForwardIterator first, ForwardIterator last); 1709 min_element(ForwardIterator first, ForwardIterator last, Compare comp); 1861 #include <__algorithm/min_element.h>
|
| H A D | valarray | 351 #include <__algorithm/min_element.h> 2544 return *std::min_element(__begin_, __end_);
|
| H A D | module.modulemap | 694 …gorithm_min_element [system] { header "__algorithm/min_element.h" }
|
| /src/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 596 GepNode *Min = *llvm::min_element(S, NodeOrder); in common()
|
| H A D | HexagonGenInsert.cpp | 1317 IFListType::iterator MinI = llvm::min_element(LL, IFO); in selectCandidates()
|
| /src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 895 llvm::min_element(C, [](const auto &A, const auto &B) { in vectorizeChain()
|
| /src/lib/libc++/ |
| H A D | Makefile | 335 ALG_HEADERS+= min_element.h
|
| H A D | libcxx.imp | 58 { include: [ "<__algorithm/min_element.h>", "private", "<algorithm>", "public" ] },
|
| /src/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | BugReporter.cpp | 2682 OrigN = *std::min_element(OrigN->pred_begin(), OrigN->pred_end(), in getNextBugPath()
|
| /src/contrib/llvm-project/clang/lib/Tooling/Inclusions/Stdlib/ |
| H A D | StdSymbolMap.inc | 2174 SYMBOL(min_element, std::, <algorithm>) 3652 SYMBOL(min_element, std::ranges::, <algorithm>)
|
| /src/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGOpenMPRuntime.cpp | 10792 return std::make_tuple(*std::min_element(std::begin(Sizes), std::end(Sizes)), in getNDSWDS()
|
| /src/contrib/bsnmp/tests/ |
| H A D | catch.hpp | 7668 auto xj1 = *std::min_element(first + (j + 1), last); in weighted_average_quantile()
|