mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
199 lines
8.2 KiB
C++
199 lines
8.2 KiB
C++
/*=============================================================================
|
|
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)
|
|
=============================================================================*/
|
|
#ifndef SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP
|
|
#define SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP
|
|
|
|
#include <iterator>
|
|
#include <type_traits>
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/index_tuple/metafunction.hpp>
|
|
#include <sprout/container/traits.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/container/indexes.hpp>
|
|
#include <sprout/iterator/operation.hpp>
|
|
#include <sprout/iterator/joint_iterator.hpp>
|
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
|
#include <sprout/type_traits/enabler_if.hpp>
|
|
#include <sprout/algorithm/fixed/results.hpp>
|
|
#include <sprout/pit/pit.hpp>
|
|
#include <sprout/detail/container_complate.hpp>
|
|
|
|
namespace sprout {
|
|
namespace fixed {
|
|
namespace detail {
|
|
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
rotate_copy_impl_ra(
|
|
RandomAccessIterator first, RandomAccessIterator middle, 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
|
|
? (Indexes < offset + sprout::distance(middle, last)
|
|
? middle[Indexes - offset]
|
|
: first[(Indexes - offset) - sprout::distance(first, middle)]
|
|
)
|
|
: *sprout::next(sprout::internal_begin(result), Indexes)
|
|
)...
|
|
);
|
|
}
|
|
template<typename RandomAccessIterator, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::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(
|
|
first, middle, last,
|
|
result,
|
|
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::results::algorithm<Result>::type
|
|
>::type
|
|
rotate_copy_impl_1(
|
|
ForwardIterator, ForwardIterator,
|
|
Result const& result,
|
|
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::results::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
|
|
)
|
|
{
|
|
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::results::algorithm<Result>::type
|
|
>::type
|
|
rotate_copy_impl(
|
|
ForwardIterator, ForwardIterator,
|
|
ForwardIterator, ForwardIterator,
|
|
Result const& result,
|
|
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::results::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
|
|
)
|
|
{
|
|
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::results::algorithm<Result>::type
|
|
rotate_copy(
|
|
ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result,
|
|
std::forward_iterator_tag*
|
|
)
|
|
{
|
|
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::results::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::results::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)
|
|
);
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// rotate_copy
|
|
//
|
|
template<typename ForwardIterator, typename Result>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::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::results::algorithm<Result>::type
|
|
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last) {
|
|
return sprout::fixed::rotate_copy(first, middle, last, sprout::pit<Result>());
|
|
}
|
|
} // namespace fixed
|
|
|
|
template<
|
|
typename ForwardIterator, typename Result,
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
|
>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, Result const& result) {
|
|
return sprout::fixed::rotate_copy(first, middle, last, result);
|
|
}
|
|
|
|
template<typename Result, typename ForwardIterator>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last) {
|
|
return sprout::fixed::rotate_copy<Result>(first, middle, last);
|
|
}
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_ROTATE_COPY_HPP
|