|
Boost-Commit : |
From: dgregor_at_[hidden]
Date: 2008-05-18 22:31:37
Author: dgregor
Date: 2008-05-18 22:31:36 EDT (Sun, 18 May 2008)
New Revision: 45518
URL: http://svn.boost.org/trac/boost/changeset/45518
Log:
Minor cleanups to the standard library wording
Text files modified:
sandbox/committee/concepts/stdlib/clib-concepts.tex | 5 ++---
sandbox/committee/concepts/stdlib/clib-containers.tex | 32 ++++++++++++++++----------------
2 files changed, 18 insertions(+), 19 deletions(-)
Modified: sandbox/committee/concepts/stdlib/clib-concepts.tex
==============================================================================
--- sandbox/committee/concepts/stdlib/clib-concepts.tex (original)
+++ sandbox/committee/concepts/stdlib/clib-concepts.tex 2008-05-18 22:31:36 EDT (Sun, 18 May 2008)
@@ -906,7 +906,7 @@
\begin{itemdescr}
\pnum
\addedConcepts{\mbox{\reallynote} describes types with a conversion (explicit
-or implicit) from one type to another.}
+or implicit) from} \changedCC{one type to another}{\mbox{\tcode{T} to \tcode{U}}}\addedConcepts{.}
\end{itemdescr}
\begin{itemdecl}
@@ -917,8 +917,7 @@
\begin{itemdescr}
\pnum
-\addedConcepts{\mbox{\reallynote} describes types with an implicit conversion from one
-type to another.}
+\addedConcepts{\mbox{\reallynote} describes types with an implicit conversion from} \changedCC{one type to another}{\mbox{\tcode{T} to \tcode{U}}}\addedConcepts{.}
\end{itemdescr}
\rSec2[concept.true]{True}
Modified: sandbox/committee/concepts/stdlib/clib-containers.tex
==============================================================================
--- sandbox/committee/concepts/stdlib/clib-containers.tex (original)
+++ sandbox/committee/concepts/stdlib/clib-containers.tex 2008-05-18 22:31:36 EDT (Sun, 18 May 2008)
@@ -87,24 +87,24 @@
sequences and
associative containers,
as summarized in
-Table~\ref{tab:containers.lib.summary}:
+Table~\ref{tab:containers.summary}:
-\begin{libsumtab}{Containers library summary}{tab:containers.lib.summary}
-\ref{lib.container.requirements} Requirements & \addedConcepts{\ttfamily <container>} \\ \rowsep
-\ref{lib.sequences} Sequences & \tcode{<array>} \\
+\begin{libsumtab}{Containers library summary}{tab:containers.summary}
+\ref{container.requirements} Requirements & \addedConcepts{\ttfamily <container>} \\ \rowsep
+\ref{sequences} Sequences & \tcode{<array>} \\
& \tcode{<deque>} \\
& \tcode{<list>} \\
& \tcode{<queue>} \\
& \tcode{<stack>} \\
& \tcode{<vector>} \\ \rowsep
-\ref{lib.associative} Associative containers & \tcode{<map>} \\
+\ref{associative} Associative containers & \tcode{<map>} \\
& \tcode{<set>} \\
-\ref{lib.template.bitset} \tcode{bitset} & \tcode{<bitset>} \\ \rowsep
-\ref{lib.unord} \addedB{Unordered associative containers}& \tcode{<unordered_map>} \\
+\ref{template.bitset} \tcode{bitset} & \tcode{<bitset>} \\ \rowsep
+\ref{unord} \addedB{Unordered associative containers}& \tcode{<unordered_map>} \\
& \tcode{<unordered_set>} \\
\end{libsumtab}
-\rSec1[lib.container.requirements]{Container requirements}
+\rSec1[container.requirements]{Container requirements}
\index{requirements!container}%
\pnum
@@ -489,7 +489,7 @@
copy an allocator argument from their respective first parameters.
All other constructors for these container types take an
\tcode{Allocator\&}\
-argument (\ref{lib.allocator.requirements}),
+argument (\ref{allocator.requirements}),
an allocator whose value type is the same as the container's value type.
A copy of this argument is used for any memory allocation
performed, by these constructors and by all member functions, during
@@ -497,7 +497,7 @@
In all container types defined
in this clause, the member \tcode{get_allocator()}\ returns a copy
of the Allocator object used to construct the container.%
-\footnote{As specified in~\ref{lib.allocator.requirements}, \removedConcepts{paragraphs 4-5},
+\footnote{As specified in~\ref{allocator.requirements}, \removedConcepts{paragraphs 4-5},
the semantics described in this clause applies only to the case where
allocators compare equal.
}
@@ -532,7 +532,7 @@
\pnum
If the iterator type of a container \changedConcepts{belongs to the bidirectional or
-random access iterator categories}{is bidirectional or random access} (\ref{lib.iterator.requirements}),
+random access iterator categories}{is bidirectional or random access} (\ref{iterator.requirements}),
\changedConcepts{the container is called
reversible
and satisfies the additional requirements
@@ -620,8 +620,8 @@
\color{black}
\pnum
-Unless otherwise specified (see~\ref{lib.deque.modifiers}\ and
-\ref{lib.vector.modifiers})
+Unless otherwise specified (see~\ref{deque.modifiers}\ and
+\ref{vector.modifiers})
all container types defined in this clause meet
the following additional requirements:
@@ -653,7 +653,7 @@
function throws an exception unless that
exception is thrown by the copy constructor or
assignment operator of the container's
-Compare object (if any; see \ref{lib.associative.reqmts}).
+Compare object (if any; see \ref{associative.reqmts}).
\item
no
\tcode{swap()}
@@ -669,7 +669,7 @@
shall not invalidate iterators to, or change the values of, objects
within that container.
-\rSec2[lib.sequence.reqmts]{\textcolor{black}{Sequences}}
+\rSec2[sequence.reqmts]{\textcolor{black}{Sequences}}
\pnum
A sequence is a kind of container that organizes a finite set of objects, all of the same type,
@@ -1120,7 +1120,7 @@
\end{itemdecl}
\color{black}
-\rSec1[lib.sequences]{Sequences}
+\rSec1[sequences]{Sequences}
\pnum
Headers \tcode{<array>}, \tcode{<deque>}, \tcode{<forward_list>}, \tcode{<list>}, \tcode{<queue>}, \tcode{<stack>}, and \tcode{<vector>}.
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk