Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / include / __algorithm / min_element.h
blobdb996365bf1de1ffb788988be4ace81c9da0ea4e
1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
9 #ifndef _LIBCPP___ALGORITHM_MIN_ELEMENT_H
10 #define _LIBCPP___ALGORITHM_MIN_ELEMENT_H
12 #include <__algorithm/comp.h>
13 #include <__algorithm/comp_ref_type.h>
14 #include <__config>
15 #include <__functional/identity.h>
16 #include <__iterator/iterator_traits.h>
17 #include <__type_traits/invoke.h>
18 #include <__type_traits/is_callable.h>
19 #include <__utility/move.h>
21 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
22 # pragma GCC system_header
23 #endif
25 _LIBCPP_PUSH_MACROS
26 #include <__undef_macros>
28 _LIBCPP_BEGIN_NAMESPACE_STD
30 template <class _Comp, class _Iter, class _Sent, class _Proj>
31 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter
32 __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) {
33 if (__first == __last)
34 return __first;
36 _Iter __i = __first;
37 while (++__i != __last)
38 if (std::__invoke(__comp, std::__invoke(__proj, *__i), std::__invoke(__proj, *__first)))
39 __first = __i;
41 return __first;
44 template <class _Comp, class _Iter, class _Sent>
45 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) {
46 auto __proj = __identity();
47 return std::__min_element<_Comp>(std::move(__first), std::move(__last), __comp, __proj);
50 template <class _ForwardIterator, class _Compare>
51 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) {
53 static_assert(
54 __has_forward_iterator_category<_ForwardIterator>::value, "std::min_element requires a ForwardIterator");
55 static_assert(
56 __is_callable<_Compare&, decltype(*__first), decltype(*__first)>::value, "The comparator has to be callable");
58 return std::__min_element<__comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp);
61 template <class _ForwardIterator>
62 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _ForwardIterator
63 min_element(_ForwardIterator __first, _ForwardIterator __last) {
64 return std::min_element(__first, __last, __less<>());
67 _LIBCPP_END_NAMESPACE_STD
69 _LIBCPP_POP_MACROS
71 #endif // _LIBCPP___ALGORITHM_MIN_ELEMENT_H