Merge pull request HappyCerberus#6 from simogasp/patch-1

HappyCerberus · web-flow · commit 658b94e5d801 · 2022-12-30T18:41:41.000+01:00
[ch03] missing formatting for std::unique
diff --git a/chapters/03_algorithms_06_linear_sorted.tex b/chapters/03_algorithms_06_linear_sorted.tex
@@ -62,7 +62,7 @@ \subsection{\texorpdfstring{\cpp{std::unique}, \cpp{std::unique_copy}}{\texttt{s
 \index{\cpp{std::unique}}
 \index{\cpp{std::unique_copy}}
 
-The std::unique algorithm removes consecutive duplicate values. The typical use case is in conjunction with a sorted range. However, this is not a requirement of std::unique.
+The \cpp{std::unique} algorithm removes consecutive duplicate values. The typical use case is in conjunction with a sorted range. However, this is not a requirement of \cpp{std::unique}.
 
 \cppversions{\texttt{unique}}{\CC98}{\CC20}{\CC17}{\CC20}
 \constraints{\texttt{forward\_range}}{\texttt{forward\_range}}{\texttt{operator==}}{\texttt{binary\_predicate}}
@@ -75,7 +75,7 @@ \subsection{\texorpdfstring{\cpp{std::unique}, \cpp{std::unique_copy}}{\texttt{s
 \cppfile{code_examples/algorithms/unique_code.h}
 \end{box-note}
 
-The \cpp{std::unique_copy} is a variant of std::unique that outputs the unique values to a second range.
+The \cpp{std::unique_copy} is a variant of \cpp{std::unique} that outputs the unique values to a second range.
 
 \cppversions{\texttt{unique\_copy}}{\CC98}{\CC20}{\CC17}{\CC20}
 \constraints{\texttt{input\_range -> output\_iterator}}{\texttt{forward\_range -> forward\_iterator}}{\texttt{operator==}}{\texttt{binary\_predicate}}
@@ -84,4 +84,4 @@ \subsection{\texorpdfstring{\cpp{std::unique}, \cpp{std::unique_copy}}{\texttt{s
 \footnotesize Example of using \cpp{std::unique_copy}.
 \tcblower
 \cppfile{code_examples/algorithms/unique_copy_code.h}
-\end{box-note}
+\end{box-note}
