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>
|
2012-03-31 07:24:13 +00:00
|
|
|
#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>
|
|
|
|
#include <sprout/detail/overlap_count.hpp>
|
|
|
|
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT_DETAIL
|
|
|
|
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT_DETAIL
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace fit {
|
|
|
|
namespace detail {
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator, typename Result>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type unique_copy_impl(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
2011-09-03 13:26:26 +00:00
|
|
|
Result const& result,
|
2012-03-31 07:24:13 +00:00
|
|
|
typename sprout::container_traits<Result>::difference_type offset
|
2011-09-03 13:26:26 +00:00
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::sub_copy(
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::get_internal(sprout::fixed::unique_copy(first, last, result)),
|
2011-09-03 13:26:26 +00:00
|
|
|
offset,
|
|
|
|
offset + NS_SSCRISK_CEL_OR_SPROUT_DETAIL::min(NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(first, last) - sprout::detail::overlap_count(first, last), sprout::size(result))
|
|
|
|
);
|
|
|
|
}
|
|
|
|
} // namespace detail
|
|
|
|
//
|
|
|
|
// unique_copy
|
|
|
|
//
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator, typename Result>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type unique_copy(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
2011-09-03 13:26:26 +00:00
|
|
|
Result const& result
|
|
|
|
)
|
|
|
|
{
|
2012-03-31 07:24:13 +00:00
|
|
|
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 {
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator, typename Result, typename BinaryPredicate>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type unique_copy_impl(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
2011-09-03 13:26:26 +00:00
|
|
|
Result const& result,
|
|
|
|
BinaryPredicate pred,
|
2012-03-31 07:24:13 +00:00
|
|
|
typename sprout::container_traits<Result>::difference_type offset
|
2011-09-03 13:26:26 +00:00
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::sub_copy(
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::get_internal(sprout::fixed::unique_copy(first, last, result, pred)),
|
2011-09-03 13:26:26 +00:00
|
|
|
offset,
|
|
|
|
offset + NS_SSCRISK_CEL_OR_SPROUT_DETAIL::min(NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(first, last) - sprout::detail::overlap_count(first, last, pred), sprout::size(result))
|
|
|
|
);
|
|
|
|
}
|
|
|
|
} // namespace detail
|
|
|
|
//
|
|
|
|
// unique_copy
|
|
|
|
//
|
2011-10-07 07:40:45 +00:00
|
|
|
template<typename InputIterator, typename Result, typename BinaryPredicate>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::algorithm<Result>::type unique_copy(
|
2011-10-07 07:40:45 +00:00
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
2011-09-03 13:26:26 +00:00
|
|
|
Result const& result,
|
|
|
|
BinaryPredicate pred
|
|
|
|
)
|
|
|
|
{
|
2012-03-31 07:24:13 +00:00
|
|
|
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
|