Sprout/sprout/algorithm/fixed/unique_copy.hpp

218 lines
9.2 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
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-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/unique_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/pit/pit.hpp>
2011-10-28 12:45:00 +00:00
#include <sprout/detail/container_complate.hpp>
2013-02-26 07:14:04 +00:00
#include <sprout/iterator/type_traits/category.hpp>
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
template<typename InputIterator, typename Result, typename Head, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args) + 1,
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
2013-07-22 13:00:09 +00:00
InputIterator, InputIterator,
2011-09-01 02:48:32 +00:00
Result const& result,
2013-07-22 13:00:09 +00:00
typename sprout::container_traits<Result>::size_type,
2011-09-01 02:48:32 +00:00
Head const& head,
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args..., head);
2011-09-01 02:48:32 +00:00
}
template<typename InputIterator, typename Result, typename Head, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args) + 1,
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
InputIterator first, InputIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
typename sprout::container_traits<Result>::size_type size,
2011-09-01 02:48:32 +00:00
Head const& head,
Args const&... args
)
{
2011-10-28 12:45:00 +00:00
return first != last && sizeof...(Args) + 1 < size
2011-09-01 02:48:32 +00:00
? !(head == *first)
2011-10-28 12:45:00 +00:00
? unique_copy_impl(sprout::next(first), last, result, size, *first, args..., head)
: unique_copy_impl(sprout::next(first), last, result, size, head, args...)
: sprout::detail::container_complate(result, args..., head)
2011-09-01 02:48:32 +00:00
;
}
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result) {
return first != last
? sprout::fixed::detail::unique_copy_impl(sprout::next(first), last, result, sprout::size(result), *first)
: sprout::detail::container_complate(result)
;
}
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(first, last),
sprout::make_unique_iterator(last, last)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// unique_copy
//
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, Result const& result) {
return sprout::fixed::detail::unique_copy(first, last, result);
2011-09-01 02:48:32 +00:00
}
2013-01-25 06:14:29 +00:00
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last) {
return sprout::fixed::unique_copy(first, last, sprout::pit<Result>());
}
2011-09-01 02:48:32 +00:00
namespace detail {
template<typename InputIterator, typename Result, typename BinaryPredicate, typename Head, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args) + 1,
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
2013-07-22 13:00:09 +00:00
InputIterator, InputIterator,
Result const& result, BinaryPredicate,
typename sprout::container_traits<Result>::size_type,
2011-09-01 02:48:32 +00:00
Head const& head,
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args..., head);
2011-09-01 02:48:32 +00:00
}
template<typename InputIterator, typename Result, typename BinaryPredicate, typename Head, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args) + 1,
2011-09-03 13:26:26 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
InputIterator first, InputIterator last,
Result const& result, BinaryPredicate pred,
typename sprout::container_traits<Result>::size_type size,
2011-09-01 02:48:32 +00:00
Head const& head,
Args const&... args
)
{
2011-10-28 12:45:00 +00:00
return first != last && sizeof...(Args) + 1 < size
2011-09-01 02:48:32 +00:00
? !pred(head, *first)
2011-10-28 12:45:00 +00:00
? sprout::fixed::detail::unique_copy_impl(sprout::next(first), last, result, pred, size, *first, args..., head)
: sprout::fixed::detail::unique_copy_impl(sprout::next(first), last, result, pred, size, head, args...)
: sprout::detail::container_complate(result, args..., head)
2011-09-01 02:48:32 +00:00
;
}
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) {
return first != last
? sprout::fixed::detail::unique_copy_impl(sprout::next(first), last, result, pred, sprout::size(result), *first)
: sprout::detail::container_complate(result)
;
}
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(pred, first, last),
sprout::make_unique_iterator(pred, last, last)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// unique_copy
//
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) {
return sprout::fixed::detail::unique_copy(first, last, result, pred);
2011-09-01 02:48:32 +00:00
}
2013-01-20 11:49:37 +00:00
template<typename Result, typename InputIterator, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, BinaryPredicate pred) {
return sprout::fixed::unique_copy(first, last, sprout::pit<Result>(), pred);
}
2011-09-01 02:48:32 +00:00
} // namespace fixed
2011-09-03 13:26:26 +00:00
template<
typename InputIterator, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, Result const& result) {
return sprout::fixed::unique_copy(first, last, result);
}
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last) {
return sprout::fixed::unique_copy<Result>(first, last);
}
template<
typename InputIterator, typename Result, typename BinaryPredicate,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) {
return sprout::fixed::unique_copy(first, last, result, pred);
}
template<
typename Result, typename InputIterator, typename BinaryPredicate,
typename sprout::enabler_if<!sprout::is_iterator_outputable<BinaryPredicate>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy(InputIterator first, InputIterator last, BinaryPredicate pred) {
return sprout::fixed::unique_copy<Result>(first, last, pred);
}
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP