range/algorithm/reverse.hpp

0001 //  Copyright Neil Groves 2009. Use, modification and
0002 //  distribution is subject to the Boost Software License, Version
0003 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
0004 //  http://www.boost.org/LICENSE_1_0.txt)
0005 //
0006 //
0007 // For more information, see http://www.boost.org/libs/range/
0008 //
0009 #ifndef BOOST_RANGE_ALGORITHM_REVERSE_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_REVERSE_HPP_INCLUDED
0011
0012 #include <boost/concept_check.hpp>
0013 #include <boost/range/begin.hpp>
0014 #include <boost/range/end.hpp>
0015 #include <boost/range/concepts.hpp>
0016 #include <boost/range/detail/range_return.hpp>
0017 #include <algorithm>
0018
0019 namespace boost
0020 {
0021     namespace range
0022     {
0023
0024 /// \brief template function reverse
0025 ///
0026 /// range-based version of the reverse std algorithm
0027 ///
0028 /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
0029 template<class BidirectionalRange>
0030 inline BidirectionalRange& reverse(BidirectionalRange& rng)
0031 {
0032     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
0033     std::reverse(boost::begin(rng), boost::end(rng));
0034     return rng;
0035 }
0036
0037 /// \overload
0038 template<class BidirectionalRange>
0039 inline const BidirectionalRange& reverse(const BidirectionalRange& rng)
0040 {
0041     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
0042     std::reverse(boost::begin(rng), boost::end(rng));
0043     return rng;
0044 }
0045
0046     } // namespace range
0047     using range::reverse;
0048 } // namespace boost
0049
0050 #endif // include guard