// 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_ADJACENT_FIND_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_ADJACENT_FIND_HPP_INCLUDED #include #include #include #include #include #include #include namespace boost { namespace range { /// \brief template function adjacent_find /// /// range-based version of the adjacent_find std algorithm /// /// \pre ForwardRange is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< class ForwardRange > inline BOOST_DEDUCED_TYPENAME range_iterator::type adjacent_find(ForwardRange & rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return std::adjacent_find(boost::begin(rng),boost::end(rng)); } /// \overload template< class ForwardRange, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME range_iterator::type adjacent_find(ForwardRange & rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return std::adjacent_find(boost::begin(rng),boost::end(rng),pred); } // range_return overloads /// \overload template< range_return_value re, class ForwardRange > inline BOOST_DEDUCED_TYPENAME range_return::type adjacent_find(ForwardRange & rng) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng)), rng); } /// \overload template< range_return_value re, class ForwardRange, class BinaryPredicate > inline BOOST_DEDUCED_TYPENAME range_return::type adjacent_find(ForwardRange& rng, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT((ForwardRangeConcept)); return range_return:: pack(std::adjacent_find(boost::begin(rng),boost::end(rng),pred), rng); } } // namespace range using range::adjacent_find; } // namespace boost #endif // include guard