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_MISMATCH_HPP_INCLUDED Chris@16: #define BOOST_RANGE_ALGORITHM_MISMATCH_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_detail Chris@16: { Chris@16: template< class SinglePassTraversalReadableIterator1, Chris@16: class SinglePassTraversalReadableIterator2 > Chris@16: inline std::pair Chris@16: mismatch_impl(SinglePassTraversalReadableIterator1 first1, Chris@16: SinglePassTraversalReadableIterator1 last1, Chris@16: SinglePassTraversalReadableIterator2 first2, Chris@16: SinglePassTraversalReadableIterator2 last2) Chris@16: { Chris@16: while (first1 != last1 && first2 != last2 && *first1 == *first2) Chris@16: { Chris@16: ++first1; Chris@16: ++first2; Chris@16: } Chris@16: return std::pair(first1, first2); Chris@16: } Chris@16: Chris@16: template< class SinglePassTraversalReadableIterator1, Chris@16: class SinglePassTraversalReadableIterator2, Chris@16: class BinaryPredicate > Chris@16: inline std::pair Chris@16: mismatch_impl(SinglePassTraversalReadableIterator1 first1, Chris@16: SinglePassTraversalReadableIterator1 last1, Chris@16: SinglePassTraversalReadableIterator2 first2, Chris@16: SinglePassTraversalReadableIterator2 last2, Chris@16: BinaryPredicate pred) Chris@16: { Chris@16: while (first1 != last1 && first2 != last2 && pred(*first1, *first2)) Chris@16: { Chris@16: ++first1; Chris@16: ++first2; Chris@16: } Chris@16: return std::pair(first1, first2); Chris@16: } Chris@16: } // namespace range_detail Chris@16: Chris@16: namespace range Chris@16: { Chris@16: /// \brief template function mismatch Chris@16: /// Chris@16: /// range-based version of the mismatch std algorithm Chris@16: /// Chris@16: /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept Chris@16: /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept Chris@16: /// \pre BinaryPredicate is a model of the BinaryPredicateConcept Chris@16: template< class SinglePassRange1, class SinglePassRange2 > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(SinglePassRange1& rng1, const SinglePassRange2 & rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2 > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2 > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(SinglePassRange1& rng1, SinglePassRange2 & rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2 > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::boost::begin(rng1), ::boost::end(rng1), Chris@16: ::boost::begin(rng2), ::boost::end(rng2)); Chris@16: } Chris@16: Chris@16: Chris@16: /// \overload Chris@16: template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2, class BinaryPredicate > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2, class BinaryPredicate > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::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 SinglePassRange1, class SinglePassRange2, class BinaryPredicate > Chris@16: inline std::pair< Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type, Chris@16: BOOST_DEDUCED_TYPENAME range_iterator::type > Chris@16: mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) Chris@16: { Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); Chris@16: Chris@16: return ::boost::range_detail::mismatch_impl( Chris@16: ::boost::begin(rng1), ::boost::end(rng1), Chris@16: ::boost::begin(rng2), ::boost::end(rng2), pred); Chris@16: } Chris@16: Chris@16: } // namespace range Chris@16: using range::mismatch; Chris@16: } // namespace boost Chris@16: Chris@16: #endif // include guard