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_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>
|
2012-03-31 07:24:13 +00:00
|
|
|
#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>
|
2013-10-15 11:22:20 +00:00
|
|
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
|
|
|
#include <sprout/type_traits/enabler_if.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>
|
2013-10-05 04:35:26 +00:00
|
|
|
#include <sprout/math/less.hpp>
|
2011-10-27 02:24:47 +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>
|
2012-09-29 08:10:46 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
copy_impl_ra(
|
2013-07-22 13:00:09 +00:00
|
|
|
RandomAccessIterator first, RandomAccessIterator, Result const& result,
|
2011-09-01 02:48:32 +00:00
|
|
|
sprout::index_tuple<Indexes...>,
|
2012-03-31 07:24:13 +00:00
|
|
|
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
|
|
|
)
|
|
|
|
{
|
2012-03-31 07:24:13 +00:00
|
|
|
return sprout::remake<Result>(
|
2013-01-19 23:53:20 +00:00
|
|
|
result, sprout::size(result),
|
2012-09-29 08:10:46 +00:00
|
|
|
(Indexes >= offset && sprout::math::less(Indexes, offset + size) && sprout::math::less(Indexes, offset + input_size)
|
2012-04-30 10:41:24 +00:00
|
|
|
? first[Indexes - offset]
|
2012-03-31 07:24:13 +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
|
|
|
}
|
2011-10-06 06:00:08 +00:00
|
|
|
template<typename RandomAccessIterator, typename Result>
|
2012-09-29 08:10:46 +00:00
|
|
|
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(
|
2012-09-29 08:10:46 +00:00
|
|
|
first, last, result,
|
2013-03-31 06:14:10 +00:00
|
|
|
sprout::container_indexes<Result>::make(),
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::internal_begin_offset(result),
|
2011-10-06 06:00:08 +00:00
|
|
|
sprout::size(result),
|
2013-01-03 08:01:50 +00:00
|
|
|
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>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::container_traits<Result>::static_size == sizeof...(Args),
|
2011-10-06 06:00:08 +00:00
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
2012-09-29 08:10:46 +00:00
|
|
|
>::type
|
2013-08-14 12:57:26 +00:00
|
|
|
copy_impl(
|
2013-07-22 13:00:09 +00:00
|
|
|
InputIterator, InputIterator, Result const& result,
|
|
|
|
typename sprout::container_traits<Result>::size_type,
|
2011-10-06 06:00:08 +00:00
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
2012-03-31 07:24:13 +00:00
|
|
|
return sprout::remake<Result>(result, sprout::size(result), args...);
|
2011-10-06 06:00:08 +00:00
|
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename... Args>
|
2012-04-04 13:23:41 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
2012-03-31 07:24:13 +00:00
|
|
|
sprout::container_traits<Result>::static_size != sizeof...(Args),
|
2011-10-06 06:00:08 +00:00
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
2012-09-29 08:10:46 +00:00
|
|
|
>::type
|
2013-08-14 12:57:26 +00:00
|
|
|
copy_impl(
|
2012-09-29 08:10:46 +00:00
|
|
|
InputIterator first, InputIterator last, Result const& result,
|
2012-03-31 07:24:13 +00:00
|
|
|
typename sprout::container_traits<Result>::size_type size,
|
2011-10-06 06:00:08 +00:00
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
2011-10-27 02:24:47 +00:00
|
|
|
return first != last && sizeof...(Args) < size
|
2013-08-14 12:57:26 +00:00
|
|
|
? sprout::fixed::detail::copy_impl(sprout::next(first), last, result, size, args..., *first)
|
2011-10-27 02:24:47 +00:00
|
|
|
: sprout::detail::container_complate(result, args...)
|
2011-10-06 06:00:08 +00:00
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename InputIterator, typename Result>
|
2012-09-29 08:10:46 +00:00
|
|
|
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
|
|
|
)
|
|
|
|
{
|
2013-08-14 12:57:26 +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
|
2013-01-16 18:53:17 +00:00
|
|
|
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-16 18:53:17 +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
|
2013-01-16 18:53:17 +00:00
|
|
|
copy(InputIterator first, InputIterator last, Result const& result) {
|
2013-01-13 16:13:48 +00:00
|
|
|
return sprout::remake<Result>(
|
2013-01-19 23:53:20 +00:00
|
|
|
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>
|
2012-09-29 08:10:46 +00:00
|
|
|
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
|
|
|
}
|
2013-01-16 18:53:17 +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
|
2013-10-15 11:22:20 +00:00
|
|
|
|
|
|
|
template<
|
|
|
|
typename InputIterator, typename Result,
|
|
|
|
typename sprout::enabler_if<!sprout::is_output_iterator<Result>::value>::type = sprout::enabler
|
|
|
|
>
|
|
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
copy(InputIterator first, InputIterator last, Result const& result) {
|
|
|
|
return sprout::fixed::copy(first, last, result);
|
|
|
|
}
|
|
|
|
|
|
|
|
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<Result>(first, last);
|
|
|
|
}
|
2011-09-01 02:48:32 +00:00
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_HPP
|