[everywhere] Convert '\footnote' to 'footnote' environment

Author: jensmaurer

source/algorithms.tex

@@ -129,14 +129,16 @@
 \end{note}
 
 \pnum
-Both in-place and copying versions are provided for certain algorithms.%
-\footnote{The decision whether to include a copying version was
+Both in-place and copying versions are provided for certain algorithms.
+\begin{footnote}
+The decision whether to include a copying version was
 usually based on complexity considerations.
 When the cost of doing the operation dominates the cost of copy,
 the copying version is not included.
 For example, \tcode{sort_copy} is not included
 because the cost of sorting is much more significant,
-and users might as well do \tcode{copy} followed by \tcode{sort}.}
+and users might as well do \tcode{copy} followed by \tcode{sort}.
+\end{footnote}
 When such a version is provided for \textit{algorithm} it is called
 \textit{algorithm\tcode{_copy}}.
 Algorithms that take predicates end with the suffix \tcode{_if}
@@ -4445,9 +4447,11 @@
 \effects
 Copies elements in the range \range{first}{last}
 into the range \range{result - $N$}{result}
-starting from \tcode{last - 1} and proceeding to \tcode{first}.%
-\footnote{\tcode{copy_backward} can be used instead of copy
-when \tcode{last} is in the range \range{result - $N$}{result}.}
+starting from \tcode{last - 1} and proceeding to \tcode{first}.
+\begin{footnote}
+\tcode{copy_backward} can be used instead of copy
+when \tcode{last} is in the range \range{result - $N$}{result}.
+\end{footnote}
 For each positive integer $n \le N$,
 performs \tcode{*(result - $n$) = *(last - $n$)}.
 
@@ -4596,9 +4600,11 @@
 \effects
 Moves elements in the range \range{first}{last}
 into the range \range{result - $N$}{result}
-starting from \tcode{last - 1} and proceeding to \tcode{first}.%
-\footnote{\tcode{move_backward} can be used instead of move
-when \tcode{last} is in the range \range{result - $N$}{result}.}
+starting from \tcode{last - 1} and proceeding to \tcode{first}.
+\begin{footnote}
+\tcode{move_backward} can be used instead of move
+when \tcode{last} is in the range \range{result - $N$}{result}.
+\end{footnote}
 For each positive integer $n \le N$,
 performs \tcode{*(result - $n$) = $E$}.
 
@@ -4799,8 +4805,10 @@
 \begin{itemize}
 \item \crange{first1}{first1 + $N$},
 \item \crange{first2}{first2 + $N$}, and
-\item \crange{result}{result + $N$}.%
-\footnote{The use of fully closed ranges is intentional.}
+\item \crange{result}{result + $N$}.
+\begin{footnote}
+The use of fully closed ranges is intentional.
+\end{footnote}
 \end{itemize}
 
 \pnum
@@ -8451,8 +8459,11 @@
 \tcode{\{first, first\}} if \range{first}{last} is empty, otherwise
 \tcode{\{m, M\}}, where \tcode{m} is
 the first iterator in \range{first}{last} such that no iterator in the range refers
-to a smaller element, and where \tcode{M} is the last iterator\footnote{This behavior
-intentionally differs from \tcode{max_element}.}
+to a smaller element, and where \tcode{M} is the last iterator
+\begin{footnote}
+This behavior
+intentionally differs from \tcode{max_element}.
+\end{footnote}
 in \range{first}{last} such that no iterator in the range refers to a larger element.
 
 \pnum
@@ -9033,8 +9044,10 @@
 and \oldconcept{CopyAssignable} (\tref{cpp17.copyassignable}) requirements.
 In the range \crange{first}{last},
 \tcode{binary_op} neither modifies elements
-nor invalidates iterators or subranges.%
-\footnote{The use of fully closed ranges is intentional.}
+nor invalidates iterators or subranges.
+\begin{footnote}
+The use of fully closed ranges is intentional.
+\end{footnote}
 
 \pnum
 \effects
@@ -9043,11 +9056,13 @@
 and then modifies it with
 \tcode{acc = std::move(acc) + *i} or
 \tcode{acc = binary_op(std::move(acc), *i)}
-for every iterator \tcode{i} in the range \range{first}{last} in order.%
-\footnote{\tcode{accumulate} is similar
+for every iterator \tcode{i} in the range \range{first}{last} in order.
+\begin{footnote}
+\tcode{accumulate} is similar
 to the APL reduction operator and Common Lisp reduce function,
 but it avoids the difficulty of defining the result of reduction
-on an empty sequence by always requiring an initial value.}
+on an empty sequence by always requiring an initial value.
+\end{footnote}
 \end{itemdescr}
 
 \rSec2[reduce]{Reduce}
@@ -9197,8 +9212,10 @@
 In the ranges \crange{first1}{last1} and
 \crange{first2}{first2 + (last1 - first1)}
 \tcode{binary_op1} and \tcode{binary_op2}
-neither modifies elements nor invalidates iterators or subranges.%
-\footnote{The use of fully closed ranges is intentional.}
+neither modifies elements nor invalidates iterators or subranges.
+\begin{footnote}
+The use of fully closed ranges is intentional.
+\end{footnote}
 
 \pnum
 \effects
@@ -9387,8 +9404,10 @@
 \expects
 In the ranges \crange{first}{last} and \crange{result}{result + (last - first)}
 \tcode{binary_op} neither modifies elements
-nor invalidates iterators or subranges.%
-\footnote{The use of fully closed ranges is intentional.}
+nor invalidates iterators or subranges.
+\begin{footnote}
+The use of fully closed ranges is intentional.
+\end{footnote}
 
 \pnum
 \effects
@@ -9889,8 +9908,10 @@
   For all overloads, in the ranges \crange{first}{last}
   and \crange{result}{result + (last - first)},
   \tcode{binary_op} neither modifies elements
-  nor invalidate iterators or subranges.%
-  \footnote{The use of fully closed ranges is intentional.}
+  nor invalidate iterators or subranges.
+\begin{footnote}
+The use of fully closed ranges is intentional.
+\end{footnote}
 \end{itemize}
 
 

source/atomics.tex

@@ -637,11 +637,12 @@
 
 \pnum
 \recommended
-Operations that are lock-free should also be address-free%
-\footnote{
+Operations that are lock-free should also be address-free
+\begin{footnote}
 That is,
 atomic operations on the same memory location via two different addresses will
-communicate atomically.}.
+communicate atomically.
+\end{footnote}.
 The implementation of these operations should not depend on any per-process state.
 \begin{note}
 This restriction enables communication by memory that is