[alg.lex.comparison,specialized.algorithms] Remove extra whitespace (#…

…7518)

source/algorithms.tex

@@ -9453,7 +9453,7 @@
 \tcode{ranges::lexicographical_compare(I1, S1, I2, S2, Comp, Proj1, Proj2)}
 can be implemented as:
 \begin{codeblock}
-for ( ; first1 != last1 && first2 != last2 ; ++first1, (void) ++first2) {
+for (; first1 != last1 && first2 != last2; ++first1, (void)++first2) {
   if (invoke(comp, invoke(proj1, *first1), invoke(proj2, *first2))) return true;
   if (invoke(comp, invoke(proj2, *first2), invoke(proj1, *first1))) return false;
 }
@@ -11430,7 +11430,7 @@
 \effects
 Equivalent to:
 \begin{codeblock}
-for (; first != last; ++result, (void) ++first)
+for (; first != last; ++result, (void)++first)
   ::new (@\placeholdernc{voidify}@(*result))
     typename iterator_traits<NoThrowForwardIterator>::value_type(*first);
 \end{codeblock}
@@ -11486,7 +11486,7 @@
 \effects
 Equivalent to:
 \begin{codeblock}
-for ( ; n > 0; ++result, (void) ++first, --n)
+for (; n > 0; ++result, (void)++first, --n)
   ::new (@\placeholdernc{voidify}@(*result))
     typename iterator_traits<NoThrowForwardIterator>::value_type(*first);
 \end{codeblock}
@@ -11600,7 +11600,7 @@
 \effects
 Equivalent to:
 \begin{codeblock}
-for (; n > 0; ++result, (void) ++first, --n)
+for (; n > 0; ++result, (void)++first, --n)
   ::new (@\placeholdernc{voidify}@(*result))
     typename iterator_traits<NoThrowForwardIterator>::value_type(@\exposid{deref-move}@(first));
 return {first, result};