Lines Matching full:mismatch

1 [/ File mismatch.qbk]
3 [section:mismatch mismatch ]
12 The header file 'mismatch.hpp' contains two variants of a the stl algorithm `mismatch`. The algorit…
14 Before (the proposed) C++14 the algorithm `std::mismatch` took three iterators and an optional comp…
23 	std::mismatch ( seq1.begin (), seq1.end (), seq2.begin ()); // <3, 3>
24 	std::mismatch ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior
25 	std::mismatch ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // <3, 3>
30 However, if the two sequences are specified completely, it's clear that where the mismatch occurs.
34 …on `mismatch` returns a pair of iterators which denote the first mismatching elements in each sequ…
39 mismatch ( InputIterator1 first1, InputIterator1 last1, 
44 mismatch ( InputIterator1 first1, InputIterator1 last1, 
52 mismatch ( c1.begin(),     c1.end(),       c2.begin(), c2.end()) --> <c1.begin(), c2.begin()> // fi…
53 mismatch ( c1.begin() + 1, c1.begin() + 4, c2.begin(), c2.end()) --> <c1.begin() + 4, c2.end ()> //…
54 mismatch ( c1.end(),       c1.end(),       c2.end(),   c2.end()) --> <c1.end(), c2.end()> // empty …
59 `mismatch` works on all iterators except output iterators.
63 Both of the variants of `mismatch` run in ['O(N)] (linear) time; that is, they compare against each…
67 Both of the variants of `mismatch` take their parameters by value and do not depend upon any global…
71 * If the sequences are equal (or both are empty), then mismatch returns the end iterators of both s…
73 * The four iterator version of the routine `mismatch` is part of the C++14 standard. When C++14 sta…
77 [/ File mismatch.qbk