Improve line breaking (resolves some 'Overfull \hbox' warnings) (#1068)

Partially addresses #693.

Author: jensmaurer

source/algorithms.tex

@@ -1044,23 +1044,23 @@
 \tcode{InputIterator},
 \tcode{InputIterator1},
 or
-\tcode{InputIterator2},
+\tcode{Input\-Iterator2},
 the template argument shall satisfy the
 requirements of an input iterator~(\ref{input.iterators}).
 \item
 If an algorithm's template parameter is named
 \tcode{OutputIterator},
 \tcode{OutputIterator1},
 or
-\tcode{OutputIterator2},
+\tcode{Output\-Iterator2},
 the template argument shall satisfy the requirements
 of an output iterator~(\ref{output.iterators}).
 \item
 If an algorithm's template parameter is named
 \tcode{ForwardIterator},
 \tcode{ForwardIterator1},
 or
-\tcode{ForwardIterator2},
+\tcode{Forward\-Iterator2},
 the template argument shall satisfy the requirements
 of a forward iterator~(\ref{forward.iterators}).
 \item
@@ -3881,7 +3881,10 @@
 
 \begin{itemdescr}
 \pnum
-\returns \tcode{is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last}
+\returns
+\begin{codeblock}
+is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last
+\end{codeblock}
 \end{itemdescr}
 
 
@@ -5206,7 +5209,7 @@
 \requires
 The value of \tcode{lo} shall be no greater than \tcode{hi}.
 For the first form, type \tcode{T}
-shall be \tcode{LessThanComparable} (Table~\ref{tab:lessthancomparable}).
+shall be \tcode{LessThan\-Comparable} (Table~\ref{tab:lessthancomparable}).
 
 \pnum
 \returns

source/atomics.tex

@@ -465,14 +465,22 @@
     operator @\placeholdernc{integral}@() const noexcept;
     @\placeholdernc{integral}@ exchange(@\placeholdernc{integral}@, memory_order = memory_order_seq_cst) volatile noexcept;
     @\placeholdernc{integral}@ exchange(@\placeholdernc{integral}@, memory_order = memory_order_seq_cst) noexcept;
-    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order, memory_order) volatile noexcept;
-    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order, memory_order) noexcept;
-    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order, memory_order) volatile noexcept;
-    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order, memory_order) noexcept;
-    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order = memory_order_seq_cst) volatile noexcept;
-    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order = memory_order_seq_cst) noexcept;
-    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order = memory_order_seq_cst) volatile noexcept;
-    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@, memory_order = memory_order_seq_cst) noexcept;
+    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order, memory_order) volatile noexcept;
+    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order, memory_order) noexcept;
+    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                                 memory_order, memory_order) volatile noexcept;
+    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                                 memory_order, memory_order) noexcept;
+    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_weak(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order = memory_order_seq_cst) noexcept;
+    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order = memory_order_seq_cst) volatile noexcept;
+    bool compare_exchange_strong(@\placeholder{integral}@&,@\itcorr[-1]@ @\placeholdernc{integral}@,
+                               memory_order = memory_order_seq_cst) noexcept;
     @\placeholdernc{integral}@ fetch_add(@\placeholdernc{integral}@, memory_order = memory_order_seq_cst) volatile noexcept;
     @\placeholdernc{integral}@ fetch_add(@\placeholdernc{integral}@, memory_order = memory_order_seq_cst) noexcept;
     @\placeholdernc{integral}@ fetch_sub(@\placeholdernc{integral}@, memory_order = memory_order_seq_cst) volatile noexcept;

source/containers.tex

@@ -3209,8 +3209,8 @@
 
 \begin{itemdescr}
 \pnum \returns
-A pointer such that \range{data()}{data() + size()} is a valid range, and
-\tcode{data() == addressof(front())}.
+A pointer such that \tcode{data() == addressof(front())},
+and \range{data()}{data() + size()} is a valid range.
 \end{itemdescr}
 
 \rSec3[array.fill]{\tcode{array::fill}}
@@ -6338,7 +6338,7 @@
 \pnum
 \requires
 \tcode{is_assignable_v<mapped_type\&, M\&\&>} shall be \tcode{true}.
-\tcode{value_type} shall be \tcode{EmplaceConstructible} into \tcode{map}
+\tcode{value_type} shall be \tcode{Emplace\-Constructible} into \tcode{map}
 from \tcode{k}, \tcode{forward<M>(obj)}.
 
 \pnum
@@ -6373,7 +6373,7 @@
 \pnum
 \requires
 \tcode{is_assignable_v<mapped_type\&, M\&\&>} shall be \tcode{true}.
-\tcode{value_type} shall be \tcode{EmplaceConstructible} into \tcode{map}
+\tcode{value_type} shall be \tcode{Emplace\-Constructible} into \tcode{map}
 from \tcode{move(k)}, \tcode{forward<M>(obj)}.
 
 \pnum
@@ -7830,7 +7830,7 @@
 \pnum
 \requires
 \tcode{is_assignable_v<mapped_type\&, M\&\&>} shall be \tcode{true}.
-\tcode{value_type} shall be \tcode{EmplaceConstructible} into \tcode{unordered_map}
+\tcode{value_type} shall be \tcode{Emplace\-Constructible} into \tcode{unordered_map}
 from \tcode{k}, \tcode{forward<M>(obj)}.
 
 \pnum
@@ -7865,7 +7865,7 @@
 \pnum
 \requires
 \tcode{is_assignable_v<mapped_type\&, M\&\&>} shall be \tcode{true}.
-\tcode{value_type} shall be \tcode{EmplaceConstructible} into \tcode{unordered_map}
+\tcode{value_type} shall be \tcode{Emplace\-Constructible} into \tcode{unordered_map}
 from \tcode{move(k)}, \tcode{forward<M>(obj)}.
 
 \pnum

source/declarations.tex

@@ -227,12 +227,12 @@
 
 \pnum
 A \grammarterm{nodeclspec-function-declaration} shall declare a
-constructor, destructor, or conversion function.  \footnote{The
+constructor, destructor, or conversion function.\footnote{The
 ``implicit int'' rule of C is no longer supported.}
 \begin{note}
 A \grammarterm{nodeclspec-function-declaration} can only be used in a
 \grammarterm{template-declaration}~(Clause~\ref{temp}),
-\grammarterm{explicit-instantiation}~(\ref{temp.explicit}), or
+\grammarterm{explicit-instantiation} (\ref{temp.explicit}), or
 \grammarterm{explicit-specialization}~(\ref{temp.expl.spec}).
 \end{note}
 

source/tables.tex

@@ -387,7 +387,7 @@
 {
  \begin{LongTable}
  {#1}{#2}
- {x{.30\hsize}x{.68\hsize}}
+ {x{.30\hsize}x{.64\hsize}}
 }
 {
  \end{LongTable}
@@ -457,7 +457,7 @@
 {
  \begin{LongTable}
  {#1}{#2}
- {x{.35\hsize}x{.28\hsize}x{.30\hsize}}
+ {x{.35\hsize}x{.28\hsize}x{.29\hsize}}
 }
 {
  \end{LongTable}