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

72 lines
2.8 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2015-01-10 10:13:57 +00:00
Copyright (c) 2011-2015 Bolero MURAKAMI
2013-08-08 09:54:33 +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)
=============================================================================*/
2011-09-03 13:26:26 +00:00
#ifndef SPROUT_ALGORITHM_FIT_INPLACE_MERGE_HPP
#define SPROUT_ALGORITHM_FIT_INPLACE_MERGE_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/inplace_merge.hpp>
#include <sprout/algorithm/fit/results.hpp>
2013-08-08 09:54:33 +00:00
#include <sprout/sub_array/sub_array.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/sub_array/sub.hpp>
2011-09-03 13:26:26 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename Container, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Container>::type
inplace_merge_impl(
Container const& cont, typename sprout::container_traits<Container>::const_iterator middle, Compare comp,
typename sprout::container_traits<Container>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::inplace_merge(cont, middle, comp)),
2011-09-03 13:26:26 +00:00
offset,
offset + sprout::size(cont)
);
}
} // namespace detail
//
// inplace_merge
//
template<typename Container, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Container>::type
inplace_merge(Container const& cont, typename sprout::container_traits<Container>::const_iterator middle, Compare comp) {
return sprout::fit::detail::inplace_merge_impl(cont, middle, comp, sprout::internal_begin_offset(cont));
2011-09-03 13:26:26 +00:00
}
namespace detail {
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Container>::type
inplace_merge_impl(
Container const& cont, typename sprout::container_traits<Container>::const_iterator middle,
typename sprout::container_traits<Container>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::inplace_merge(cont, middle)),
2011-09-03 13:26:26 +00:00
offset,
offset + sprout::size(cont)
);
}
} // namespace detail
//
// inplace_merge
//
template<typename Container>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Container>::type
inplace_merge(Container const& cont, typename sprout::container_traits<Container>::const_iterator middle) {
return sprout::fit::detail::inplace_merge_impl(cont, middle, sprout::internal_begin_offset(cont));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_INPLACE_MERGE_HPP