std::mismatch

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator1, class InputIterator2 >

std::pair< InputIterator1, InputIterator2 >
    mismatch( InputIterator1 first1,
              InputIterator1 last1,

              InputIterator2 first2 );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator1, class InputIterator2, class BinaryPredicate >

std::pair< InputIterator1, InputIterator2 >
    mismatch( InputIterator1 first1,
              InputIterator1 last1,
              InputIterator2 first2,

              BinaryPredicate p );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Returns the first mismatching pair of elements from two ranges: one defined by [first1, last1) and another starting at first2. The first version of the function uses operator== to compare the elements, the second version uses the given binary predicate p.

first1, last1	-	the first range of the elements
first2	-	the beginning of the second range of the elements
p	-	binary predicate which returns ​true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following:  bool pred(const Type1 &a, const Type2 &b); While the signature does not need to have const &, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1 & is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)). The types Type1 and Type2 must be such that objects of types InputIterator1 and InputIterator2 can be dereferenced and then implicitly converted to Type1 and Type2 respectively. ​

Template:cpp with iterators to the first two non-equivalent elements, or, if no different elements found, pair with last1 and the corresponding iterator from the second range.

linear in the distance between first1 and last1

Template:eq fun cpp Template:see also Template:cpp/algorithm/dcl list equalTemplate:cpp/algorithm/dcl list findTemplate:cpp/algorithm/dcl list lexicographical compareTemplate:cpp/algorithm/dcl list search