// Boost.Range library // // Copyright Thorsten Ottosen, Neil Groves 2006 - 2008. 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 BOOST_RANGE_ADAPTOR_REVERSED_HPP #define BOOST_RANGE_ADAPTOR_REVERSED_HPP #include #include #include namespace boost { namespace range_detail { template< class R > struct reversed_range : public boost::iterator_range< boost::reverse_iterator< BOOST_DEDUCED_TYPENAME range_iterator::type > > { private: typedef boost::iterator_range< boost::reverse_iterator< BOOST_DEDUCED_TYPENAME range_iterator::type > > base; public: typedef boost::reverse_iterator::type> iterator; explicit reversed_range( R& r ) : base( iterator(boost::end(r)), iterator(boost::begin(r)) ) { } }; struct reverse_forwarder {}; template< class BidirectionalRange > inline reversed_range operator|( BidirectionalRange& r, reverse_forwarder ) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept)); return reversed_range( r ); } template< class BidirectionalRange > inline reversed_range operator|( const BidirectionalRange& r, reverse_forwarder ) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept)); return reversed_range( r ); } } // 'range_detail' using range_detail::reversed_range; namespace adaptors { namespace { const range_detail::reverse_forwarder reversed = range_detail::reverse_forwarder(); } template inline reversed_range reverse(BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept)); return reversed_range(rng); } template inline reversed_range reverse(const BidirectionalRange& rng) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept)); return reversed_range(rng); } } // 'adaptors' } // 'boost' #endif