[std] Show stable labels for tables.

Author: jensmaurer

source/algorithms.tex

@@ -15,7 +15,7 @@
 and algorithms from the ISO C library,
 as summarized in \tref{algorithms.summary}.
 
-\begin{libsumtab}{Algorithms library summary}{tab:algorithms.summary}
+\begin{libsumtab}{Algorithms library summary}{algorithms.summary}
 \ref{algorithms.requirements}  & Algorithms requirements           & \\
 \ref{algorithms.parallel}      & Parallel algorithms               & \\ \rowsep
 \ref{alg.nonmodifying}         & Non-modifying sequence operations & \tcode{<algorithm>} \\
@@ -3001,10 +3001,10 @@
 \pnum
 \requires
 \tcode{Function} shall satisfy
-the \oldconcept{MoveConstructible} requirements (\tref{moveconstructible}).
+the \oldconcept{MoveConstructible} requirements (\tref{cpp17.moveconstructible}).
 \begin{note}
 \tcode{Function} need not meet the requirements of
-\oldconcept{CopyConstructible} (\tref{copyconstructible}).
+\oldconcept{CopyConstructible} (\tref{cpp17.copyconstructible}).
 \end{note}
 
 \pnum
@@ -4206,7 +4206,7 @@
 For the overload with an \tcode{ExecutionPolicy},
 there may be a performance cost
 if \tcode{iterator_traits<ForwardIterator1>::value_type}
-is not \oldconcept{\-Move\-Constructible} (\tref{moveconstructible}).
+is not \oldconcept{\-Move\-Constructible} (\tref{cpp17.moveconstructible}).
 \end{note}
 
 \pnum
@@ -4989,7 +4989,7 @@
 \requires
 For the algorithms in namespace \tcode{std},
 the type of \tcode{*first}
-shall meet the \oldconcept{MoveAssignable} requirements (\tref{moveassignable}).
+shall meet the \oldconcept{MoveAssignable} requirements (\tref{cpp17.moveassignable}).
 
 \pnum
 \effects
@@ -5089,7 +5089,7 @@
 For the overloads with an \tcode{ExecutionPolicy},
 there may be a performance cost
 if \tcode{iterator_traits<ForwardIterator1>::value_type} does not meet
-the \oldconcept{\-Move\-Constructible} (\tref{moveconstructible}) requirements.
+the \oldconcept{\-Move\-Constructible} (\tref{cpp17.moveconstructible}) requirements.
 \end{note}
 
 \pnum
@@ -5162,7 +5162,7 @@
 For the overloads in namepace \tcode{std},
 \tcode{pred} shall be an equivalence relation and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveAssignable} requirements (\tref{moveassignable}).
+the \oldconcept{MoveAssignable} requirements (\tref{cpp17.moveassignable}).
 
 \pnum
 \effects
@@ -5262,9 +5262,9 @@
     the \oldconcept{ForwardIterator} requirements and
     its value type is the same as \tcode{T},
     then \tcode{T} shall meet
-    the \oldconcept{CopyAssignable} (\tref{copyassignable}) requirements.
+    the \oldconcept{CopyAssignable} (\tref{cpp17.copyassignable}) requirements.
     Otherwise, \tcode{T} shall meet both
-    the \oldconcept{CopyConstructible} (\tref{copyconstructible}) and
+    the \oldconcept{CopyConstructible} (\tref{cpp17.copyconstructible}) and
     \oldconcept{CopyAssignable} requirements.
     \begin{note}
     For the overloads with an \tcode{ExecutionPolicy},
@@ -5412,8 +5412,8 @@
 \tcode{ForwardIterator} shall meet
 the \oldconcept{ValueSwappable} requirements\iref{swappable.requirements}, and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -5850,8 +5850,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{Value\-Swappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -5908,8 +5908,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{Value\-Swappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -5978,8 +5978,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{ValueSwappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -6080,8 +6080,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{Value\-Swappable} requirements\iref{swappable.requirements},
 the type of \tcode{*result_first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{\-Move\-Assignable} (\tref{moveassignable}) requirements,
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{\-Move\-Assignable} (\tref{cpp17.moveassignable}) requirements,
 and the expression \tcode{*first}
 shall be writable\iref{iterator.requirements.general} to \tcode{result_first}.
 
@@ -6282,8 +6282,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{ValueSwappable} requirements\iref{swappable.requirements}, and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -6680,8 +6680,8 @@
 \tcode{BidirectionalIterator} shall meet
 the \oldconcept{Value\-Swappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -6963,8 +6963,8 @@
 \tcode{BidirectionalIterator} shall meet
 the \oldconcept{Value\-Swappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -7529,8 +7529,8 @@
 shall be a valid heap with respect to \tcode{comp} and \tcode{proj}.
 For the overloads in namespace \tcode{std},
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} requirements (\tref{moveconstructible}) and
-the \oldconcept{MoveAssignable} requirements (\tref{moveassignable}).
+the \oldconcept{MoveConstructible} requirements (\tref{cpp17.moveconstructible}) and
+the \oldconcept{MoveAssignable} requirements (\tref{cpp17.moveassignable}).
 
 \pnum
 \effects
@@ -7582,8 +7582,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{ValueSwappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConstructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -7636,8 +7636,8 @@
 \requires
 For the overloads in namespace \tcode{std},
 the type of \tcode{*first} shall meet
-the \oldconcept{Move\-Constructible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{Move\-Constructible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -7689,8 +7689,8 @@
 \tcode{RandomAccessIterator} shall meet
 the \oldconcept{ValueSwappable} requirements\iref{swappable.requirements} and
 the type of \tcode{*first} shall meet
-the \oldconcept{MoveConst\-ruct\-ible} (\tref{moveconstructible}) and
-\oldconcept{MoveAssignable} (\tref{moveassignable}) requirements.
+the \oldconcept{MoveConst\-ruct\-ible} (\tref{cpp17.moveconstructible}) and
+\oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) requirements.
 
 \pnum
 \effects
@@ -7849,7 +7849,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
+\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).
 
 \pnum
 \returns
@@ -7926,7 +7926,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
+\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).
 
 \pnum
 \returns
@@ -8005,7 +8005,7 @@
 \pnum
 \requires
 For the first form, type \tcode{T} shall be
-\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
+\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).
 
 \pnum
 \returns
@@ -8226,7 +8226,7 @@
 \requires
 The value of \tcode{lo} shall be no greater than \tcode{hi}.
 For the first form, type \tcode{T}
-shall be \oldconcept{LessThan\-Comparable} (\tref{lessthancomparable}).
+shall be \oldconcept{LessThan\-Comparable} (\tref{cpp17.lessthancomparable}).
 
 \pnum
 \returns
@@ -8804,8 +8804,8 @@
 \pnum
 \requires
 \tcode{T} shall satisfy
-the \oldconcept{CopyConstructible} (\tref{copyconstructible})
-and \oldconcept{CopyAssignable} (\tref{copyassignable}) requirements.
+the \oldconcept{CopyConstructible} (\tref{cpp17.copyconstructible})
+and \oldconcept{CopyAssignable} (\tref{cpp17.copyassignable}) requirements.
 In the range \crange{first}{last},
 \tcode{binary_op} shall neither modify elements
 nor invalidate iterators or subranges.%
@@ -8907,7 +8907,7 @@
 \requires
 \begin{itemize}
 \item
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible}).
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}).
 \item
   All of \tcode{binary_op(init, *first)}, \tcode{binary_op(*first, init)},
   \tcode{binary_op(init, init)}, and \tcode{binary_op(*first, *first)}
@@ -8955,8 +8955,8 @@
 \pnum
 \requires
 \tcode{T} shall satisfy
-the \oldconcept{CopyConstructible} (\tref{copyconstructible})
-and \oldconcept{CopyAssignable} (\tref{copyassignable}) requirements.
+the \oldconcept{CopyConstructible} (\tref{cpp17.copyconstructible})
+and \oldconcept{CopyAssignable} (\tref{cpp17.copyassignable}) requirements.
 In the ranges \crange{first1}{last1} and
 \crange{first2}{first2 + (last1 - first1)}
 \tcode{binary_op1} and \tcode{binary_op2}
@@ -9038,7 +9038,7 @@
 \requires
 \begin{itemize}
 \item
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible}).
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}).
 \item
   All of
   \begin{itemize}
@@ -9086,7 +9086,7 @@
 \requires
 \begin{itemize}
 \item
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible}).
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}).
 \item
   All of
   \begin{itemize}
@@ -9224,7 +9224,7 @@
 \requires
 \begin{itemize}
 \item
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible}).
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}).
 \item
   All of
   \tcode{binary_op(init, init)},
@@ -9327,7 +9327,7 @@
 \begin{itemize}
 \item
   If \tcode{init} is provided,
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible});
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible});
   otherwise, \tcode{ForwardIterator1}'s value type
   shall be \oldconcept{MoveConstructible}.
 \item
@@ -9402,7 +9402,7 @@
 \requires
 \begin{itemize}
 \item
-  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{moveconstructible}).
+  \tcode{T} shall be \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible}).
 \item
   All of
   \begin{itemize}
@@ -9490,7 +9490,7 @@
 \begin{itemize}
 \item
   If \tcode{init} is provided, \tcode{T} shall be
-  \oldconcept{MoveConstructible} (\tref{moveconstructible});
+  \oldconcept{MoveConstructible} (\tref{cpp17.moveconstructible});
   otherwise, \tcode{ForwardIterator1}'s value type shall be
   \oldconcept{MoveConstructible}.
 \item
@@ -9583,7 +9583,7 @@
 \begin{itemize}
 \item
   For the overloads with no \tcode{ExecutionPolicy},
-  \tcode{T} shall be \oldconcept{MoveAssignable} (\tref{moveassignable}) and
+  \tcode{T} shall be \oldconcept{MoveAssignable} (\tref{cpp17.moveassignable}) and
   shall be constructible from the type of \tcode{*first}.
   \tcode{acc} (defined below) shall be
   writable\iref{iterator.requirements.general}

source/atomics.tex

@@ -9,9 +9,9 @@
 
 \pnum
 The following subclauses describe atomics requirements and components for types
-and operations, as summarized in \tref{atomics.lib.summary}.
+and operations, as summarized in \tref{atomics.summary}.
 
-\begin{libsumtab}{Atomics library summary}{tab:atomics.lib.summary}
+\begin{libsumtab}{Atomics library summary}{atomics.summary}
 \ref{atomics.alias} & Type aliases  & \tcode{<atomic>} \\
 \ref{atomics.order} & Order and consistency   &  \\
 \ref{atomics.lockfree}  & Lock-free property   &  \\
@@ -1000,7 +1000,7 @@
 \pnum
 The following operations perform arithmetic computations.
 The key, operator, and computation correspondence is identified
-in \tref{atomic.arithmetic.computations}.
+in \tref{atomic.types.int.comp}.
 
 \indexlibrarymember{fetch_add}{atomic_ref<\placeholder{integral}>}%
 \indexlibrarymember{fetch_and}{atomic_ref<\placeholder{integral}>}%
@@ -1114,7 +1114,7 @@
 \pnum
 The following operations perform arithmetic computations.
 The key, operator, and computation correspondence are identified
-in \tref{atomic.arithmetic.computations}.
+in \tref{atomic.types.int.comp}.
 
 \indexlibrarymember{fetch_add}{atomic_ref<\placeholder{floating-point}>}%
 \indexlibrarymember{fetch_sub}{atomic_ref<\placeholder{floating-point}>}%
@@ -1213,7 +1213,7 @@
 \pnum
 The following operations perform arithmetic computations.
 The key, operator, and computation correspondence is identified
-in \tref{atomic.pointer.computations}.
+in \tref{atomic.types.pointer.comp}.
 
 \indexlibrarymember{fetch_add}{atomic_ref<T*>}%
 \indexlibrarymember{fetch_sub}{atomic_ref<T*>}%
@@ -1849,7 +1849,7 @@
 The following operations perform arithmetic computations. The key, operator, and computation correspondence is:
 
 \begin{floattable}
-{Atomic arithmetic computations}{tab:atomic.arithmetic.computations}{lll|lll}
+{Atomic arithmetic computations}{atomic.types.int.comp}{lll|lll}
 \hline
 \hdstyle{\tcode{\placeholder{key}}}   &
   \hdstyle{Op}                        &
@@ -2020,7 +2020,7 @@
 \pnum
 The following operations perform arithmetic addition and subtraction computations.
 The key, operator, and computation correspondence are identified in
-\tref{atomic.arithmetic.computations}.
+\tref{atomic.types.int.comp}.
 
 \indexlibrary{\idxcode{atomic_fetch_add}}%
 \indexlibrary{\idxcode{atomic_fetch_sub}}%
@@ -2158,7 +2158,7 @@
 and computation correspondence is:
 
 \begin{floattable}
-{Atomic pointer computations}{tab:atomic.pointer.computations}{lll|lll}
+{Atomic pointer computations}{atomic.types.pointer.comp}{lll|lll}
 \hline
 \tcode{Key}       &
   Op          &