mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-14 15:04:09 +00:00
fix recursion depth O(logN): some algorithms
This commit is contained in:
parent
28697ee7a8
commit
5019f6aa96
162 changed files with 3600 additions and 1659 deletions
|
@ -11,7 +11,7 @@
|
|||
#include <sprout/iterator/distance.hpp>
|
||||
#include <sprout/utility/swap.hpp>
|
||||
#include <sprout/numeric/dft/dft_element.hpp>
|
||||
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
|
||||
namespace sprout {
|
||||
//
|
||||
|
@ -60,7 +60,7 @@ namespace sprout {
|
|||
dft_iterator(dft_iterator const&) = default;
|
||||
SPROUT_CONSTEXPR dft_iterator(iterator_type first, iterator_type last, difference_type index = 0)
|
||||
: first_(first), last_(last), index_(index)
|
||||
, size_(NS_SSCRISK_CEL_OR_SPROUT::distance(first, last))
|
||||
, size_(sprout::distance(first, last))
|
||||
{}
|
||||
SPROUT_CONSTEXPR dft_iterator next() const {
|
||||
return dft_iterator(first_, last_, index_, index_ + 1, size_);
|
||||
|
@ -164,15 +164,6 @@ namespace sprout {
|
|||
lhs.swap(rhs);
|
||||
}
|
||||
|
||||
//
|
||||
// iterator_distance
|
||||
//
|
||||
template<typename Iterator>
|
||||
inline SPROUT_CONSTEXPR typename std::iterator_traits<sprout::dft_iterator<Iterator> >::difference_type
|
||||
iterator_distance(sprout::dft_iterator<Iterator> first, sprout::dft_iterator<Iterator> last) {
|
||||
return last - first;
|
||||
}
|
||||
|
||||
//
|
||||
// iterator_next
|
||||
//
|
||||
|
@ -181,15 +172,6 @@ namespace sprout {
|
|||
iterator_next(sprout::dft_iterator<Iterator> const& it) {
|
||||
return it.next();
|
||||
}
|
||||
template<typename Iterator>
|
||||
inline SPROUT_CONSTEXPR sprout::dft_iterator<Iterator>
|
||||
iterator_next(
|
||||
sprout::dft_iterator<Iterator> const& it,
|
||||
typename sprout::dft_iterator<Iterator>::difference_type n
|
||||
)
|
||||
{
|
||||
return it + n;
|
||||
}
|
||||
|
||||
//
|
||||
// iterator_prev
|
||||
|
@ -199,15 +181,6 @@ namespace sprout {
|
|||
iterator_prev(sprout::dft_iterator<Iterator> const& it) {
|
||||
return it.prev();
|
||||
}
|
||||
template<typename Iterator>
|
||||
inline SPROUT_CONSTEXPR sprout::dft_iterator<Iterator>
|
||||
iterator_prev(
|
||||
sprout::dft_iterator<Iterator> const& it,
|
||||
typename sprout::dft_iterator<Iterator>::difference_type n
|
||||
)
|
||||
{
|
||||
return it - n;
|
||||
}
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_ITERATOR_DFT_ITERATOR_HPP
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue