forked from OSchip/llvm-project
57 lines
2.1 KiB
C++
57 lines
2.1 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_MAKE_HEAP_H
|
|
#define _LIBCPP___ALGORITHM_MAKE_HEAP_H
|
|
|
|
#include <__algorithm/comp.h>
|
|
#include <__algorithm/comp_ref_type.h>
|
|
#include <__algorithm/sift_down.h>
|
|
#include <__config>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _Compare, class _RandomAccessIterator>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX11
|
|
void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) {
|
|
using _CompRef = typename __comp_ref_type<_Compare>::type;
|
|
_CompRef __comp_ref = __comp;
|
|
|
|
using difference_type = typename iterator_traits<_RandomAccessIterator>::difference_type;
|
|
difference_type __n = __last - __first;
|
|
if (__n > 1) {
|
|
// start from the first parent, there is no need to consider children
|
|
for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) {
|
|
std::__sift_down<_CompRef>(__first, __comp_ref, __n, __first + __start);
|
|
}
|
|
}
|
|
}
|
|
|
|
template <class _RandomAccessIterator, class _Compare>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
|
|
std::__make_heap(std::move(__first), std::move(__last), __comp);
|
|
}
|
|
|
|
template <class _RandomAccessIterator>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
|
|
std::make_heap(std::move(__first), std::move(__last),
|
|
__less<typename iterator_traits<_RandomAccessIterator>::value_type>());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_MAKE_HEAP_H
|