LWG4465 §[alg.partitions] Clarify Returns: element

Fixes NB US 162-261 (C++26 CD).

Author: burblebee

source/algorithms.tex

@@ -9965,19 +9965,19 @@
 \effects
 For each iterator \tcode{i} in \range{first}{first + $N$},
 copies \tcode{*i} to the output range \range{out_true}{last_true}
-if \tcode{$E(\tcode{*i})$} is \tcode{true}, or
+if $E(\tcode{*i})$ is \tcode{true}, or
 to the output range \range{out_false}{last_false} otherwise.
 
 \pnum
 \returns
-Let \tcode{o1} be the iterator past the last copied element
-in the output range \range{out_true}{last_true},
-and \tcode{o2} be the iterator past the last copied element
-in the output range \range{out_false}{last_false}.
+Let $Q$ be the number of elements copied
+into the output range \range{out_true}{last_true},
+and $V$ be the number of elements copied
+into the output range \range{out_false}{last_false}.
 Returns:
 \begin{itemize}
-\item \tcode{\{o1, o2\}} for the overloads in namespace \tcode{std}.
-\item \tcode{\{first + $N$, o1, o2\}} for the overloads in namespace \tcode{ranges}.
+\item \tcode{\{out_true + $Q$, out_false + $V$\}} for the overloads in namespace \tcode{std}.
+\item \tcode{\{first + $N$, out_true + $Q$, out_false + $V$\}} for the overloads in namespace \tcode{ranges}.
 \end{itemize}
 
 \pnum