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_POP_HEAP_H
10 #define _LIBCPP___ALGORITHM_POP_HEAP_H
11
12 #include <__config>
13 #include <__algorithm/comp.h>
14 #include <__algorithm/comp_ref_type.h>
15 #include <__algorithm/sift_down.h>
16 #include <__iterator/iterator_traits.h>
17 #include <__utility/swap.h>
18
19 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
20 #pragma GCC system_header
21 #endif
22
23 _LIBCPP_PUSH_MACROS
24 #include <__undef_macros>
25
26 _LIBCPP_BEGIN_NAMESPACE_STD
27
28 template <class _Compare, class _RandomAccessIterator>
29 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
30 void
__pop_heap(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,typename iterator_traits<_RandomAccessIterator>::difference_type __len)31 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
32 typename iterator_traits<_RandomAccessIterator>::difference_type __len)
33 {
34 if (__len > 1)
35 {
36 swap(*__first, *--__last);
37 _VSTD::__sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
38 }
39 }
40
41 template <class _RandomAccessIterator, class _Compare>
42 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
43 void
pop_heap(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)44 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
45 {
46 typedef typename __comp_ref_type<_Compare>::type _Comp_ref;
47 _VSTD::__pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
48 }
49
50 template <class _RandomAccessIterator>
51 inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
52 void
pop_heap(_RandomAccessIterator __first,_RandomAccessIterator __last)53 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
54 {
55 _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
56 }
57
58 _LIBCPP_END_NAMESPACE_STD
59
60 _LIBCPP_POP_MACROS
61
62 #endif // _LIBCPP___ALGORITHM_POP_HEAP_H
63