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_REVERSE_COPY_HPP_INCLUDED 10 #define BOOST_RANGE_ALGORITHM_REVERSE_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/iterator/iterator_concepts.hpp> 17 #include <algorithm> 18 19 namespace boost 20 { 21 namespace range 22 { 23 24 /// \brief template function reverse_copy 25 /// 26 /// range-based version of the reverse_copy std algorithm 27 /// 28 /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept 29 template<class BidirectionalRange, class OutputIterator> reverse_copy(const BidirectionalRange & rng,OutputIterator out)30inline OutputIterator reverse_copy(const BidirectionalRange& rng, OutputIterator out) 31 { 32 BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> )); 33 return std::reverse_copy(boost::begin(rng), boost::end(rng), out); 34 } 35 36 } // namespace range 37 using range::reverse_copy; 38 } // namespace boost 39 40 #endif // include guard 41