#ifndef SPROUT_NUMERIC_DFT_FIXED_IDFT_HPP #define SPROUT_NUMERIC_DFT_FIXED_IDFT_HPP #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::result_of::algorithm::type idft_impl_ra( RandomAccessIterator first, RandomAccessIterator last, Result const& result, 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, size, (Indexes >= offset && sprout::math::less(Indexes, offset + size) && sprout::math::less(Indexes, offset + input_size) ? sprout::detail::idft_element_impl(first, last, Indexes - offset, input_size) : *sprout::next(sprout::internal_begin(result), Indexes) )... ); } template inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm::type idft( RandomAccessIterator first, RandomAccessIterator last, Result const& result, std::random_access_iterator_tag* ) { return sprout::fixed::detail::idft_impl_ra( first, last, result, 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::result_of::algorithm::type >::type idft_impl( ForwardIterator, ForwardIterator, Result const& result, typename sprout::container_traits::size_type, ForwardIterator, typename sprout::container_traits::difference_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::result_of::algorithm::type >::type idft_impl( ForwardIterator first, ForwardIterator last, Result const& result, typename sprout::container_traits::size_type size, ForwardIterator first_, typename sprout::container_traits::difference_type i, Args const&... args ) { return first != last && sizeof...(Args) < size ? sprout::fixed::detail::idft_impl( sprout::next(first), last, result, size, first_, i + 1, args..., sprout::detail::idft_element_impl(first_, last, i, size) ) : sprout::detail::container_complate(result, args...) ; } template inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm::type idft( ForwardIterator first, ForwardIterator last, Result const& result, std::forward_iterator_tag* ) { return sprout::fixed::detail::idft_impl(first, last, result, sprout::size(result), first, 0); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_fixed_container::value, typename sprout::fixed::result_of::algorithm::type >::type idft(ForwardIterator first, ForwardIterator last, Result const& result) { typedef typename std::iterator_traits::iterator_category* category; return sprout::fixed::detail::idft(first, last, result, category()); } template inline SPROUT_CONSTEXPR typename std::enable_if< !sprout::is_fixed_container::value, typename sprout::fixed::result_of::algorithm::type >::type idft(ForwardIterator first, ForwardIterator last, Result const& result) { return sprout::remake( result, sprout::size(result), sprout::make_idft_iterator(first, last), sprout::make_idft_iterator(first, last, sprout::distance(first, last)) ); } } // namespace detail // // idft // template inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm::type idft(ForwardIterator first, ForwardIterator last, Result const& result) { return sprout::fixed::detail::idft(first, last, result); } template inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm::type idft(ForwardIterator first, ForwardIterator last) { return sprout::fixed::idft(first, last, sprout::pit()); } } // namespace fixed using sprout::fixed::idft; } // namespace sprout #endif // #ifndef SPROUT_NUMERIC_DFT_FIXED_IDFT_HPP