[lib] Use table references for CamelCase requirements.

Author: jensmaurer

source/iostreams.tex

@@ -10418,7 +10418,8 @@
 \end{codeblock}
 
 \pnum
-\tcode{Allocator} shall satisfy the allocator requirements\iref{allocator.requirements}.
+\tcode{Allocator} shall satisfy the \tcode{Allocator} requirements
+(\tref{utilities.allocator.requirements}).
 
 \pnum
 \begin{example}
@@ -10761,7 +10762,7 @@
 
 \pnum
 Template parameters named \tcode{Allocator} shall satisfy the
-Allocator requirements\iref{allocator.requirements}.
+\tcode{Allocator} requirements (\tref{utilities.allocator.requirements}).
 
 \rSec3[fs.req.namespace]{Namespaces and headers}
 

source/lib-intro.tex

@@ -1759,8 +1759,8 @@
 
 \begin{itemize}
 \item it is a function object type\iref{function.objects},
-\item it satisfies the requirements of \tcode{CopyConstructible} and
-  \tcode{Destructible}\iref{utility.arg.requirements}, and
+\item it satisfies the requirements of \tcode{CopyConstructible} (\tref{copyconstructible}) and
+  \tcode{Destructible} (\tref{destructible}), and
 \item the expressions shown in \tref{hash}
 are valid and have the indicated semantics.
 \end{itemize}
@@ -2085,10 +2085,10 @@
 
 \pnum
 An allocator type \tcode{X} shall satisfy the requirements of
-\tcode{CopyConstructible}\iref{utility.arg.requirements}.
+\tcode{CopyConstructible} (\tref{copyconstructible}).
 The \tcode{X::pointer}, \tcode{X::const_pointer}, \tcode{X::void_pointer}, and
 \tcode{X::const_void_pointer} types shall satisfy the requirements of
-\tcode{NullablePointer}\iref{nullablepointer.requirements}.
+\tcode{NullablePointer} (\tref{nullablepointer}).
 No constructor,
 comparison function, copy operation, move operation, or swap operation on
 these pointer types shall exit via an exception. \tcode{X::pointer} and \tcode{X::const_pointer} shall also

source/support.tex

@@ -3390,7 +3390,7 @@
 
 \pnum
 \tcode{exception_ptr} shall satisfy the requirements of
-\tcode{NullablePointer}\iref{nullablepointer.requirements}.
+\tcode{NullablePointer} (\tref{nullablepointer}).
 
 \pnum
 Two non-null values of type \tcode{exception_ptr} are equivalent and compare equal if and

source/threads.tex

@@ -3934,7 +3934,8 @@
 
 \begin{itemdescr}
 \pnum
-\requires \tcode{Alloc} shall be an Allocator\iref{allocator.requirements}.
+\requires \tcode{Alloc} shall satisfy the \tcode{Allocator}
+requirements (\tref{utilities.allocator.requirements}).
 \end{itemdescr}
 
 

source/utilities.tex

@@ -1391,8 +1391,8 @@
 
 \begin{itemdescr}
 \pnum
-\requires \tcode{Alloc} shall satisfy the requirements for an
-\tcode{Allocator}\iref{allocator.requirements}.
+\requires \tcode{Alloc} shall satisfy the
+\tcode{Allocator} requirements (\tref{utilities.allocator.requirements}).
 
 \pnum
 \effects Equivalent to the preceding constructors except that each element is constructed with
@@ -2054,7 +2054,8 @@
 
 \begin{itemdescr}
 \pnum
-\requires \tcode{Alloc} shall be an \tcode{Allocator}\iref{allocator.requirements}.
+\requires \tcode{Alloc} shall satisfy the \tcode{Allocator}
+requirements (\tref{utilities.allocator.requirements}).
 
 \pnum
 \begin{note} Specialization of this trait informs other library components that
@@ -7103,7 +7104,7 @@
 disambiguate constructor and function overloading. Specifically, several types (see
 \tcode{tuple}~\ref{tuple}) have constructors with \tcode{allocator_arg_t} as the first
 argument, immediately followed by an argument of a type that satisfies the
-\tcode{Allocator} requirements\iref{allocator.requirements}.
+\tcode{Allocator} requirements (\tref{utilities.allocator.requirements}).
 
 \rSec2[allocator.uses]{\tcode{uses_allocator}}
 
@@ -8120,10 +8121,10 @@
 D>::pointer} shall be a synonym for \tcode{remove_reference_t<D>::pointer}. Otherwise
 \tcode{unique_ptr<T, D>::pointer} shall be a synonym for \tcode{element_type*}. The type \tcode{unique_ptr<T,
 D>::pointer} shall
-satisfy the requirements of \tcode{NullablePointer}\iref{nullablepointer.requirements}.
+satisfy the requirements of \tcode{NullablePointer} (\tref{nullablepointer}).
 
 \pnum
-\begin{example} Given an allocator type \tcode{X}\iref{allocator.requirements} and
+\begin{example} Given an allocator type \tcode{X} (\tref{utilities.allocator.requirements}) and
 letting \tcode{A} be a synonym for \tcode{allocator_traits<X>}, the types \tcode{A::pointer},
 \tcode{A::const_pointer}, \tcode{A::void_pointer}, and \tcode{A::const_void_pointer}
 may be used as \tcode{unique_ptr<T, D>::pointer}. \end{example}
@@ -9253,7 +9254,8 @@
 initialized with \tcode{std::move(d)} shall not throw exceptions.
 The expression \tcode{d(p)}
 shall have well-defined behavior and shall not throw exceptions.
-\tcode{A} shall be an allocator\iref{allocator.requirements}.
+\tcode{A} shall satisfy the \tcode{Allocator} requirements
+(\tref{utilities.allocator.requirements}).
 
 \pnum\effects  Constructs a \tcode{shared_ptr} object that owns the
 object \tcode{p} and the deleter \tcode{d}.
@@ -9653,7 +9655,8 @@
 
 \begin{itemdescr}
 \pnum
-\requires \tcode{A} shall be an allocator\iref{allocator.requirements}.
+\requires \tcode{A} shall satisfy the \tcode{Allocator}
+requirements (\tref{utilities.allocator.requirements}).
 
 \pnum
 \effects Allocates memory for an object of type \tcode{T}
@@ -11304,7 +11307,7 @@
 
 \pnum
 A specialization of class template \tcode{pmr::polymorphic_allocator}
-conforms to the \tcode{Allocator} requirements\iref{allocator.requirements}.
+satisfies the \tcode{Allocator} requirements (\tref{utilities.allocator.requirements}).
 Constructed with different memory resources,
 different instances of the same specialization of \tcode{pmr::polymorphic_allocator}
 can exhibit entirely different allocation behavior.
@@ -14935,7 +14938,8 @@
 of templates specified in this subclause
 \ref{func.search} shall satisfy the same requirements and semantics as
 specified in \ref{algorithms.general}.
-Template parameters named \tcode{Hash} shall satisfy the requirements as specified in \ref{hash.requirements}.
+Template parameters named \tcode{Hash} shall satisfy the \tcode{Hash}
+requirements (\tref{hash}).
 
 \pnum
 The Boyer-Moore searcher implements the Boyer-Moore search algorithm.
@@ -15233,7 +15237,7 @@
 \pnum
 An enabled specialization \tcode{hash<Key>} will:
 \begin{itemize}
-\item satisfy the \tcode{Hash} requirements\iref{hash.requirements},
+\item satisfy the \tcode{Hash} requirements (\tref{hash}),
 with \tcode{Key} as the function
 call argument type, the \tcode{Default\-Constructible} requirements (\tref{defaultconstructible}),
 the \tcode{CopyAssignable} requirements (\tref{copyassignable}),