Sprout/sprout/algorithm/fit/unique_copy.hpp

79 lines
2.8 KiB
C++
Raw Normal View History

2011-09-03 13:26:26 +00:00
#ifndef SPROUT_ALGORITHM_FIT_UNIQUE_COPY_HPP
#define SPROUT_ALGORITHM_FIT_UNIQUE_COPY_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/unique_copy.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array.hpp>
2012-06-23 23:22:12 +00:00
#include <sprout/detail/algorithm/overlap_count.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
2011-09-03 13:26:26 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type unique_copy_impl(
InputIterator first,
InputIterator last,
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::unique_copy(first, last, 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(NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) - sprout::detail::overlap_count(first, last), sprout::size(result))
2011-09-03 13:26:26 +00:00
);
}
} // namespace detail
//
// unique_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type unique_copy(
InputIterator first,
InputIterator last,
2011-09-03 13:26:26 +00:00
Result const& result
)
{
return sprout::fit::detail::unique_copy_impl(first, last, result, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
namespace detail {
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type unique_copy_impl(
InputIterator first,
InputIterator last,
2011-09-03 13:26:26 +00:00
Result const& result,
BinaryPredicate pred,
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::unique_copy(first, last, result, pred)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) - sprout::detail::overlap_count(first, last, pred), sprout::size(result))
2011-09-03 13:26:26 +00:00
);
}
} // namespace detail
//
// unique_copy
//
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type unique_copy(
InputIterator first,
InputIterator last,
2011-09-03 13:26:26 +00:00
Result const& result,
BinaryPredicate pred
)
{
return sprout::fit::detail::unique_copy_impl(first, last, result, pred, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_UNIQUE_COPY_HPP