mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
116 lines
4.3 KiB
C++
116 lines
4.3 KiB
C++
#ifndef SPROUT_ALGORITHM_FIXED_REVERSE_COPY_HPP
|
|
#define SPROUT_ALGORITHM_FIXED_REVERSE_COPY_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/algorithm/fixed/result_of.hpp>
|
|
#include <sprout/detail/container_complate.hpp>
|
|
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
|
|
|
|
namespace sprout {
|
|
namespace fixed {
|
|
namespace detail {
|
|
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type reverse_copy_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,
|
|
typename sprout::container_traits<Result>::size_type input_size
|
|
)
|
|
{
|
|
return sprout::remake<Result>(
|
|
result,
|
|
sprout::size(result),
|
|
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
|
|
? *sprout::prev(last, 1 + Indexes - offset)
|
|
: *sprout::next(sprout::internal_begin(result), Indexes)
|
|
)...
|
|
);
|
|
}
|
|
template<typename RandomAccessIterator, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type reverse_copy(
|
|
RandomAccessIterator first,
|
|
RandomAccessIterator last,
|
|
Result const& result,
|
|
std::random_access_iterator_tag*
|
|
)
|
|
{
|
|
return sprout::fixed::detail::reverse_copy_impl_ra(
|
|
first,
|
|
last,
|
|
result,
|
|
typename sprout::index_range<0, sprout::container_traits<Result>::static_size>::type(),
|
|
sprout::internal_begin_offset(result),
|
|
sprout::size(result),
|
|
NS_SSCRISK_CEL_OR_SPROUT::distance(first, last)
|
|
);
|
|
}
|
|
template<typename BidirectionalIterator, 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 reverse_copy_impl(
|
|
BidirectionalIterator first,
|
|
BidirectionalIterator last,
|
|
Result const& result,
|
|
typename sprout::container_traits<Result>::size_type size,
|
|
Args const&... args
|
|
)
|
|
{
|
|
return sprout::remake<Result>(result, sprout::size(result), args...);
|
|
}
|
|
template<typename BidirectionalIterator, 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 reverse_copy_impl(
|
|
BidirectionalIterator first,
|
|
BidirectionalIterator last,
|
|
Result const& result,
|
|
typename sprout::container_traits<Result>::size_type size,
|
|
Args const&... args
|
|
)
|
|
{
|
|
return first != last && sizeof...(Args) < size
|
|
? sprout::fixed::detail::reverse_copy_impl(first, sprout::prev(last), result, size, args..., *sprout::prev(last))
|
|
: sprout::detail::container_complate(result, args...)
|
|
;
|
|
}
|
|
template<typename BidirectionalIterator, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type reverse_copy(
|
|
BidirectionalIterator first,
|
|
BidirectionalIterator last,
|
|
Result const& result,
|
|
void*
|
|
)
|
|
{
|
|
return sprout::fixed::detail::reverse_copy_impl(first, last, result, sprout::size(result));
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// reverse_copy
|
|
//
|
|
template<typename BidirectionalIterator, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type reverse_copy(
|
|
BidirectionalIterator first,
|
|
BidirectionalIterator last,
|
|
Result const& result
|
|
)
|
|
{
|
|
typedef typename std::iterator_traits<BidirectionalIterator>::iterator_category* category;
|
|
return sprout::fixed::detail::reverse_copy(first, last, result, category());
|
|
}
|
|
} // namespace fixed
|
|
|
|
using sprout::fixed::reverse_copy;
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_REVERSE_COPY_HPP
|