Sprout/sprout/algorithm/fixed/pop_heap.hpp

93 lines
3.3 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_POP_HEAP_HPP
#define SPROUT_ALGORITHM_FIXED_POP_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
pop_heap_impl(
2011-09-01 02:48:32 +00:00
Container const& cont,
Compare comp,
typename sprout::container_traits<Container>::difference_type offset,
typename sprout::container_traits<Container>::difference_type size,
typename sprout::container_traits<Container>::difference_type n = 0,
typename sprout::container_traits<Container>::difference_type l = 1,
typename sprout::container_traits<Container>::difference_type r = 2
2011-09-01 02:48:32 +00:00
)
{
return r < size
&& comp(*sprout::next(sprout::internal_begin(cont), offset + l), *sprout::next(sprout::internal_begin(cont), offset + r))
? comp(*sprout::next(sprout::internal_begin(cont), offset + n), *sprout::next(sprout::internal_begin(cont), offset + r))
2011-09-01 02:48:32 +00:00
? sprout::fixed::detail::pop_heap_impl(
2011-10-01 15:19:13 +00:00
sprout::fixed::swap_element(
cont,
sprout::next(sprout::internal_begin(cont), offset + n),
sprout::next(sprout::internal_begin(cont), offset + r)
2011-10-01 15:19:13 +00:00
),
2011-09-01 02:48:32 +00:00
comp,
offset,
size,
r,
r * 2 + 1,
r * 2 + 2
)
: sprout::deep_copy(cont)
2011-09-01 02:48:32 +00:00
: l < size
? comp(*sprout::next(sprout::internal_begin(cont), offset + n), *sprout::next(sprout::internal_begin(cont), offset + l))
2011-09-01 02:48:32 +00:00
? sprout::fixed::detail::pop_heap_impl(
2011-10-01 15:19:13 +00:00
sprout::fixed::swap_element(
cont,
sprout::next(sprout::internal_begin(cont), offset + n),
sprout::next(sprout::internal_begin(cont), offset + l)
2011-10-01 15:19:13 +00:00
),
2011-09-01 02:48:32 +00:00
comp,
offset,
size,
l,
l * 2 + 1,
l * 2 + 2
)
: sprout::deep_copy(cont)
: sprout::deep_copy(cont)
2011-09-01 02:48:32 +00:00
;
}
} // namespace detail
//
// pop_heap
//
template<typename Container, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
pop_heap(Container const& cont, Compare comp) {
2011-09-01 02:48:32 +00:00
return sprout::fixed::detail::pop_heap_impl(
sprout::fixed::swap_element(cont, sprout::begin(cont), sprout::end(cont) - 1),
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
pop_heap(Container const& cont) {
2011-09-01 02:48:32 +00:00
return sprout::fixed::detail::pop_heap_impl(
sprout::fixed::swap_element(cont, sprout::begin(cont), sprout::end(cont) - 1),
2012-04-01 13:15:09 +00:00
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::pop_heap;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_POP_HEAP_HPP