Sprout/sprout/numeric/dft/fit/dft.hpp

50 lines
1.8 KiB
C++
Raw Normal View History

2012-04-10 03:54:38 +00:00
#ifndef SPROUT_NUMERIC_DFT_FIT_DFT_HPP
#define SPROUT_NUMERIC_DFT_FIT_DFT_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/distance.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2012-04-10 03:54:38 +00:00
#include <sprout/numeric/dft/fixed/dft.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
#include <sprout/pit/pit.hpp>
2013-01-11 19:08:44 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
namespace sprout {
namespace fit {
namespace detail {
template<typename ForwardIterator, typename Result>
2012-10-06 04:53:07 +00:00
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
dft_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::dft(first, last, result)),
offset,
offset + NS_SSCRISK_CEL_OR_SPROUT::min(sprout::distance(first, last), sprout::size(result))
);
}
} // namespace detail
//
// dft
//
template<typename ForwardIterator, typename Result>
2012-10-06 04:53:07 +00:00
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
dft(ForwardIterator first, ForwardIterator last, Result const& result) {
return sprout::fit::detail::dft_impl(first, last, result, sprout::internal_begin_offset(result));
}
template<typename Result, typename ForwardIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
dft(ForwardIterator first, ForwardIterator last) {
return sprout::fit::dft(first, last, sprout::pit<Result>());
}
} // namespace fit
} // namespace sprout
2012-04-10 03:54:38 +00:00
#endif // #ifndef SPROUT_NUMERIC_DFT_FIT_DFT_HPP