| /freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/ |
| D | min_element.h | 29 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in min_element() function
47 min_element(_ForwardIterator __first, _ForwardIterator __last) in min_element() function
49 return _VSTD::min_element(__first, __last, in min_element()
|
| D | min.h | 52 return *_VSTD::min_element(__t.begin(), __t.end(), __comp); in min()
61 return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); in min()
|
| D | sort.h | 134 _BidirectionalIterator __i = _VSTD::min_element<_BidirectionalIterator, in __selection_sort()
|
| /freebsd-12-stable/contrib/libstdc++/include/backward/ |
| D | algo.h | 114 using std::min_element;
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | GCNILPSched.cpp | 316 auto EarliestSU = std::min_element( in schedule()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| D | Math.h | 91 return std::min_element(Data.get(), Data.get() + Length) - Data.get(); in minIndex()
|
| /freebsd-12-stable/contrib/llvm-project/libcxx/include/ |
| D | algorithm | 543 min_element(ForwardIterator first, ForwardIterator last);
547 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
706 #include <__algorithm/min_element.h>
|
| D | module.modulemap | 265 module min_element { private header "__algorithm/min_element.h" }
|
| D | valarray | 3633 return *_VSTD::min_element(__begin_, __end_);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 465 std::min_element(NotProvablyAllocatableNodes.begin(), in reduce()
|
| D | BasicTTIImpl.h | 1901 auto *MinLegalCostI = std::min_element(LegalCost.begin(), LegalCost.end()); in getTypeBasedIntrinsicInstrCost()
1906 std::min_element(CustomCost.begin(), CustomCost.end()); in getTypeBasedIntrinsicInstrCost()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 351 std::min_element(Candidates.begin(), Candidates.end(), in findPointersWrittenOnForwardingPath()
|
| /freebsd-12-stable/lib/libc++/ |
| D | Makefile | 292 ALG_HEADERS+= min_element.h
|
| /freebsd-12-stable/contrib/libstdc++/include/std/ |
| D | std_valarray.h | 885 return *std::min_element(_M_data, _M_data+_M_size); in min()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonCommonGEP.cpp | 610 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder); in common()
|
| D | HexagonGenInsert.cpp | 1335 IFListType::iterator MinI = std::min_element(LL.begin(), LL.end(), IFO); in selectCandidates()
|
| /freebsd-12-stable/contrib/libstdc++/include/bits/ |
| D | stl_algo.h | 4933 min_element(_ForwardIterator __first, _ForwardIterator __last) in min_element() function
4960 min_element(_ForwardIterator __first, _ForwardIterator __last, in min_element() function
|
| /freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| D | BugReporter.cpp | 2655 OrigN = *std::min_element(OrigN->pred_begin(), OrigN->pred_end(), in getNextBugPath()
|
| /freebsd-12-stable/contrib/libstdc++/ |
| D | ChangeLog-2005 | 3036 * testsuite/25_algorithms/min_element/1.cc: New.
3037 * testsuite/25_algorithms/min_element/check_type.cc: New.
|
| D | ChangeLog-2003 | 3365 set_difference, set_symmetric_difference, max_element, min_element,
|
| /freebsd-12-stable/contrib/llvm-project/clang/lib/CodeGen/ |
| D | CGOpenMPRuntime.cpp | 11637 return std::make_tuple(*std::min_element(std::begin(Sizes), std::end(Sizes)), in getNDSWDS()
|
| /freebsd-12-stable/tools/build/mk/ |
| D | OptionalObsoleteFiles.inc | 4774 OLD_FILES+=usr/include/c++/v1/__algorithm/min_element.h
|