Sprout/sprout/algorithm/fixed/copy_backward.hpp

57 lines
1.9 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_COPY_BACKWARD_HPP
#define SPROUT_ALGORITHM_FIXED_COPY_BACKWARD_HPP
#include <cstddef>
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/fixed_container/traits.hpp>
#include <sprout/fixed_container/functions.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT_DETAIL
namespace sprout {
namespace fixed {
namespace detail {
template<typename Iterator, typename Result, std::ptrdiff_t... Indexes>
SPROUT_CONSTEXPR inline typename sprout::fixed_container_traits<Result>::fixed_container_type copy_backward_impl(
Iterator first,
Iterator last,
Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::fixed_container_traits<Result>::difference_type offset,
typename sprout::fixed_container_traits<Result>::size_type size,
typename sprout::fixed_container_traits<Result>::size_type input_size
)
{
return typename sprout::fixed_container_traits<Result>::fixed_container_type{
(Indexes < offset && Indexes + size >= offset && Indexes + input_size >= offset
? *(last + Indexes - offset)
: *(sprout::fixed_begin(result) + Indexes)
)...
};
}
} // namespace detail
//
// copy_backward
//
template<typename Iterator, typename Result>
SPROUT_CONSTEXPR inline typename sprout::fixed_container_traits<Result>::fixed_container_type copy_backward(
Iterator first,
Iterator last,
Result const& result
)
{
return sprout::fixed::detail::copy_backward_impl(
first,
last,
result,
typename sprout::index_range<0, sprout::fixed_container_traits<Result>::fixed_size>::type(),
sprout::fixed_end_offset(result),
sprout::size(result),
NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(first, last)
);
}
} // namespace fixed
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_BACKWARD_HPP