Add missing \tcode markup

Signed-off-by: Matthias Kretz <[email protected]>

Author: mattkretz

src/algorithms.tex

@@ -344,7 +344,7 @@
 \end{itemize}
 
 The first element in the input sequence is \tcode{start}. Each subsequent element is generated by adding \tcode{stride} to the previous element, if \tcode{stride} is specified, otherwise by incrementing the previous element.
-\begin{note}As described in the \Cpp Standard, \CppXref{algorithms.general}, arithmetic on non-random-access iterators is performed using advance and distance.\end{note}
+\begin{note}As described in the \Cpp Standard, \CppXref{algorithms.general}, arithmetic on non-random-access iterators is performed using \tcode{advance} and \tcode{distance}.\end{note}
 \begin{note}The order of the elements of the input sequence is important for determining ordinal position of an application of $f$, even though the applications themselves may be unordered.\end{note}
 
 The first argument to $f$ is an element from the input sequence.\begin{note}If \tcode{I} is an iterator type, the iterators in the input sequence are not dereferenced before being passed to $f$.\end{note} For each member of the \tcode{rest} parameter pack excluding $f$, an additional argument is passed to each application of $f$ as follows:

src/taskblock.tex

@@ -151,7 +151,7 @@
 \tcode{run(f)} (the continuation), or indeterminately sequenced within the same thread
 as the continuation. The call to \tcode{run} synchronizes with the call to the function
 object. The completion of the call to the function object synchronizes with the
-next invocation of wait on the same task_block or completion of the nearest
+next invocation of wait on the same \tcode{task_block} or completion of the nearest
 enclosing task block (i.e., the \tcode{define_task_block} or
     \tcode{define_task_block_restore_thread} that created this \tcode{task_block}).