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_PUSH_HEAP_H
10 #define _LIBCPP___ALGORITHM_PUSH_HEAP_H
11
12 #include <__algorithm/comp.h>
13 #include <__algorithm/comp_ref_type.h>
14 #include <__algorithm/iterator_operations.h>
15 #include <__config>
16 #include <__iterator/iterator_traits.h>
17 #include <__type_traits/is_copy_assignable.h>
18 #include <__type_traits/is_copy_constructible.h>
19 #include <__utility/move.h>
20
21 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
22 # pragma GCC system_header
23 #endif
24
25 _LIBCPP_BEGIN_NAMESPACE_STD
26
27 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
28 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
__sift_up(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare && __comp,typename iterator_traits<_RandomAccessIterator>::difference_type __len)29 void __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp,
30 typename iterator_traits<_RandomAccessIterator>::difference_type __len) {
31 using value_type = typename iterator_traits<_RandomAccessIterator>::value_type;
32
33 if (__len > 1) {
34 __len = (__len - 2) / 2;
35 _RandomAccessIterator __ptr = __first + __len;
36
37 if (__comp(*__ptr, *--__last)) {
38 value_type __t(_IterOps<_AlgPolicy>::__iter_move(__last));
39 do {
40 *__last = _IterOps<_AlgPolicy>::__iter_move(__ptr);
41 __last = __ptr;
42 if (__len == 0)
43 break;
44 __len = (__len - 1) / 2;
45 __ptr = __first + __len;
46 } while (__comp(*__ptr, __t));
47
48 *__last = std::move(__t);
49 }
50 }
51 }
52
53 template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
54 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
__push_heap(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare & __comp)55 void __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) {
56 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __last - __first;
57 std::__sift_up<_AlgPolicy, __comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp, __len);
58 }
59
60 template <class _RandomAccessIterator, class _Compare>
61 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
push_heap(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)62 void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
63 static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
64 static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
65
66 std::__push_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
67 }
68
69 template <class _RandomAccessIterator>
70 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
push_heap(_RandomAccessIterator __first,_RandomAccessIterator __last)71 void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
72 std::push_heap(std::move(__first), std::move(__last),
73 __less<typename iterator_traits<_RandomAccessIterator>::value_type>());
74 }
75
76 _LIBCPP_END_NAMESPACE_STD
77
78 #endif // _LIBCPP___ALGORITHM_PUSH_HEAP_H
79