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//===----------------------------------------------------------------------===//
8
9#ifndef _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
10#define _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
11
12#include <__algorithm/iterator_operations.h>
13#include <__algorithm/make_projected.h>
14#include <__algorithm/pop_heap.h>
15#include <__concepts/same_as.h>
16#include <__config>
17#include <__functional/identity.h>
18#include <__functional/invoke.h>
19#include <__functional/ranges_operations.h>
20#include <__iterator/concepts.h>
21#include <__iterator/iterator_traits.h>
22#include <__iterator/next.h>
23#include <__iterator/projected.h>
24#include <__iterator/sortable.h>
25#include <__ranges/access.h>
26#include <__ranges/concepts.h>
27#include <__ranges/dangling.h>
28#include <__utility/forward.h>
29#include <__utility/move.h>
30
31#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
32# pragma GCC system_header
33#endif
34
35_LIBCPP_PUSH_MACROS
36#include <__undef_macros>
37
38#if _LIBCPP_STD_VER >= 20
39
40_LIBCPP_BEGIN_NAMESPACE_STD
41
42namespace ranges {
43struct __pop_heap {
44 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 constexpr static _Iter __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) {
46 auto __last_iter = ranges::next(__first, __last);
47 auto __len = __last_iter - __first;
48
49 auto&& __projected_comp = std::__make_projected(__comp, __proj);
50 std::__pop_heap<_RangeAlgPolicy>(std::move(__first), __last_iter, __projected_comp, __len);
51
52 return __last_iter;
53 }
54
55 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
56 requires sortable<_Iter, _Comp, _Proj>
57 constexpr _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
58 return __pop_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
59 }
60
61 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
62 requires sortable<iterator_t<_Range>, _Comp, _Proj>
63 constexpr borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
64 return __pop_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
65 }
66};
67
68inline namespace __cpo {
69inline constexpr auto pop_heap = __pop_heap{};
70} // namespace __cpo
71} // namespace ranges
72
73_LIBCPP_END_NAMESPACE_STD
74
75#endif // _LIBCPP_STD_VER >= 20
76
77_LIBCPP_POP_MACROS
78
79#endif // _LIBCPP___ALGORITHM_RANGES_POP_HEAP_H
80