mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-18 00:06:38 +00:00
d10dc5a06f
We originally put implementation-detail function objects into individual namespaces for `std::ranges` without a good reason for doing so. This practice was continued, presumably because there was prior art. Since there's no reason to keep these namespaces, this commit removes them, which will slightly impact binary size. This commit does not apply to CPOs, some of which need additional work.
83 lines
2.7 KiB
C++
83 lines
2.7 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_POP_HEAP_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
|
|
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__algorithm/make_projected.h>
|
|
#include <__algorithm/pop_heap.h>
|
|
#include <__concepts/same_as.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__iterator/next.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__iterator/sortable.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
struct __pop_heap {
|
|
template <class _Iter, class _Sent, class _Comp, class _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr static _Iter
|
|
__pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
|
|
auto __last_iter = ranges::next(__first, __last);
|
|
auto __len = __last_iter - __first;
|
|
|
|
auto&& __projected_comp = std::__make_projected(__comp, __proj);
|
|
std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len);
|
|
|
|
return __last_iter;
|
|
}
|
|
|
|
template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<_Iter, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr _Iter
|
|
operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
return __pop_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
|
|
}
|
|
|
|
template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<iterator_t<_Range>, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
|
|
operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
return __pop_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
|
}
|
|
};
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto pop_heap = __pop_heap{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
|