mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-16 15:14:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

support STL container: numeric, numeric/dft

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-02-01 20:21:01 +09:00
parent 092910e2f7
commit aace49ac65
51 changed files with 812 additions and 101 deletions
Download patch file Download diff file Expand all files Collapse all files

108
sprout/numeric/dft/fixed/dft.hpp
View file

@ -1,21 +1,27 @@
#ifndef SPROUT_NUMERIC_DFT_FIXED_DFT_HPP
#define SPROUT_NUMERIC_DFT_FIXED_DFT_HPP
#include <iterator>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/dft_iterator.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/pit.hpp>
#include <sprout/math/comparison.hpp>
#include <sprout/numeric/dft/dft_element.hpp>
#include <sprout/detail/container_complate.hpp>
namespace sprout {
namespace fixed {
namespace detail {
template<typename InputIterator, typename Result, sprout::index_t... Indexes>
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft_impl(
InputIterator first, InputIterator last, Result const& result,
dft_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -23,36 +29,110 @@ namespace sprout {
)
{
return sprout::remake<Result>(
result,
size,
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
result, size,
(Indexes >= offset && sprout::math::less(Indexes, offset + size) && sprout::math::less(Indexes, offset + input_size)
? sprout::detail::dft_element_impl(first, last, Indexes - offset, input_size)
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);
}
template<typename InputIterator, typename Result>
template<typename RandomAccessIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft(InputIterator first, InputIterator last, Result const& result) {
return sprout::fixed::detail::dft_impl(
first,
last,
result,
dft(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
std::random_access_iterator_tag*
)
{
return sprout::fixed::detail::dft_impl_ra(
first, last, result,
sprout::index_range<0, sprout::container_traits<Result>::static_size>::make(),
sprout::internal_begin_offset(result),
sprout::size(result),
sprout::distance(first, last)
);
}
template<typename ForwardIterator, typename Result, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
dft_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator first_, typename sprout::container_traits<Result>::difference_type i,
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args...);
}
template<typename ForwardIterator, typename Result, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
dft_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator first_, typename sprout::container_traits<Result>::difference_type i,
Args const&... args
)
{
return first != last && sizeof...(Args) < size
? sprout::fixed::detail::dft_impl(
sprout::next(first), last, result, size, first_, i + 1,
args..., sprout::detail::dft_element_impl(first_, last, i, size)
)
: sprout::detail::container_complate(result, args...)
;
}
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft(
ForwardIterator first, ForwardIterator last, Result const& result,
void*
)
{
return sprout::fixed::detail::dft_impl(first, last, result, sprout::size(result), first, 0);
}
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
dft(ForwardIterator first, ForwardIterator last, Result const& result) {
typedef typename std::iterator_traits<ForwardIterator>::iterator_category* category;
return sprout::fixed::detail::dft(first, last, result, category());
}
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
dft(ForwardIterator first, ForwardIterator last, Result const& result) {
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_dft_iterator(first, last),
sprout::make_dft_iterator(first, last, sprout::distance(first, last))
);
}
} // namespace detail
//
// dft
//
template<typename InputIterator, typename Result>
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft(InputIterator first, InputIterator last, Result const& result) {
dft(ForwardIterator first, ForwardIterator last, Result const& result) {
return sprout::fixed::detail::dft(first, last, result);
}
template<typename Result, typename ForwardIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft(ForwardIterator first, ForwardIterator last) {
return sprout::fixed::dft(first, last, sprout::pit<Result>());
}
} // namespace fixed
using sprout::fixed::dft;