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_SORT_HEAP_H
10 #define _LIBCPP___ALGORITHM_SORT_HEAP_H
11 
12 #include <__algorithm/comp.h>
13 #include <__algorithm/comp_ref_type.h>
14 #include <__algorithm/iterator_operations.h>
15 #include <__algorithm/pop_heap.h>
16 #include <__config>
17 #include <__debug_utils/strict_weak_ordering_check.h>
18 #include <__iterator/iterator_traits.h>
19 #include <__type_traits/is_copy_assignable.h>
20 #include <__type_traits/is_copy_constructible.h>
21 #include <__utility/move.h>
22 
23 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
24 #  pragma GCC system_header
25 #endif
26 
27 _LIBCPP_BEGIN_NAMESPACE_STD
28 
29 template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
30 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14
31 void __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) {
32   _RandomAccessIterator __saved_last = __last;
33   __comp_ref_type<_Compare> __comp_ref = __comp;
34 
35   using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
36   for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n)
37     std::__pop_heap<_AlgPolicy>(__first, __last, __comp_ref, __n);
38   std::__check_strict_weak_ordering_sorted(__first, __saved_last, __comp_ref);
39 }
40 
41 template <class _RandomAccessIterator, class _Compare>
42 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
43 void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
44   static_assert(std::is_copy_constructible<_RandomAccessIterator>::value, "Iterators must be copy constructible.");
45   static_assert(std::is_copy_assignable<_RandomAccessIterator>::value, "Iterators must be copy assignable.");
46 
47   std::__sort_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp);
48 }
49 
50 template <class _RandomAccessIterator>
51 inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
52 void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
53   std::sort_heap(std::move(__first), std::move(__last), __less<>());
54 }
55 
56 _LIBCPP_END_NAMESPACE_STD
57 
58 #endif // _LIBCPP___ALGORITHM_SORT_HEAP_H
59