Fixup overfull hboxen

Author: CaseyCarter

source/concepts.tex

@@ -315,7 +315,7 @@
 and either
 \tcode{is_base_of_v<Base, Derived>}
 or
-\tcode{is_convertible_v<const volatile Derived*, const volatile Base*>}.
+\tcode{is_convertible_v<const volatile Derived*, const \brk{}volatile \brk{}Base*>}.
 
 \pnum
 \begin{note}
@@ -625,7 +625,9 @@
 \item $E_u$ be an expression that denotes \tcode{u1} such that
   \tcode{decltype(($E_u$))} is \tcode{U}, and
 \item \tcode{C} be
-  \tcode{common_reference_t<const remove_reference_t<T>\&, const remove_reference_t<U>\&>}.
+  \begin{codeblock}
+    common_reference_t<const remove_reference_t<T>&, const remove_reference_t<U>&>
+  \end{codeblock}
 \end{itemize}
 \tcode{SwappableWith<T, U>} is satisfied only if after evaluating either
 \tcode{swap($E_t$, $E_u$)} or \tcode{swap($E_u$, $E_t$)} in the context described
@@ -745,7 +747,7 @@
 \begin{itemdescr}
 \pnum
 There need be no subsumption relationship between \tcode{Constructible<T, Args...>}
-and \tcode{is_constructible_v<T, Args...>}.
+and \tcode{is_const\-ruct\-ible_v<T, Args...>}.
 \end{itemdescr}
 
 \rSec2[concepts.lib.corelang.defaultconstructible]{Concept \tcode{DefaultConstructible}}
@@ -922,7 +924,10 @@
 concept EqualityComparableWith =
   EqualityComparable<T> && EqualityComparable<U> &&
   CommonReference<const remove_reference_t<T>&, const remove_reference_t<U>&> &&
-  EqualityComparable<common_reference_t<const remove_reference_t<T>&, const remove_reference_t<U>&>> &&
+  EqualityComparable<
+    common_reference_t<
+      const remove_reference_t<T>&,
+      const remove_reference_t<U>&>> &&
   @\placeholder{weakly-equality-comparable-with}@<T, U>;
 \end{itemdecl}
 
@@ -975,7 +980,10 @@
 template <class T, class U>
 concept StrictTotallyOrderedWith = StrictTotallyOrdered<T> && StrictTotallyOrdered<U> &&
   CommonReference<const remove_reference_t<T>&, const remove_reference_t<U>&> &&
-  StrictTotallyOrdered<common_reference_t<const remove_reference_t<T>&, const remove_reference_t<U>&>> &&
+  StrictTotallyOrdered<
+    common_reference_t<
+      const remove_reference_t<T>&,
+      const remove_reference_t<U>&>> &&
   EqualityComparableWith<T, U> &&
   requires(const remove_reference_t<T>& t,
            const remove_reference_t<U>& u) {
@@ -1163,8 +1171,11 @@
 \item \tcode{r} be an expression such that \tcode{decltype((r))} is \tcode{R},
 \item \tcode{t} be an expression such that \tcode{decltype((t))} is \tcode{T},
 \item \tcode{u} be an expression such that \tcode{decltype((u))} is \tcode{U}, and
-\item \tcode{C} be \tcode{common_reference_t<const remove_reference_t<T>\&,
-  const remove_reference_t<U>\&>}.
+\item \tcode{C} be
+  \begin{codeblock}
+  common_reference_t<const remove_reference_t<T>&,
+  const remove_reference_t<U>&>
+  \end{codeblock}
 \end{itemize}
 \tcode{Relation<R, T, U>} is satisfied only if
 

source/utilities.tex

@@ -17033,7 +17033,7 @@
 \begin{itemize}
 \item If \tcode{A} and \tcode{B} are both lvalue reference types,
   \tcode{COMMON_REF(A, B)} is
-  \tcode{COND_RES(COPYCV(X, Y) \&, COPYCV(Y, X) \&)} if that type exists
+  \tcode{COND_RES(COPYCV(X, Y) \&, COPYCV(\brk{}Y, X) \&)} if that type exists
   and is a reference type.
 \item Otherwise, let \tcode{C} be \tcode{remove_reference_t<COMMON_REF(X\&, Y\&)>\&\&}.
   If \tcode{A} and \tcode{B} are both rvalue reference types,
@@ -17140,7 +17140,7 @@
     \tcode{type} denotes that type.
 
   \item Otherwise, if \tcode{basic_common_reference<remove_cvref_t<T1>, remove_cvref_t<T2>,
-    XREF(T1), XREF(T2)>::type} is well-formed, then the member typedef
+    \brk{}XREF(\brk{}T1), XREF(T2)>::type} is well-formed, then the member typedef
     \tcode{type} denotes that type.
 
   \item Otherwise, if \tcode{COND_RES(T1, T2)} is well-formed, then the