mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-18 20:27:03 +00:00
8fdfe3f2a7
Previously, ranges::min_element delegated to ranges::__min_element_impl, which
duplicated the definition of std::__min_element. This patch updates
ranges::min_element to directly call std::__min_element, which allows
removing the redundant code in ranges::__min_element_impl.
Upon removal of ranges::__min_element_impl, the other ranges algorithms
ranges::{min,max,max_element}, which previously delegated to ranges::__min_element_impl,
have been updated to call std::__min_element instead.
This refactoring unifies the implementation across these algorithms,
ensuring that future optimizations or maintenance work only need to be
applied in one place.
94 lines
3.4 KiB
C++
94 lines
3.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___ALGORITHM_RANGES_MIN_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_MIN_H
|
|
|
|
#include <__algorithm/min_element.h>
|
|
#include <__assert>
|
|
#include <__concepts/copyable.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__type_traits/is_trivially_copyable.h>
|
|
#include <initializer_list>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
# include <__undef_macros>
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
struct __min {
|
|
template <class _Tp,
|
|
class _Proj = identity,
|
|
indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
|
|
[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr const _Tp&
|
|
operator()(_LIBCPP_LIFETIMEBOUND const _Tp& __a,
|
|
_LIBCPP_LIFETIMEBOUND const _Tp& __b,
|
|
_Comp __comp = {},
|
|
_Proj __proj = {}) const {
|
|
return std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)) ? __b : __a;
|
|
}
|
|
|
|
template <copyable _Tp,
|
|
class _Proj = identity,
|
|
indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
|
|
[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Tp
|
|
operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(
|
|
__il.begin() != __il.end(), "initializer_list must contain at least one element");
|
|
return *std::__min_element(__il.begin(), __il.end(), __comp, __proj);
|
|
}
|
|
|
|
template <input_range _Rp,
|
|
class _Proj = identity,
|
|
indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
|
requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*>
|
|
[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr range_value_t<_Rp>
|
|
operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
auto __first = ranges::begin(__r);
|
|
auto __last = ranges::end(__r);
|
|
_LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__first != __last, "range must contain at least one element");
|
|
if constexpr (forward_range<_Rp> && !__is_cheap_to_copy<range_value_t<_Rp>>) {
|
|
return *std::__min_element(__first, __last, __comp, __proj);
|
|
} else {
|
|
range_value_t<_Rp> __result = *__first;
|
|
while (++__first != __last) {
|
|
if (std::invoke(__comp, std::invoke(__proj, *__first), std::invoke(__proj, __result)))
|
|
__result = *__first;
|
|
}
|
|
return __result;
|
|
}
|
|
}
|
|
};
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto min = __min{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_MIN_H
|