Sprout/sprout/algorithm/fixed/rotate_copy.hpp

185 lines
7.5 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP
#include <iterator>
#include <type_traits>
2011-09-01 02:48:32 +00:00
#include <sprout/config.hpp>
2013-04-06 04:06:51 +00:00
#include <sprout/index_tuple/metafunction.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2013-03-31 06:14:10 +00:00
#include <sprout/container/indexes.hpp>
2012-05-14 02:33:36 +00:00
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/joint_iterator.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/pit/pit.hpp>
2011-10-28 12:45:00 +00:00
#include <sprout/detail/container_complate.hpp>
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
2012-02-28 01:46:39 +00:00
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
rotate_copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last,
2011-09-01 02:48:32 +00:00
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
2011-09-01 02:48:32 +00:00
)
{
return sprout::remake<Result>(
2011-09-03 13:26:26 +00:00
result,
sprout::size(result),
2011-09-01 02:48:32 +00:00
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? (Indexes < offset + sprout::distance(middle, last)
? middle[Indexes - offset]
: first[(Indexes - offset) - sprout::distance(first, middle)]
2011-09-01 02:48:32 +00:00
)
: *sprout::next(sprout::internal_begin(result), Indexes)
2011-09-01 02:48:32 +00:00
)...
2011-09-03 13:26:26 +00:00
);
2011-09-01 02:48:32 +00:00
}
template<typename RandomAccessIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
rotate_copy(
RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last,
Result const& result,
std::random_access_iterator_tag*
)
{
return sprout::fixed::detail::rotate_copy_impl_ra(
2013-01-20 11:49:37 +00:00
first, middle, last,
result,
2013-03-31 06:14:10 +00:00
sprout::container_indexes<Result>::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
rotate_copy_impl_1(
2013-07-22 13:00:09 +00:00
ForwardIterator, ForwardIterator,
Result const& result,
2013-07-22 13:00:09 +00:00
typename sprout::container_traits<Result>::size_type,
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
rotate_copy_impl_1(
ForwardIterator first, ForwardIterator last,
Result const& result,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
2011-10-28 12:45:00 +00:00
return first != last && sizeof...(Args) < size
? sprout::fixed::detail::rotate_copy_impl_1(sprout::next(first), last, result, size, args..., *first)
: sprout::detail::container_complate(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
rotate_copy_impl(
2013-07-22 13:00:09 +00:00
ForwardIterator, ForwardIterator,
ForwardIterator, ForwardIterator,
Result const& result,
2013-07-22 13:00:09 +00:00
typename sprout::container_traits<Result>::size_type,
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
rotate_copy_impl(
ForwardIterator first, ForwardIterator middle,
ForwardIterator middle_first, ForwardIterator last,
Result const& result,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
2011-10-28 12:45:00 +00:00
return middle_first != last && sizeof...(Args) < size
? sprout::fixed::detail::rotate_copy_impl(first, middle, sprout::next(middle_first), last, result, size, args..., *middle_first)
: sprout::fixed::detail::rotate_copy_impl_1(first, middle, result, size, args...)
;
}
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
rotate_copy(
ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result,
2013-02-23 06:21:27 +00:00
std::forward_iterator_tag*
)
{
2011-10-28 12:45:00 +00:00
return sprout::fixed::detail::rotate_copy_impl(first, middle, last, result, sprout::size(result));
}
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
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result) {
typedef typename std::iterator_traits<ForwardIterator>::iterator_category* category;
return sprout::fixed::detail::rotate_copy(first, middle, 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
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result) {
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_joint_iterator(middle, last, first, first),
sprout::make_joint_iterator(last, last, first, middle)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// rotate_copy
//
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result) {
return sprout::fixed::detail::rotate_copy(first, middle, last, result);
}
template<typename Result, typename ForwardIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last) {
return sprout::fixed::rotate_copy(first, middle, last, sprout::pit<Result>());
2011-09-01 02:48:32 +00:00
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::rotate_copy;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP