Sprout/sprout/algorithm/fit/copy_n.hpp

48 lines
1.7 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2017 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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-03 13:26:26 +00:00
#ifndef SPROUT_ALGORITHM_FIT_COPY_N_HPP
#define SPROUT_ALGORITHM_FIT_COPY_N_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/copy_n.hpp>
#include <sprout/algorithm/fit/results.hpp>
2013-08-08 09:54:33 +00:00
#include <sprout/sub_array/sub_array.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/sub_array/sub.hpp>
2011-09-03 13:26:26 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename InputIterator, typename Size, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Result>::type
copy_n_impl(
2016-04-01 14:37:48 +00:00
InputIterator const& first, Size n, Result const& result,
typename sprout::container_traits<Result>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::copy_n(first, n, result)),
2011-09-03 13:26:26 +00:00
offset,
2013-02-26 01:43:27 +00:00
offset + sprout::fit_size(result, n)
2011-09-03 13:26:26 +00:00
);
}
} // namespace detail
//
// copy_n
//
template<typename InputIterator, typename Size, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fit::results::algorithm<Result>::type
copy_n(InputIterator first, Size n, Result const& result) {
return sprout::fit::detail::copy_n_impl(first, n, result, sprout::internal_begin_offset(result));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_COPY_N_HPP