|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r82888 - in trunk/libs/bimap/doc: . html html/boost_bimap html/boost_bimap/the_tutorial
From: steven_at_[hidden]
Date: 2013-02-14 14:06:36
Author: steven_watanabe
Date: 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
New Revision: 82888
URL: http://svn.boost.org/trac/boost/changeset/82888
Log:
Apply patch for documentation typos. Fixes #5955.
Text files modified:
trunk/libs/bimap/doc/bimap_and_boost.qbk | 2 +-
trunk/libs/bimap/doc/compiler_specifics.qbk | 2 +-
trunk/libs/bimap/doc/history.qbk | 4 ++--
trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html | 2 +-
trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html | 6 +++---
trunk/libs/bimap/doc/html/boost_bimap/history.html | 4 ++--
trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html | 4 ++--
trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html | 2 +-
trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html | 2 +-
trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html | 8 ++++----
trunk/libs/bimap/doc/html/index.html | 2 +-
trunk/libs/bimap/doc/quick_tutorial.qbk | 4 ++--
trunk/libs/bimap/doc/tutorial.qbk | 12 ++++++------
13 files changed, 27 insertions(+), 27 deletions(-)
Modified: trunk/libs/bimap/doc/bimap_and_boost.qbk
==============================================================================
--- trunk/libs/bimap/doc/bimap_and_boost.qbk (original)
+++ trunk/libs/bimap/doc/bimap_and_boost.qbk 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -36,7 +36,7 @@
types can be used as key. There is a library in Boost that already
allows the creation of this kind of container: Boost.MultiIndex. It
offers great flexibility and lets you construct almost any container
-that you could dream of. The framework is very clean. You migh want to
+that you could dream of. The framework is very clean. You might want to
read this library's tutorial to learn about the power that has been
achieved.
Modified: trunk/libs/bimap/doc/compiler_specifics.qbk
==============================================================================
--- trunk/libs/bimap/doc/compiler_specifics.qbk (original)
+++ trunk/libs/bimap/doc/compiler_specifics.qbk 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -41,7 +41,7 @@
[h2 VS 7.1]
-If a .cpp file uses more than four differents bimaps the compiler will run
+If a .cpp file uses more than four different bimaps the compiler will run
out of symbols and issue an internal compiler error. The official solution
in msdn is to split the .cpp in several files or upgrade your compiler.
Modified: trunk/libs/bimap/doc/history.qbk
==============================================================================
--- trunk/libs/bimap/doc/history.qbk (original)
+++ trunk/libs/bimap/doc/history.qbk 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -51,7 +51,7 @@
[
Once in Boost, the library switched to the now familiar name
"Boost.MultiIndex". Late in 2004, it formally became a member of Boost.
-Joaquin continued to enchance the library and added new features such as
+Joaquin continued to enhance the library and added new features such as
composite keys and random-access indices.
]]
@@ -71,7 +71,7 @@
[[2007 - Boost.Bimap]
[
-The formal review took place at the beggining of the year and Boost.Bimap
+The formal review took place at the beginning of the year and Boost.Bimap
was accepted in Boost.
]]
]
Modified: trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -74,7 +74,7 @@
can be used as key. There is a library in Boost that already allows the creation
of this kind of container: Boost.MultiIndex. It offers great flexibility
and lets you construct almost any container that you could dream of. The
- framework is very clean. You migh want to read this library's tutorial to
+ framework is very clean. You might want to read this library's tutorial to
learn about the power that has been achieved.
</p>
<p>
Modified: trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -330,9 +330,9 @@
7.1</a>
</h3>
<p>
- If a .cpp file uses more than four differents bimaps the compiler will run
- out of symbols and issue an internal compiler error. The official solution
- in msdn is to split the .cpp in several files or upgrade your compiler.
+ If a .cpp file uses more than four different bimaps the compiler will run out
+ of symbols and issue an internal compiler error. The official solution in msdn
+ is to split the .cpp in several files or upgrade your compiler.
</p>
<h3>
<a name="boost_bimap.compiler_specifics.h1"></a>
Modified: trunk/libs/bimap/doc/html/boost_bimap/history.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/history.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/history.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -70,7 +70,7 @@
<dd><p>
Once in Boost, the library switched to the now familiar name "Boost.MultiIndex".
Late in 2004, it formally became a member of Boost. Joaquin continued
- to enchance the library and added new features such as composite keys
+ to enhance the library and added new features such as composite keys
and random-access indices.
</p></dd>
<dt><span class="term">2006 - Multi Index Specialized Containers SoC project</span></dt>
@@ -88,7 +88,7 @@
</p></dd>
<dt><span class="term">2007 - Boost.Bimap</span></dt>
<dd><p>
- The formal review took place at the beggining of the year and Boost.Bimap
+ The formal review took place at the beginning of the year and Boost.Bimap
was accepted in Boost.
</p></dd>
</dl>
Modified: trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -124,7 +124,7 @@
by step</a>
</h4>
<p>
- A convinience header is avaiable in the boost directory:
+ A convenience header is available in the boost directory:
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
@@ -275,7 +275,7 @@
<p>
If you insert <code class="computeroutput"><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"one"</span><span class="special">)</span></code> and <code class="computeroutput"><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"1"</span><span class="special">)</span></code> in a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span></code> the second insertion will have no effect.
In a <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span><span class="identifier">Y</span><span class="special">></span></code> both keys have to remain unique. The insertion
- may fail in other situtions too. Lets see an example
+ may fail in other situations too. Lets see an example
</p>
<pre class="programlisting"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">clear</span><span class="special">();</span>
Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -85,7 +85,7 @@
</p>
<p>
In Boost.Bimap there is a better way to document the code and in the meantime
- helping you to write more mantainable and readable code. You can tag the
+ helping you to write more maintainable and readable code. You can tag the
two collections of the bimap so they can be accessed by more descriptive
names.
</p>
Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -47,7 +47,7 @@
to specify user defined names instead of the usual <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::-</span><span class="identifier">Side</span><span class="special">-</span></code> tags.
</p>
<p>
- The possibles way to use the first parameter are:
+ The possible way to use the first parameter are:
</p>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">></span>
</pre>
Modified: trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html
==============================================================================
--- trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html (original)
+++ trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -358,18 +358,18 @@
Populations</a>
</h6>
<p>
- We want to store countries populations. The requeriments are:
+ We want to store countries populations. The requirements are:
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Get a list of countries in decresing order of their populations.
+ Get a list of countries in decreasing order of their populations.
</li>
<li class="listitem">
- Given a countrie, get their population.
+ Given a country, get their population.
</li>
</ol></div>
<p>
- Lets create the appropiate bimap.
+ Lets create the appropriate bimap.
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span>
Modified: trunk/libs/bimap/doc/html/index.html
==============================================================================
--- trunk/libs/bimap/doc/html/index.html (original)
+++ trunk/libs/bimap/doc/html/index.html 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -149,7 +149,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 10, 2012 at 13:07:47 GMT</small></p></td>
+<td align="left"><p><small>Last revised: February 14, 2013 at 18:55:19 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: trunk/libs/bimap/doc/quick_tutorial.qbk
==============================================================================
--- trunk/libs/bimap/doc/quick_tutorial.qbk (original)
+++ trunk/libs/bimap/doc/quick_tutorial.qbk 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -80,7 +80,7 @@
[import ../example/step_by_step.cpp]
-A convinience header is avaiable in the boost directory:
+A convenience header is available in the boost directory:
#include <boost/bimap.hpp>
@@ -123,7 +123,7 @@
bm.left.find(1)->second = "1"; // Compilation error
-If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situtions too. Lets see an example
+If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situations too. Lets see an example
bm.clear();
Modified: trunk/libs/bimap/doc/tutorial.qbk
==============================================================================
--- trunk/libs/bimap/doc/tutorial.qbk (original)
+++ trunk/libs/bimap/doc/tutorial.qbk 2013-02-14 14:06:34 EST (Thu, 14 Feb 2013)
@@ -246,12 +246,12 @@
[heading Countries Populations]
We want to store countries populations.
-The requeriments are:
+The requirements are:
-# Get a list of countries in decresing order of their populations.
-# Given a countrie, get their population.
+# Get a list of countries in decreasing order of their populations.
+# Given a country, get their population.
-Lets create the appropiate bimap.
+Lets create the appropriate bimap.
typedef bimap<
@@ -768,7 +768,7 @@
[code_user_defined_names_untagged_version]
In Boost.Bimap there is a better way to document the code and
-in the meantime helping you to write more mantainable and readable code.
+in the meantime helping you to write more maintainable and readable code.
You can tag the two collections of the bimap so they can be
accessed by more descriptive names.
@@ -954,7 +954,7 @@
Additionally, the type of this two parameters can be tagged to specify
user defined names instead of the usual `member_at::-Side-` tags.
-The possibles way to use the first parameter are:
+The possible way to use the first parameter are:
bimap< Type, R >
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