Loading...
Searching...
No Matches
Go to the source code of this file.
|
| template<typename InputIt1 , typename InputIt2 > |
| constexpr auto | mismatch (InputIt1 first1, InputIt1 last1, InputIt2 first2) -> pair< InputIt1, InputIt2 > |
| |
| template<typename InputIt1 , typename InputIt2 > |
| constexpr auto | mismatch (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2) -> pair< InputIt1, InputIt2 > |
| |
| template<typename InputIt1 , typename InputIt2 , typename Predicate > |
| constexpr auto | mismatch (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, Predicate pred) -> pair< InputIt1, InputIt2 > |
| |
| template<typename InputIt1 , typename InputIt2 , typename Predicate > |
| constexpr auto | mismatch (InputIt1 first1, InputIt1 last1, InputIt2 first2, Predicate pred) -> pair< InputIt1, InputIt2 > |
| | Returns the first mismatching pair of elements from two ranges: one defined by [first1, last1) and another defined by [first2,last2). If last2 is not provided (overloads (1-4)), it denotes first2 + (last1 - first1). Elements are compared using the given binary predicate pred.
|
| |