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/sliced.hpp (3407B)

#ifndef BOOST_RANGE_ADAPTOR_SLICED_HPP
#define BOOST_RANGE_ADAPTOR_SLICED_HPP

#include <boost/range/adaptor/argument_fwd.hpp>
#include <boost/range/size_type.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/range/concepts.hpp>
#include <boost/next_prior.hpp>

namespace boost
{
    namespace adaptors
    {
        struct sliced
        {
            sliced(std::size_t t_, std::size_t u_)
                : t(t_), u(u_) {}
            std::size_t t;
            std::size_t u;
        };

template< class RandomAccessRange >
        class sliced_range : public boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type >
        {
            typedef boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type > base_t;
        public:
            template<typename Rng, typename T, typename U>
            sliced_range(Rng& rng, T t, U u)
                : base_t(boost::next(boost::begin(rng), t),
                         boost::next(boost::begin(rng), u))
            {
            }
        };

template< class RandomAccessRange >
        inline sliced_range<RandomAccessRange>
        slice( RandomAccessRange& rng, std::size_t t, std::size_t u )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                RandomAccessRangeConcept<RandomAccessRange>));

BOOST_ASSERT( t <= u && "error in slice indices" );
            BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
                          "second slice index out of bounds" );

return sliced_range<RandomAccessRange>(rng, t, u);
        }

template< class RandomAccessRange >
        inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type >
        slice( const RandomAccessRange& rng, std::size_t t, std::size_t u )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                RandomAccessRangeConcept<const RandomAccessRange>));

BOOST_ASSERT( t <= u && "error in slice indices" );
            BOOST_ASSERT( static_cast<std::size_t>(boost::size(rng)) >= u &&
                          "second slice index out of bounds" );

return sliced_range<const RandomAccessRange>(rng, t, u);
        }

template< class RandomAccessRange >
        inline sliced_range<RandomAccessRange>
        operator|( RandomAccessRange& r, const sliced& f )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                RandomAccessRangeConcept<RandomAccessRange>));

return sliced_range<RandomAccessRange>( r, f.t, f.u );
        }

template< class RandomAccessRange >
        inline sliced_range<const RandomAccessRange>
        operator|( const RandomAccessRange& r, const sliced& f )
        {
            BOOST_RANGE_CONCEPT_ASSERT((
                RandomAccessRangeConcept<const RandomAccessRange>));

return sliced_range<const RandomAccessRange>( r, f.t, f.u );
        }

} // namespace adaptors
    using adaptors::sliced_range;
} // namespace 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_SLICED_HPP #define BOOST_RANGE_ADAPTOR_SLICED_HPP #include #include #include #include #include namespace boost { namespace adaptors { struct sliced { sliced(std::size_t t_, std::size_t u_) : t(t_), u(u_) {} std::size_t t; std::size_t u; }; template< class RandomAccessRange > class sliced_range : public boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > { typedef boost::iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > base_t; public: template sliced_range(Rng& rng, T t, U u) : base_t(boost::next(boost::begin(rng), t), boost::next(boost::begin(rng), u)) { } }; template< class RandomAccessRange > inline sliced_range slice( RandomAccessRange& rng, std::size_t t, std::size_t u ) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept)); BOOST_ASSERT( t <= u && "error in slice indices" ); BOOST_ASSERT( static_cast(boost::size(rng)) >= u && "second slice index out of bounds" ); return sliced_range(rng, t, u); } template< class RandomAccessRange > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > slice( const RandomAccessRange& rng, std::size_t t, std::size_t u ) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept)); BOOST_ASSERT( t <= u && "error in slice indices" ); BOOST_ASSERT( static_cast(boost::size(rng)) >= u && "second slice index out of bounds" ); return sliced_range(rng, t, u); } template< class RandomAccessRange > inline sliced_range operator|( RandomAccessRange& r, const sliced& f ) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept)); return sliced_range( r, f.t, f.u ); } template< class RandomAccessRange > inline sliced_range operator|( const RandomAccessRange& r, const sliced& f ) { BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept)); return sliced_range( r, f.t, f.u ); } } // namespace adaptors using adaptors::sliced_range; } // namespace boost #endif