Chris@16: // Copyright Neil Groves 2009. Use, modification and Chris@16: // distribution is subject to the Boost Software License, Version Chris@16: // 1.0. (See accompanying file LICENSE_1_0.txt or copy at Chris@16: // http://www.boost.org/LICENSE_1_0.txt) Chris@16: // Chris@16: // Chris@16: // For more information, see http://www.boost.org/libs/range/ Chris@16: // Chris@16: #ifndef BOOST_RANGE_ALGORITHM_SEARCH_HPP_INCLUDED Chris@16: #define BOOST_RANGE_ALGORITHM_SEARCH_HPP_INCLUDED Chris@16: Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: Chris@16: namespace boost Chris@16: { Chris@16: namespace range Chris@16: { Chris@16: Chris@16: /// \brief template function search Chris@16: /// Chris@16: /// range-based version of the search std algorithm Chris@16: /// Chris@16: /// \pre ForwardRange1 is a model of the ForwardRangeConcept Chris@16: /// \pre ForwardRange2 is a model of the ForwardRangeConcept Chris@16: /// \pre BinaryPredicate is a model of the BinaryPredicateConcept Chris@16: template< class ForwardRange1, class ForwardRange2 > Chris@16: inline BOOST_DEDUCED_TYPENAME range_iterator::type Chris@16: search(ForwardRange1& rng1, const ForwardRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2)); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< class ForwardRange1, class ForwardRange2 > Chris@16: inline BOOST_DEDUCED_TYPENAME range_iterator::type Chris@16: search(const ForwardRange1& rng1, const ForwardRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return std::search(boost::begin(rng1), boost::end(rng1), Chris@16: boost::begin(rng2), boost::end(rng2)); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< class ForwardRange1, class ForwardRange2, class BinaryPredicate > Chris@16: inline BOOST_DEDUCED_TYPENAME range_iterator::type Chris@16: search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2),pred); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< class ForwardRange1, class ForwardRange2, class BinaryPredicate > Chris@16: inline BOOST_DEDUCED_TYPENAME range_iterator::type Chris@16: search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return std::search(boost::begin(rng1), boost::end(rng1), Chris@16: boost::begin(rng2), boost::end(rng2), pred); Chris@16: } Chris@16: Chris@16: // range_return overloads Chris@16: Chris@16: /// \overload Chris@16: template< range_return_value re, class ForwardRange1, class ForwardRange2 > Chris@16: inline BOOST_DEDUCED_TYPENAME range_return::type Chris@16: search(ForwardRange1& rng1, const ForwardRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return range_return:: Chris@16: pack(std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2)), Chris@16: rng1); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< range_return_value re, class ForwardRange1, class ForwardRange2 > Chris@16: inline BOOST_DEDUCED_TYPENAME range_return::type Chris@16: search(const ForwardRange1& rng1, const ForwardRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return range_return:: Chris@16: pack(std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2)), Chris@16: rng1); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< range_return_value re, class ForwardRange1, class ForwardRange2, Chris@16: class BinaryPredicate > Chris@16: inline BOOST_DEDUCED_TYPENAME range_return::type Chris@16: search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return range_return:: Chris@16: pack(std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2),pred), Chris@16: rng1); Chris@16: } Chris@16: Chris@16: /// \overload Chris@16: template< range_return_value re, class ForwardRange1, class ForwardRange2, Chris@16: class BinaryPredicate > Chris@16: inline BOOST_DEDUCED_TYPENAME range_return::type Chris@16: search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); Chris@16: return range_return:: Chris@16: pack(std::search(boost::begin(rng1),boost::end(rng1), Chris@16: boost::begin(rng2),boost::end(rng2),pred), Chris@16: rng1); Chris@16: } Chris@16: Chris@16: } // namespace range Chris@16: using range::search; Chris@16: } // namespace boost Chris@16: Chris@16: #endif // include guard