Sprout/sprout/algorithm/copy_n.hpp

53 lines
1.9 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_COPY_N_HPP
#define SPROUT_ALGORITHM_COPY_N_HPP
#include <sprout/config.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/copy_n.hpp>
namespace sprout {
//
// 25.3.1 Copy
//
template<
typename InputIterator, typename Size, typename OutputIterator,
typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
>
inline SPROUT_CXX14_CONSTEXPR OutputIterator
copy_n(InputIterator first, Size n, OutputIterator result) {
for (Size i = 0; i < n; ++i) {
*result++ = *first++;
}
return result;
}
template<
typename InputIterator, typename Size, 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_n(InputIterator first, Size n, Result const& result) {
return sprout::fixed::copy_n(first, n, result);
}
template<typename Result, typename Size, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy_n(InputIterator first, Size n) {
return sprout::fixed::copy_n<Result>(first, n);
}
} // namespace sprout
2011-09-01 02:48:32 +00:00
#include <sprout/algorithm/fixed/copy_n.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fit/copy_n.hpp>
2011-09-01 02:48:32 +00:00
#endif // #ifndef SPROUT_ALGORITHM_COPY_N_HPP