Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[std] Show stable labels for tables. #2896

Merged
merged 24 commits into from
Jun 13, 2019
Merged

[std] Show stable labels for tables. #2896

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
24 commits
Select commit Hold shift + click to select a range
b2e0398
[std] Implicitly prefix table labels with 'tab:'
jensmaurer May 10, 2019
8e8b3d7
Fixed initial set of table lables.
jensmaurer May 10, 2019
0cc4db9
[numerics] Fix table labels.
jensmaurer May 21, 2019
5f1f2c2
[utilities] Fix table labels.
jensmaurer May 21, 2019
69a9f23
[thread] Fix table labels.
jensmaurer May 24, 2019
a5955d0
[re] Fix table labels.
jensmaurer May 24, 2019
bceda0d
[atomics] Fix table labels.
jensmaurer May 24, 2019
a5a7074
[concepts] Fix table labels.
jensmaurer May 24, 2019
5b131de
[numerics] Fix table labels.
jensmaurer May 24, 2019
eed6417
[containers] Fix table labels.
jensmaurer May 24, 2019
0997bb2
[strings] Fix table labels.
jensmaurer May 24, 2019
b99653b
[iterators] Fix table labels.
jensmaurer May 24, 2019
6841d3e
[time] Fix table labels.
jensmaurer May 24, 2019
2b5a57f
[utilities] Fix table labels.
jensmaurer May 24, 2019
602c6fb
[localizatiom] Fix table labels.
jensmaurer May 24, 2019
a061ad9
[diagnostics] Fix table labels.
jensmaurer May 24, 2019
e2c43fa
[support] Fix table labels.
jensmaurer May 24, 2019
1eb5098
[depr] Fix table lables.
jensmaurer May 24, 2019
84cd499
[iostreams] Fix table labels.
jensmaurer May 24, 2019
9438811
[library] Fix table labels.
jensmaurer May 24, 2019
98db3e2
[tables] caption changes: add label
jensmaurer May 11, 2019
76b350a
[lib] Prefix table labels for old concepts with cpp17.
jensmaurer Jun 8, 2019
d063024
[std] Harmonize figure captions with table captions.
jensmaurer Jun 8, 2019
6a1f091
[styles] Remove special caption styles
jensmaurer Jun 11, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
98 changes: 49 additions & 49 deletions source/algorithms.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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>} \\
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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},
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -5851,8 +5851,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
Expand Down Expand Up @@ -5909,8 +5909,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
Expand Down Expand Up @@ -5979,8 +5979,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
Expand Down Expand Up @@ -6081,8 +6081,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}.

Expand Down Expand Up @@ -6283,8 +6283,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
Expand Down Expand Up @@ -6681,8 +6681,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
Expand Down Expand Up @@ -6964,8 +6964,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
Expand Down Expand Up @@ -7530,8 +7530,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
Expand Down Expand Up @@ -7583,8 +7583,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
Expand Down Expand Up @@ -7637,8 +7637,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
Expand Down Expand Up @@ -7690,8 +7690,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
Expand Down Expand Up @@ -7850,7 +7850,7 @@
\pnum
\requires
For the first form, type \tcode{T} shall be
\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).

\pnum
\returns
Expand Down Expand Up @@ -7927,7 +7927,7 @@
\pnum
\requires
For the first form, type \tcode{T} shall be
\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).

\pnum
\returns
Expand Down Expand Up @@ -8006,7 +8006,7 @@
\pnum
\requires
For the first form, type \tcode{T} shall be
\oldconcept{LessThanComparable} (\tref{lessthancomparable}).
\oldconcept{LessThanComparable} (\tref{cpp17.lessthancomparable}).

\pnum
\returns
Expand Down Expand Up @@ -8227,7 +8227,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
Expand Down Expand Up @@ -8805,8 +8805,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.%
Expand Down Expand Up @@ -8908,7 +8908,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)}
Expand Down Expand Up @@ -8956,8 +8956,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}
Expand Down Expand Up @@ -9039,7 +9039,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}
Expand Down Expand Up @@ -9087,7 +9087,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}
Expand Down Expand Up @@ -9225,7 +9225,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)},
Expand Down Expand Up @@ -9328,7 +9328,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
Expand Down Expand Up @@ -9403,7 +9403,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}
Expand Down Expand Up @@ -9491,7 +9491,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
Expand Down Expand Up @@ -9584,7 +9584,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}
Expand Down
16 changes: 8 additions & 8 deletions source/atomics.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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 & \\
Expand Down Expand Up @@ -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}>}%
Expand Down Expand Up @@ -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}>}%
Expand Down Expand Up @@ -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*>}%
Expand Down Expand Up @@ -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} &
Expand Down Expand Up @@ -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}}%
Expand Down Expand Up @@ -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 &
Expand Down
Loading