2014-04-06 09:37:06 +00:00
|
|
|
/*=============================================================================
|
2016-02-25 09:48:28 +00:00
|
|
|
Copyright (c) 2011-2016 Bolero MURAKAMI
|
2014-04-06 09:37:06 +00:00
|
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
|
|
|
|
|
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
|
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
|
=============================================================================*/
|
|
|
|
|
#ifndef SPROUT_ALGORITHM_CXX14_PUSH_HEAP_HPP
|
|
|
|
|
#define SPROUT_ALGORITHM_CXX14_PUSH_HEAP_HPP
|
|
|
|
|
|
|
|
|
|
#include <iterator>
|
|
|
|
|
#include <type_traits>
|
|
|
|
|
#include <sprout/config.hpp>
|
|
|
|
|
#include <sprout/algorithm/cxx14/detail/heap_tool.hpp>
|
|
|
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
|
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
|
//
|
|
|
|
|
// 25.4.6.1 push_heap
|
|
|
|
|
//
|
|
|
|
|
template<typename RandomAccessIterator, typename Compare>
|
|
|
|
|
inline SPROUT_CXX14_CONSTEXPR void
|
|
|
|
|
push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp) {
|
|
|
|
|
typedef typename std::add_lvalue_reference<Compare>::type compare_ref;
|
|
|
|
|
sprout::detail::push_heap_back<compare_ref>(first, last, comp, last - first);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename RandomAccessIterator>
|
|
|
|
|
inline SPROUT_CXX14_CONSTEXPR void
|
|
|
|
|
push_heap(RandomAccessIterator first, RandomAccessIterator last) {
|
|
|
|
|
sprout::push_heap(
|
|
|
|
|
first, last,
|
|
|
|
|
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<RandomAccessIterator>::value_type>()
|
|
|
|
|
);
|
|
|
|
|
}
|
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_PUSH_HEAP_HPP
|
