Difference between revisions of "cpp/algorithm/mismatch"
m (Text replace - "{{see also}}" to "===See also===") |
m (Text replace - "<!-- ======== --> " to "") |
||
| Line 22: | Line 22: | ||
Returns the first mismatching pair of elements from two ranges: one defined by {{tt|[first1, last1)}} and another starting at {{tt|first2}}. The first version of the function uses {{tt|operator{{==}}}} to compare the elements, the second version uses the given binary predicate {{tt|p}}. | Returns the first mismatching pair of elements from two ranges: one defined by {{tt|[first1, last1)}} and another starting at {{tt|first2}}. The first version of the function uses {{tt|operator{{==}}}} to compare the elements, the second version uses the given binary predicate {{tt|p}}. | ||
| − | |||
===Parameters=== | ===Parameters=== | ||
{{param list begin}} | {{param list begin}} | ||
| Line 30: | Line 29: | ||
{{param list end}} | {{param list end}} | ||
| − | |||
===Return value=== | ===Return value=== | ||
{{cpp|std::pair}} with iterators to the first two non-equivalent elements, or, if no different elements found, pair with {{tt|last1}} and the corresponding iterator from the second range. | {{cpp|std::pair}} with iterators to the first two non-equivalent elements, or, if no different elements found, pair with {{tt|last1}} and the corresponding iterator from the second range. | ||
| − | |||
===Complexity=== | ===Complexity=== | ||
linear in the distance between {{tt|first1}} and {{tt|last1}} | linear in the distance between {{tt|first1}} and {{tt|last1}} | ||
| − | |||
===Equivalent function=== | ===Equivalent function=== | ||
{{eq fun cpp | {{eq fun cpp | ||
| Line 69: | Line 65: | ||
}} | }} | ||
| − | |||
===Example=== | ===Example=== | ||
{{todo}} | {{todo}} | ||
| − | |||
===See also=== | ===See also=== | ||
{{dcl list begin}} | {{dcl list begin}} | ||
Revision as of 18:11, 2 August 2011
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >std::pair< InputIterator1, InputIterator2 >
mismatch( InputIterator1 first1,
InputIterator1 last1,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >std::pair< InputIterator1, InputIterator2 >
mismatch( InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2,
<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.
Contents |
Parameters
| 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) |
Return value
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.
Complexity
linear in the distance between first1 and last1
Equivalent function
Example
| This section is incomplete |
