1 // Copyright Neil Groves 2009. Use, modification and
2 // distribution is subject to the Boost Software License, Version
3 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
4 // http://www.boost.org/LICENSE_1_0.txt)
7 // For more information, see http://www.boost.org/libs/range/
9 #ifndef BOOST_RANGE_ALGORITHM_MISMATCH_HPP_INCLUDED
10 #define BOOST_RANGE_ALGORITHM_MISMATCH_HPP_INCLUDED
12 #include <boost/concept_check.hpp>
13 #include <boost/range/begin.hpp>
14 #include <boost/range/end.hpp>
15 #include <boost/range/concepts.hpp>
16 #include <boost/range/difference_type.hpp>
21 namespace range_detail
23 template< class SinglePassTraversalReadableIterator1,
24 class SinglePassTraversalReadableIterator2 >
25 inline std::pair<SinglePassTraversalReadableIterator1,
26 SinglePassTraversalReadableIterator2>
27 mismatch_impl(SinglePassTraversalReadableIterator1 first1,
28 SinglePassTraversalReadableIterator1 last1,
29 SinglePassTraversalReadableIterator2 first2,
30 SinglePassTraversalReadableIterator2 last2)
32 while (first1 != last1 && first2 != last2 && *first1 == *first2)
37 return std::pair<SinglePassTraversalReadableIterator1,
38 SinglePassTraversalReadableIterator2>(first1, first2);
41 template< class SinglePassTraversalReadableIterator1,
42 class SinglePassTraversalReadableIterator2,
43 class BinaryPredicate >
44 inline std::pair<SinglePassTraversalReadableIterator1,
45 SinglePassTraversalReadableIterator2>
46 mismatch_impl(SinglePassTraversalReadableIterator1 first1,
47 SinglePassTraversalReadableIterator1 last1,
48 SinglePassTraversalReadableIterator2 first2,
49 SinglePassTraversalReadableIterator2 last2,
52 while (first1 != last1 && first2 != last2 && pred(*first1, *first2))
57 return std::pair<SinglePassTraversalReadableIterator1,
58 SinglePassTraversalReadableIterator2>(first1, first2);
60 } // namespace range_detail
64 /// \brief template function mismatch
66 /// range-based version of the mismatch std algorithm
68 /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept
69 /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept
70 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
71 template< class SinglePassRange1, class SinglePassRange2 >
73 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
74 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type >
75 mismatch(SinglePassRange1& rng1, const SinglePassRange2 & rng2)
77 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
78 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
80 return ::boost::range_detail::mismatch_impl(
81 ::boost::begin(rng1), ::boost::end(rng1),
82 ::boost::begin(rng2), ::boost::end(rng2));
86 template< class SinglePassRange1, class SinglePassRange2 >
88 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
89 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type >
90 mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2)
92 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
93 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
95 return ::boost::range_detail::mismatch_impl(
96 ::boost::begin(rng1), ::boost::end(rng1),
97 ::boost::begin(rng2), ::boost::end(rng2));
101 template< class SinglePassRange1, class SinglePassRange2 >
103 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
104 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type >
105 mismatch(SinglePassRange1& rng1, SinglePassRange2 & rng2)
107 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
108 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
110 return ::boost::range_detail::mismatch_impl(
111 ::boost::begin(rng1), ::boost::end(rng1),
112 ::boost::begin(rng2), ::boost::end(rng2));
116 template< class SinglePassRange1, class SinglePassRange2 >
118 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
119 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type >
120 mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2)
122 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
123 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
125 return ::boost::range_detail::mismatch_impl(
126 ::boost::begin(rng1), ::boost::end(rng1),
127 ::boost::begin(rng2), ::boost::end(rng2));
132 template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate >
134 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
135 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type >
136 mismatch(SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred)
138 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
139 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
141 return ::boost::range_detail::mismatch_impl(
142 ::boost::begin(rng1), ::boost::end(rng1),
143 ::boost::begin(rng2), ::boost::end(rng2), pred);
147 template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate >
149 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
150 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type >
151 mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred)
153 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
154 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
156 return ::boost::range_detail::mismatch_impl(
157 ::boost::begin(rng1), ::boost::end(rng1),
158 ::boost::begin(rng2), ::boost::end(rng2), pred);
162 template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate >
164 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type,
165 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type >
166 mismatch(SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred)
168 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
169 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
171 return ::boost::range_detail::mismatch_impl(
172 ::boost::begin(rng1), ::boost::end(rng1),
173 ::boost::begin(rng2), ::boost::end(rng2), pred);
177 template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate >
179 BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type,
180 BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type >
181 mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred)
183 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
184 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
186 return ::boost::range_detail::mismatch_impl(
187 ::boost::begin(rng1), ::boost::end(rng1),
188 ::boost::begin(rng2), ::boost::end(rng2), pred);
192 using range::mismatch;
195 #endif // include guard