// Copyright Neil Groves 2009. Use, modification and // distribution is subject to 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) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef ACTIV_BOOST_RANGE_ALGORITHM_COPY_N_HPP_INCLUDED #define ACTIV_BOOST_RANGE_ALGORITHM_COPY_N_HPP_INCLUDED #include #include #include #include #include #include #include #include #include namespace Boost { namespace range { /// \brief template function copy /// /// range-based version of the copy std algorithm /// /// \pre SinglePassRange is a model of the SinglePassRangeConcept /// \pre OutputIterator is a model of the OutputIteratorConcept /// \pre 0 <= n <= distance(rng) template< class SinglePassRange, class Size, class OutputIterator > inline OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); ACTIV_BOOST_ASSERT( n <= static_cast(::Boost::distance(rng)) ); ACTIV_BOOST_ASSERT( n >= static_cast(0) ); ACTIV_BOOST_DEDUCED_TYPENAME range_iterator::type source = ::Boost::begin(rng); for (Size i = 0; i < n; ++i, ++out, ++source) *out = *source; return out; } } // namespace range using ::Boost::range::copy_n; } // namespace Boost #endif // include guard