/*============================================================================= Copyright (c) 2011-2017 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_TRANSFORM_HPP #define SPROUT_ALGORITHM_FIXED_TRANSFORM_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace sprout { namespace fixed { namespace detail { template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform_impl_ra( RandomAccessIterator const& first, RandomAccessIterator const&, Result const& result, UnaryOperation op, sprout::index_tuple, typename sprout::container_traits::difference_type offset, typename sprout::container_traits::size_type size, typename sprout::container_traits::size_type input_size ) { return sprout::remake( result, sprout::size(result), (Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size ? op(*sprout::next(first, Indexes - offset)) : *sprout::next(sprout::internal_begin(result), Indexes) )... ); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform( RandomAccessIterator const& first, RandomAccessIterator const& last, Result const& result, UnaryOperation op, std::random_access_iterator_tag* ) { return sprout::fixed::detail::transform_impl_ra( first, last, result, op, sprout::container_indexes::make(), sprout::internal_begin_offset(result), sprout::size(result), sprout::distance(first, last) ); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size == sizeof...(Args), typename sprout::fixed::results::algorithm::type >::type transform_impl( InputIterator, InputIterator, Result const& result, UnaryOperation, typename sprout::container_traits::size_type, Args const&... args ) { return sprout::remake(result, sprout::size(result), args...); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size != sizeof...(Args), typename sprout::fixed::results::algorithm::type >::type transform_impl( InputIterator const& first, InputIterator const& last, Result const& result, UnaryOperation op, typename sprout::container_traits::size_type size, Args const&... args ) { return first != last && sizeof...(Args) < size ? sprout::fixed::detail::transform_impl(sprout::next(first), last, result, op, size, args..., op(*first)) : sprout::detail::container_complate(result, args...) ; } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform( InputIterator const& first, InputIterator const& last, Result const& result, UnaryOperation op, std::input_iterator_tag* ) { return sprout::fixed::detail::transform_impl(first, last, result, op, sprout::size(result)); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type transform(InputIterator const& first, InputIterator const& last, Result const& result, UnaryOperation op) { typedef typename std::iterator_traits::iterator_category* category; return sprout::fixed::detail::transform(first, last, result, op, category()); } template inline SPROUT_CONSTEXPR typename std::enable_if< !sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type transform(InputIterator const& first, InputIterator const& last, Result const& result, UnaryOperation op) { return sprout::remake( result, sprout::size(result), sprout::make_transform_iterator(first, op), sprout::make_transform_iterator(last, op) ); } } // namespace detail // // transform // template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator first, InputIterator last, Result const& result, UnaryOperation op) { return sprout::fixed::detail::transform(first, last, result, op); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator first, InputIterator last, UnaryOperation op) { return sprout::fixed::transform(first, last, sprout::pit(), op); } namespace detail { template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform_impl_ra( RandomAccessIterator1 const& first1, RandomAccessIterator1 const&, RandomAccessIterator2 first2, Result const& result, BinaryOperation op, sprout::index_tuple, typename sprout::container_traits::difference_type offset, typename sprout::container_traits::size_type size, typename sprout::container_traits::size_type input_size ) { return sprout::remake( result, sprout::size(result), (Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size ? op(*sprout::next(first1, Indexes - offset), *sprout::next(first2, Indexes - offset)) : *sprout::next(sprout::internal_begin(result), Indexes) )... ); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform( RandomAccessIterator1 const& first1, RandomAccessIterator1 const& last1, RandomAccessIterator2 first2, Result const& result, BinaryOperation op, std::random_access_iterator_tag* ) { return sprout::fixed::detail::transform_impl_ra( first1, last1, first2, result, op, sprout::container_indexes::make(), sprout::internal_begin_offset(result), sprout::size(result), sprout::distance(first1, last1) ); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size == sizeof...(Args), typename sprout::fixed::results::algorithm::type >::type transform_impl( InputIterator1, InputIterator1, InputIterator2, Result const& result, BinaryOperation, typename sprout::container_traits::size_type, Args const&... args ) { return sprout::remake(result, sprout::size(result), args...); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::container_traits::static_size != sizeof...(Args), typename sprout::fixed::results::algorithm::type >::type transform_impl( InputIterator1 const& first1, InputIterator1 const& last1, InputIterator2 first2, Result const& result, BinaryOperation op, typename sprout::container_traits::size_type size, Args const&... args ) { return first1 != last1 && sizeof...(Args) < size ? sprout::fixed::detail::transform_impl(sprout::next(first1), last1, sprout::next(first2), result, op, size, args..., op(*first1, *first2)) : sprout::detail::container_complate(result, args...) ; } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform( InputIterator1 const& first1, InputIterator1 const& last1, InputIterator2 first2, Result const& result, BinaryOperation op, std::input_iterator_tag* ) { return sprout::fixed::detail::transform_impl(first1, last1, first2, result, op, sprout::size(result)); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type transform(InputIterator1 const& first1, InputIterator1 const& last1, InputIterator2 const& first2, Result const& result, BinaryOperation op) { typedef typename sprout::common_iterator_category::type* category; return sprout::fixed::detail::transform(first1, last1, first2, result, op, category()); } template inline SPROUT_CONSTEXPR typename std::enable_if< !sprout::is_fixed_container::value, typename sprout::fixed::results::algorithm::type >::type transform(InputIterator1 const& first1, InputIterator1 const& last1, InputIterator2 const& first2, Result const& result, BinaryOperation op) { return sprout::remake( result, sprout::size(result), sprout::make_transform_iterator(first1, first2, op), sprout::make_transform_iterator(last1, first2, op) ); } } // namespace detail // // transform // template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Result const& result, BinaryOperation op) { return sprout::fixed::detail::transform(first1, last1, first2, result, op); } template inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryOperation op) { return sprout::fixed::transform(first1, last1, first2, sprout::pit(), op); } } // namespace fixed template< typename InputIterator, typename Result, typename UnaryOperation, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator first, InputIterator last, Result const& result, UnaryOperation op) { return sprout::fixed::transform(first, last, result, op); } template< typename Result, typename InputIterator, typename UnaryOperation, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator first, InputIterator last, UnaryOperation op) { return sprout::fixed::transform(first, last, op); } template< typename InputIterator1, typename InputIterator2, typename Result, typename BinaryOperation, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Result const& result, BinaryOperation op) { return sprout::fixed::transform(first1, last1, first2, result, op); } template< typename Result, typename InputIterator1, typename InputIterator2, typename BinaryOperation, typename sprout::enabler_if::value>::type = sprout::enabler > inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm::type transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryOperation op) { return sprout::fixed::transform(first1, last1, first2, op); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_FIXED_TRANSFORM_HPP