[mismatch] LWG3178 std::mismatch is missing an upper bound

Author: jensmaurer

source/algorithms.tex

@@ -3654,17 +3654,18 @@
   for the overloads with both parameters \tcode{pred} and \tcode{proj1}.
 \end{itemize}
 
+\pnum
+Let $N$ be $\min(\tcode{last1 - first1}, \ \tcode{last2 - first2})$.
+
 \pnum
 \returns
 \tcode{\{ first1 + n, first2 + n \}},
-where \tcode{n} is the smallest integer such that $E$ holds,
-or $\min(\tcode{last1 - first1}, \ \tcode{last2 - first2})$
-if no such integer exists.
+where \tcode{n} is the smallest integer in \range{0}{$N$} such that $E$ holds,
+or $N$ if no such integer exists.
 
 \pnum
 \complexity
-At most $\min(\tcode{last1 - first1}, \ \tcode{last2 - first2})$
-applications of the corresponding predicate and any projections.
+At most $N$ applications of the corresponding predicate and any projections.
 \end{itemdescr}
 
 \rSec2[alg.equal]{Equal}