Sprout/sprout/algorithm/fit/merge.hpp

95 lines
3.3 KiB
C++
Raw Normal View History

2011-09-03 13:26:26 +00:00
#ifndef SPROUT_ALGORITHM_FIT_MERGE_HPP
#define SPROUT_ALGORITHM_FIT_MERGE_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/distance.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/merge.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
#include <sprout/iterator/type_traits/is_iterator.hpp>
2011-09-03 13:26:26 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
merge_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::merge(first1, last1, first2, last2, result, comp)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(
sprout::distance(first1, last1) + sprout::distance(first2, last2),
2011-09-03 13:26:26 +00:00
sprout::size(result)
)
);
}
} // namespace detail
//
// merge
//
template<typename InputIterator1, typename InputIterator2, typename Result, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
2011-09-03 13:26:26 +00:00
)
{
static_assert(
sprout::is_forward_iterator<InputIterator1>::value && sprout::is_forward_iterator<InputIterator2>::value,
"Sorry, not implemented."
);
return sprout::fit::detail::merge_impl(first1, last1, first2, last2, result, comp, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
namespace detail {
template<typename InputIterator1, typename InputIterator2, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
merge_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
2011-09-03 13:26:26 +00:00
Result const& result,
typename sprout::container_traits<Result>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::merge(first1, last1, first2, last2, result)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(
sprout::distance(first1, last1) + sprout::distance(first2, last2),
2011-09-03 13:26:26 +00:00
sprout::size(result)
)
);
}
} // namespace detail
//
// merge
//
template<typename InputIterator1, typename InputIterator2, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
2011-09-03 13:26:26 +00:00
Result const& result
)
{
static_assert(
sprout::is_forward_iterator<InputIterator1>::value && sprout::is_forward_iterator<InputIterator2>::value,
"Sorry, not implemented."
);
return sprout::fit::detail::merge_impl(first1, last1, first2, last2, result, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_MERGE_HPP