1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-12-03 21:15:42 +00:00
Sprout/sprout/algorithm/fixed/copy.hpp

135 lines
5.1 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_COPY_HPP
2011-10-06 06:00:08 +00:00
#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>
2011-10-01 15:19:13 +00:00
#include <sprout/iterator/operation.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>
#include <sprout/math/comparison.hpp>
#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
copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
2011-09-01 02:48:32 +00:00
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>(
result, sprout::size(result),
(Indexes >= offset && sprout::math::less(Indexes, offset + size) && sprout::math::less(Indexes, offset + input_size)
? first[Indexes - offset]
: *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
}
2011-10-06 06:00:08 +00:00
template<typename RandomAccessIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
2011-10-06 06:00:08 +00:00
std::random_access_iterator_tag*
)
{
return sprout::fixed::detail::copy_impl_ra(
first, last, result,
2013-03-31 06:14:10 +00:00
sprout::container_indexes<Result>::make(),
sprout::internal_begin_offset(result),
2011-10-06 06:00:08 +00:00
sprout::size(result),
sprout::distance(first, last)
2011-10-06 06:00:08 +00:00
);
}
2013-01-13 16:13:48 +00:00
2011-10-06 06:00:08 +00:00
template<typename InputIterator, typename Result, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
2011-10-06 06:00:08 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
2011-10-06 06:00:08 +00:00
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args...);
2011-10-06 06:00:08 +00:00
}
template<typename InputIterator, typename Result, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
2011-10-06 06:00:08 +00:00
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
2011-10-06 06:00:08 +00:00
Args const&... args
)
{
return first != last && sizeof...(Args) < size
? sprout::fixed::detail::copy_impl(sprout::next(first), last, result, size, args..., *first)
: sprout::detail::container_complate(result, args...)
2011-10-06 06:00:08 +00:00
;
}
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy(
InputIterator first, InputIterator last, Result const& result,
2013-02-23 06:21:27 +00:00
std::input_iterator_tag*
2011-10-06 06:00:08 +00:00
)
{
return sprout::fixed::detail::copy_impl(first, last, result, sprout::size(result));
2011-10-06 06:00:08 +00:00
}
2013-01-13 16:13:48 +00:00
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy(InputIterator first, InputIterator last, Result const& result) {
2013-01-13 16:13:48 +00:00
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::fixed::detail::copy(first, last, result, category());
}
2013-01-13 16:13:48 +00:00
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy(InputIterator first, InputIterator last, Result const& result) {
2013-01-13 16:13:48 +00:00
return sprout::remake<Result>(
result, sprout::size(result),
2013-01-13 16:13:48 +00:00
first, last
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// copy
//
2011-10-06 06:00:08 +00:00
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy(InputIterator first, InputIterator last, Result const& result) {
2013-01-13 16:13:48 +00:00
return sprout::fixed::detail::copy(first, last, result);
2011-09-01 02:48:32 +00:00
}
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy(InputIterator first, InputIterator last) {
return sprout::fixed::copy(first, 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::copy;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_HPP