1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/algorithm/fixed/push_heap.hpp

76 lines
2.6 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
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)
=============================================================================*/
2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_PUSH_HEAP_HPP
#define SPROUT_ALGORITHM_FIXED_PUSH_HEAP_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2011-09-01 02:48:32 +00:00
#include <sprout/algorithm/fixed/swap_element.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
template<typename Container, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
push_heap_impl(
Container const& cont, Compare comp,
typename sprout::container_traits<Container>::difference_type offset,
typename sprout::container_traits<Container>::difference_type n
2011-09-01 02:48:32 +00:00
)
{
return n != 0
&& comp(
*sprout::next(sprout::internal_begin(cont), offset + (n - 1) / 2),
*sprout::next(sprout::internal_begin(cont), offset + n)
)
2011-09-01 02:48:32 +00:00
? sprout::fixed::detail::push_heap_impl(
2011-10-01 15:19:13 +00:00
sprout::fixed::swap_element(
cont,
sprout::next(sprout::internal_begin(cont), offset + (n - 1) / 2),
sprout::next(sprout::internal_begin(cont), offset + n)
2011-10-01 15:19:13 +00:00
),
2011-09-01 02:48:32 +00:00
comp,
offset,
(n - 1) / 2
)
: sprout::deep_copy(cont)
2011-09-01 02:48:32 +00:00
;
}
} // namespace detail
//
// push_heap
//
template<typename Container, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
push_heap(Container const& cont, Compare comp) {
2011-09-01 02:48:32 +00:00
return sprout::fixed::detail::push_heap_impl(
cont, comp,
sprout::internal_begin_offset(cont),
2011-09-01 02:48:32 +00:00
sprout::size(cont) - 1
);
}
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
push_heap(Container const& cont) {
2011-09-01 02:48:32 +00:00
return sprout::fixed::detail::push_heap_impl(
cont, NS_SSCRISK_CEL_OR_SPROUT::less<typename sprout::container_traits<Container>::value_type>(),
sprout::internal_begin_offset(cont),
2011-09-01 02:48:32 +00:00
sprout::size(cont) - 1
);
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::push_heap;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_PUSH_HEAP_HPP