Use \tref for table references

Author: jensmaurer

source/algorithms.tex

@@ -13,7 +13,7 @@
 mutating sequence operations,
 sorting and related operations,
 and algorithms from the ISO C library,
-as summarized in Table~\ref{tab:algorithms.summary}.
+as summarized in \tref{algorithms.summary}.
 
 \begin{libsumtab}{Algorithms library summary}{tab:algorithms.summary}
 \ref{alg.nonmodifying} & Non-modifying sequence operations  &           \\
@@ -1628,9 +1628,9 @@
 \begin{itemdescr}
 \pnum
 \requires \tcode{Function} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}).
+\tcode{MoveConstructible} (\tref{moveconstructible}).
 \begin{note} \tcode{Function} need not meet the requirements of
-\tcode{CopyConstructible} (Table~\ref{tab:copyconstructible}). \end{note}
+\tcode{CopyConstructible} (\tref{copyconstructible}). \end{note}
 
 \pnum
 \effects
@@ -2476,7 +2476,7 @@
 \begin{note}
 For the overload with an \tcode{ExecutionPolicy}, there may be a performance
 cost if \tcode{iterator_traits<ForwardIterator1>::value_type} is not
-\tcode{Move\-Constructible} (Table~\ref{tab:moveconstructible}).
+\tcode{Move\-Constructible} (\tref{moveconstructible}).
 \end{note}
 
 \pnum
@@ -3019,7 +3019,7 @@
 The type of
 \tcode{*first}
 shall satisfy the \tcode{MoveAssignable}
-requirements (Table~\ref{tab:moveassignable}).
+requirements (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3088,7 +3088,7 @@
 \begin{note}
 For the overloads with an \tcode{ExecutionPolicy}, there may be a performance
 cost if \tcode{iterator_traits<ForwardIterator1>::value_type} is not
-\tcode{Move\-Constructible} (Table~\ref{tab:moveconstructible}).
+\tcode{Move\-Constructible} (\tref{moveconstructible}).
 \end{note}
 
 \pnum
@@ -3138,7 +3138,7 @@
 \requires
 The comparison function shall be an equivalence relation.
 The type of \tcode{*first} shall satisfy the
-\tcode{MoveAssignable} requirements (Table~\ref{tab:moveassignable}).
+\tcode{MoveAssignable} requirements (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3215,9 +3215,9 @@
 then there are no additional requirements for \tcode{T}.
 Otherwise, if \tcode{OutputIterator} meets the forward iterator
 requirements and its value type is the same as \tcode{T},
-then \tcode{T} shall be \tcode{CopyAssignable} (Table~\ref{tab:copyassignable}).
+then \tcode{T} shall be \tcode{CopyAssignable} (\tref{copyassignable}).
 Otherwise, \tcode{T} shall be both
-\tcode{CopyConstructible} (Table~\ref{tab:copyconstructible}) and \tcode{CopyAssignable}.
+\tcode{CopyConstructible} (\tref{copyconstructible}) and \tcode{CopyAssignable}.
 \begin{note}
 For the overloads with an \tcode{ExecutionPolicy}, there may be a performance
 cost if the value type of \tcode{ForwardIterator1} is not both
@@ -3349,10 +3349,10 @@
 \tcode{ForwardIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type of \tcode{*first} shall satisfy
 the requirements of \tcode{MoveConstructible}
-(Table~\ref{tab:moveconstructible}) and the
+(\tref{moveconstructible}) and the
 requirements of
 \tcode{MoveAssignable}
-(Table~\ref{tab:moveassignable}).
+(\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3679,8 +3679,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3717,8 +3717,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3768,8 +3768,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3830,8 +3830,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*result_first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{Move\-Assignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{Move\-Assignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -3969,8 +3969,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -4318,8 +4318,8 @@
 \tcode{BidirectionalIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -4378,7 +4378,7 @@
 \begin{itemize}
 \item
 For the overload with no \tcode{ExecutionPolicy}, \tcode{InputIterator}'s
-value type shall be \tcode{CopyAssignable} (Table~\ref{tab:copyassignable}),
+value type shall be \tcode{CopyAssignable} (\tref{copyassignable}),
 and shall be writable\iref{iterator.requirements.general} to the \tcode{out_true}
 and \tcode{out_false} \tcode{OutputIterator}s, and shall be convertible to
 \tcode{Predicate}'s argument type.
@@ -4519,8 +4519,8 @@
 \tcode{BidirectionalIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -4932,9 +4932,9 @@
 shall be a valid heap.
 The type of \tcode{*first} shall satisfy
 the \tcode{MoveConstructible} requirements
-(Table~\ref{tab:moveconstructible}) and the
+(\tref{moveconstructible}) and the
 \tcode{MoveAssignable} requirements
-(Table~\ref{tab:moveassignable}).
+(\tref{moveassignable}).
 
 \pnum
 \effects
@@ -4971,8 +4971,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 
 \pnum
@@ -5007,9 +5007,9 @@
 \pnum
 \requires The type of \tcode{*first} shall satisfy
 the \tcode{MoveConstructible} requirements
-(Table~\ref{tab:moveconstructible}) and the
+(\tref{moveconstructible}) and the
 \tcode{MoveAssignable} requirements
-(Table~\ref{tab:moveassignable}).
+(\tref{moveassignable}).
 
 \pnum
 \effects
@@ -5041,8 +5041,8 @@
 \tcode{RandomAccessIterator} shall satisfy the requirements of
 \tcode{ValueSwappable}\iref{swappable.requirements}. The type
 of \tcode{*first} shall satisfy the requirements of
-\tcode{MoveConstructible} (Table~\ref{tab:moveconstructible}) and of
-\tcode{MoveAssignable} (Table~\ref{tab:moveassignable}).
+\tcode{MoveConstructible} (\tref{moveconstructible}) and of
+\tcode{MoveAssignable} (\tref{moveassignable}).
 
 \pnum
 \effects
@@ -5160,7 +5160,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\tcode{LessThanComparable} (Table~\ref{tab:lessthancomparable}).
+\tcode{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -5210,7 +5210,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\tcode{LessThanComparable} (Table~\ref{tab:lessthancomparable}).
+\tcode{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -5261,7 +5261,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\tcode{LessThanComparable} (Table~\ref{tab:lessthancomparable}).
+\tcode{LessThanComparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns
@@ -5445,7 +5445,7 @@
 \requires
 The value of \tcode{lo} shall be no greater than \tcode{hi}.
 For the first form, type \tcode{T}
-shall be \tcode{LessThan\-Comparable} (Table~\ref{tab:lessthancomparable}).
+shall be \tcode{LessThan\-Comparable} (\tref{lessthancomparable}).
 
 \pnum
 \returns

source/atomics.tex

@@ -1215,7 +1215,7 @@
 \pnum
 The following operations perform arithmetic addition and subtraction computations.
 The key, operator, and computation correspondence are identified in
-Table~\ref{tab:atomic.arithmetic.computations}.
+\tref{atomic.arithmetic.computations}.
 
 \indexlibrary{\idxcode{atomic_fetch_add}}%
 \indexlibrary{\idxcode{atomic_fetch_sub}}%

source/basic.tex

@@ -4236,7 +4236,7 @@
 \pnum
 There is a partial ordering on cv-qualifiers, so that a type can be
 said to be \defn{more cv-qualified} than another.
-Table~\ref{tab:relations.on.const.and.volatile} shows the relations that
+\tref{relations.on.const.and.volatile} shows the relations that
 constitute this ordering.
 
 \begin{floattable}{Relations on \tcode{const} and \tcode{volatile}}{tab:relations.on.const.and.volatile}

source/compatibility.tex

@@ -901,7 +901,7 @@
 \change New keywords.
 \rationale Required for new features.
 \effect
-Added to Table~\ref{tab:keywords}, the following identifiers are new keywords:
+Added to \tref{keywords}, the following identifiers are new keywords:
 \tcode{alignas},
 \tcode{alignof},
 \tcode{char16_t},