/*============================================================================= Copyright (c) 2011-2019 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) =============================================================================*/ #ifndef SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP #define SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP #include #include #include #include #include #include #include #include #include #include #include #include namespace sprout { namespace fixed { namespace detail { template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size == sizeof...(Args) + 1, typename sprout::fixed::results::algorithm::type >::type unique_copy_impl( InputIterator const&, InputIterator const&, Result const& result, typename sprout::container_traits::size_type, Head const& head, Args const&... args ) { return sprout::remake(result, sprout::size(result), args..., head); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size != sizeof...(Args) + 1, typename sprout::fixed::results::algorithm::type >::type unique_copy_impl( InputIterator const& first, InputIterator const& last, Result const& result, typename sprout::container_traits::size_type size, Head const& head, Args const&... args ) { return first != last && sizeof...(Args) + 1 < size ? !(head == *first) ? 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) ; } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type unique_copy(InputIterator const& first, InputIterator const& 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 inline SPROUT_CONSTEXPR typename std::enable_if< !sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type unique_copy(InputIterator const& first, InputIterator const& last, Result const& result) { static_assert(sprout::is_forward_iterator::value, "Sorry, not implemented."); return sprout::remake( result, sprout::size(result), sprout::make_unique_iterator(first, last), sprout::make_unique_iterator(last, last) ); } } // namespace detail // // unique_copy // template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last, Result const& result) { return sprout::fixed::detail::unique_copy(first, last, result); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last) { return sprout::fixed::unique_copy(first, last, sprout::pit()); } namespace detail { template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size == sizeof...(Args) + 1, typename sprout::fixed::results::algorithm::type >::type unique_copy_impl( InputIterator const&, InputIterator const&, Result const& result, BinaryPredicate, typename sprout::container_traits::size_type, Head const& head, Args const&... args ) { return sprout::remake(result, sprout::size(result), args..., head); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size != sizeof...(Args) + 1, typename sprout::fixed::results::algorithm::type >::type unique_copy_impl( InputIterator const& first, InputIterator const& last, Result const& result, BinaryPredicate pred, typename sprout::container_traits::size_type size, Head const& head, Args const&... args ) { return first != last && sizeof...(Args) + 1 < size ? !pred(head, *first) ? 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) ; } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type unique_copy(InputIterator const& first, InputIterator const& 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 inline SPROUT_CONSTEXPR typename std::enable_if< !sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type unique_copy(InputIterator const& first, InputIterator const& last, Result const& result, BinaryPredicate pred) { static_assert(sprout::is_forward_iterator::value, "Sorry, not implemented."); return sprout::remake( result, sprout::size(result), sprout::make_unique_iterator(pred, first, last), sprout::make_unique_iterator(pred, last, last) ); } } // namespace detail // // unique_copy // template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) { return sprout::fixed::detail::unique_copy(first, last, result, pred); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last, BinaryPredicate pred) { return sprout::fixed::unique_copy(first, last, sprout::pit(), pred); } } // namespace fixed template< typename InputIterator, typename Result, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last, Result const& result) { return sprout::fixed::unique_copy(first, last, result); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last) { return sprout::fixed::unique_copy(first, last); } template< typename InputIterator, typename Result, typename BinaryPredicate, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::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::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type unique_copy(InputIterator first, InputIterator last, BinaryPredicate pred) { return sprout::fixed::unique_copy(first, last, pred); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP