FM / adaptor

/usr/include/boost/range/adaptor

Name	Size	Mode	Actions
adjacent_filtered.hpp	8189	0644	edit dl rm
argument_fwd.hpp	1788	0644	edit dl rm
copied.hpp	2076	0644	edit dl rm
define_adaptor.hpp	3296	0644	edit dl rm
filtered.hpp	4245	0644	edit dl rm
formatted.hpp	6213	0644	edit dl rm
indexed.hpp	10592	0644	edit dl rm
indirected.hpp	2946	0644	edit dl rm
map.hpp	6800	0644	edit dl rm
ref_unwrapped.hpp	2959	0644	edit dl rm
replaced.hpp	5094	0644	edit dl rm
replaced_if.hpp	5399	0644	edit dl rm
reversed.hpp	3281	0644	edit dl rm
sliced.hpp	3407	0644	edit dl rm
strided.hpp	22344	0644	edit dl rm
tokenized.hpp	4710	0644	edit dl rm
transformed.hpp	4498	0644	edit dl rm
type_erased.hpp	5488	0644	edit dl rm
uniqued.hpp	2721	0644	edit dl rm

Edit: /usr/include/boost/range/adaptor/reversed.hpp (3281B)

#ifndef BOOST_RANGE_ADAPTOR_REVERSED_HPP
#define BOOST_RANGE_ADAPTOR_REVERSED_HPP

#include <boost/range/iterator_range.hpp>
#include <boost/range/concepts.hpp>
#include <boost/iterator/reverse_iterator.hpp>

namespace boost
{
    namespace range_detail
    {
        template< class R >
        struct reversed_range : 
            public boost::iterator_range< 
                      boost::reverse_iterator<
                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
                                              >
                                         >
        {
        private:
            typedef boost::iterator_range< 
                      boost::reverse_iterator<
                        BOOST_DEDUCED_TYPENAME range_iterator<R>::type 
                                              >
                                         >
                base;
            
        public:
            typedef boost::reverse_iterator<BOOST_DEDUCED_TYPENAME range_iterator<R>::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<BidirectionalRange> 
        operator|( BidirectionalRange& r, reverse_forwarder )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                BidirectionalRangeConcept<BidirectionalRange>));

return reversed_range<BidirectionalRange>( r );
        }

template< class BidirectionalRange >
        inline reversed_range<const BidirectionalRange> 
        operator|( const BidirectionalRange& r, reverse_forwarder )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                BidirectionalRangeConcept<const BidirectionalRange>));

return reversed_range<const BidirectionalRange>( r ); 
        }
        
    } // 'range_detail'
    
    using range_detail::reversed_range;

namespace adaptors
    { 
        namespace
        {
            const range_detail::reverse_forwarder reversed = 
                                            range_detail::reverse_forwarder();
        }
        
        template<class BidirectionalRange>
        inline reversed_range<BidirectionalRange>
        reverse(BidirectionalRange& rng)
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                BidirectionalRangeConcept<BidirectionalRange>));

return reversed_range<BidirectionalRange>(rng);
        }
        
        template<class BidirectionalRange>
        inline reversed_range<const BidirectionalRange>
        reverse(const BidirectionalRange& rng)
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                BidirectionalRangeConcept<const BidirectionalRange>));

return reversed_range<const BidirectionalRange>(rng);
        }
    } // 'adaptors'
    
} // 'boost'

#endif

// 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