1 | // Copyright Neil Groves 2009. Use, modification and |
---|---|
2 | // distribution is subject to the Boost Software License, Version |
3 | // 1.0. (See accompanying file LICENSE_1_0.txt or copy at |
4 | // http://www.boost.org/LICENSE_1_0.txt) |
5 | // |
6 | // |
7 | // For more information, see http://www.boost.org/libs/range/ |
8 | // |
9 | #ifndef BOOST_RANGE_ALGORITHM_COPY_HPP_INCLUDED |
10 | #define BOOST_RANGE_ALGORITHM_COPY_HPP_INCLUDED |
11 | |
12 | #include <boost/concept_check.hpp> |
13 | #include <boost/range/begin.hpp> |
14 | #include <boost/range/end.hpp> |
15 | #include <boost/range/concepts.hpp> |
16 | #include <boost/range/iterator_range.hpp> |
17 | #include <algorithm> |
18 | |
19 | namespace boost |
20 | { |
21 | namespace range |
22 | { |
23 | |
24 | /// \brief template function copy |
25 | /// |
26 | /// range-based version of the copy std algorithm |
27 | /// |
28 | /// \pre SinglePassRange is a model of the SinglePassRangeConcept |
29 | /// \pre OutputIterator is a model of the OutputIteratorConcept |
30 | template< class SinglePassRange, class OutputIterator > |
31 | inline OutputIterator copy(const SinglePassRange& rng, OutputIterator out) |
32 | { |
33 | BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> )); |
34 | return std::copy(boost::begin(rng),boost::end(rng),out); |
35 | } |
36 | |
37 | } // namespace range |
38 | using range::copy; |
39 | } // namespace boost |
40 | |
41 | #endif // include guard |
42 |