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/filtered.hpp (4245B)

#ifndef BOOST_RANGE_ADAPTOR_FILTERED_HPP
#define BOOST_RANGE_ADAPTOR_FILTERED_HPP

#include <boost/range/adaptor/argument_fwd.hpp>
#include <boost/range/detail/default_constructible_unary_fn.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/range/concepts.hpp>
#include <boost/iterator/filter_iterator.hpp>

namespace boost
{
    namespace range_detail
    {
        template< class P, class R >
        struct filtered_range :
            boost::iterator_range<
                boost::filter_iterator<
                    typename default_constructible_unary_fn_gen<P, bool>::type,
                    typename range_iterator<R>::type
                >
            >
        {
        private:
            typedef boost::iterator_range<
                boost::filter_iterator<
                    typename default_constructible_unary_fn_gen<P, bool>::type,
                    typename range_iterator<R>::type
                >
            > base;
        public:
            typedef typename default_constructible_unary_fn_gen<P, bool>::type
                pred_t;

filtered_range(P p, R& r)
            : base(make_filter_iterator(pred_t(p),
                                        boost::begin(r), boost::end(r)),
                   make_filter_iterator(pred_t(p),
                                        boost::end(r), boost::end(r)))
            { }
        };

template< class T >
        struct filter_holder : holder<T>
        {
            filter_holder( T r ) : holder<T>(r)
            { }
        };

template< class SinglePassRange, class Predicate >
        inline filtered_range<Predicate, SinglePassRange>
        operator|(SinglePassRange& r,
                  const filter_holder<Predicate>& f)
        {
            BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<SinglePassRange>));
            return filtered_range<Predicate, SinglePassRange>( f.val, r );
        }

template< class SinglePassRange, class Predicate >
        inline filtered_range<Predicate, const SinglePassRange>
        operator|(const SinglePassRange& r,
                  const filter_holder<Predicate>& f )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                SinglePassRangeConcept<const SinglePassRange>));
            return filtered_range<Predicate, const SinglePassRange>( f.val, r );
        }

} // 'range_detail'

// Unusual use of 'using' is intended to bring filter_range into the boost namespace
    // while leaving the mechanics of the '|' operator in range_detail and maintain
    // argument dependent lookup.
    // filter_range logically needs to be in the boost namespace to allow user of
    // the library to define the return type for filter()
    using range_detail::filtered_range;

namespace adaptors
    {
        namespace
        {
            const range_detail::forwarder<range_detail::filter_holder>
                    filtered =
                       range_detail::forwarder<range_detail::filter_holder>();
        }

template<class SinglePassRange, class Predicate>
        inline filtered_range<Predicate, SinglePassRange>
        filter(SinglePassRange& rng, Predicate filter_pred)
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                SinglePassRangeConcept<SinglePassRange>));

return range_detail::filtered_range<
                Predicate, SinglePassRange>( filter_pred, rng );
        }

template<class SinglePassRange, class Predicate>
        inline filtered_range<Predicate, const SinglePassRange>
        filter(const SinglePassRange& rng, Predicate filter_pred)
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                SinglePassRangeConcept<const SinglePassRange>));

return range_detail::filtered_range<
                Predicate, const SinglePassRange>( filter_pred, rng );
        }
    } // 'adaptors'

}

#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_FILTERED_HPP #define BOOST_RANGE_ADAPTOR_FILTERED_HPP #include #include #include #include #include namespace boost { namespace range_detail { template< class P, class R > struct filtered_range : boost::iterator_range< boost::filter_iterator< typename default_constructible_unary_fn_gen::type, typename range_iterator::type > > { private: typedef boost::iterator_range< boost::filter_iterator< typename default_constructible_unary_fn_gen::type, typename range_iterator::type > > base; public: typedef typename default_constructible_unary_fn_gen::type pred_t; filtered_range(P p, R& r) : base(make_filter_iterator(pred_t(p), boost::begin(r), boost::end(r)), make_filter_iterator(pred_t(p), boost::end(r), boost::end(r))) { } }; template< class T > struct filter_holder : holder { filter_holder( T r ) : holder(r) { } }; template< class SinglePassRange, class Predicate > inline filtered_range operator|(SinglePassRange& r, const filter_holder& f) { BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept)); return filtered_range( f.val, r ); } template< class SinglePassRange, class Predicate > inline filtered_range operator|(const SinglePassRange& r, const filter_holder& f ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return filtered_range( f.val, r ); } } // 'range_detail' // Unusual use of 'using' is intended to bring filter_range into the boost namespace // while leaving the mechanics of the '|' operator in range_detail and maintain // argument dependent lookup. // filter_range logically needs to be in the boost namespace to allow user of // the library to define the return type for filter() using range_detail::filtered_range; namespace adaptors { namespace { const range_detail::forwarder filtered = range_detail::forwarder(); } template inline filtered_range filter(SinglePassRange& rng, Predicate filter_pred) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return range_detail::filtered_range< Predicate, SinglePassRange>( filter_pred, rng ); } template inline filtered_range filter(const SinglePassRange& rng, Predicate filter_pred) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return range_detail::filtered_range< Predicate, const SinglePassRange>( filter_pred, rng ); } } // 'adaptors' } #endif