// Copyright Neil Groves 2009. 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_ALGORITHM_FIND_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_FIND_HPP_INCLUDED #include #include #include #include #include #include namespace boost { namespace range { /// \brief template function find /// /// range-based version of the find std algorithm /// /// \pre SinglePassRange is a model of the SinglePassRangeConcept template< class SinglePassRange, class Value > inline BOOST_DEDUCED_TYPENAME disable_if< is_const, BOOST_DEDUCED_TYPENAME range_iterator::type >::type find( SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::find(boost::begin(rng), boost::end(rng), val); } /// \overload template< class SinglePassRange, class Value > inline BOOST_DEDUCED_TYPENAME range_iterator::type find( const SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::find(boost::begin(rng), boost::end(rng), val); } // range_return overloads /// \overload template< range_return_value re, class SinglePassRange, class Value > inline BOOST_DEDUCED_TYPENAME disable_if< is_const, BOOST_DEDUCED_TYPENAME range_return::type >::type find( SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return range_return:: pack(std::find(boost::begin(rng), boost::end(rng), val), rng); } /// \overload template< range_return_value re, class SinglePassRange, class Value > inline BOOST_DEDUCED_TYPENAME range_return::type find( const SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return range_return:: pack(std::find(boost::begin(rng), boost::end(rng), val), rng); } } // namespace range using range::find; } #endif // include guard