We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3de9b1c commit 3f3837aCopy full SHA for 3f3837a
source/algorithms.tex
@@ -4550,12 +4550,16 @@
4550
The type \tcode{Size}
4551
is convertible to an integral type\iref{conv.integral,class.conv}.
4552
4553
+\pnum
4554
+Let $E$ be \tcode{pred(*(i + n), value)}
4555
+for the overloads with a parameter \tcode{pred},
4556
+and \tcode{*(i + n) == value} otherwise.
4557
+
4558
\pnum
4559
\returns
4560
The first iterator \tcode{i} in the range \range{first}{last-count}
4561
such that for every non-negative integer \tcode{n} less than \tcode{count}
-the following corresponding conditions hold:
-\tcode{*(i + n) == value, pred(*(i + n), value) != false}.
4562
+the condition $E$ is true.
4563
Returns \tcode{last} if no such iterator is found.
4564
4565
0 commit comments