![]() System : Linux absol.cf 5.4.0-198-generic #218-Ubuntu SMP Fri Sep 27 20:18:53 UTC 2024 x86_64 User : www-data ( 33) PHP Version : 7.4.33 Disable Function : pcntl_alarm,pcntl_fork,pcntl_waitpid,pcntl_wait,pcntl_wifexited,pcntl_wifstopped,pcntl_wifsignaled,pcntl_wifcontinued,pcntl_wexitstatus,pcntl_wtermsig,pcntl_wstopsig,pcntl_signal,pcntl_signal_get_handler,pcntl_signal_dispatch,pcntl_get_last_error,pcntl_strerror,pcntl_sigprocmask,pcntl_sigwaitinfo,pcntl_sigtimedwait,pcntl_exec,pcntl_getpriority,pcntl_setpriority,pcntl_async_signals,pcntl_unshare, Directory : /usr/include/boost/range/adaptor/ |
Upload File : |
// 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 <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