Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r81889 - in trunk/libs/range/doc: . html html/range html/range/reference/adaptors/reference html/range/reference/algorithms/mutating html/range/reference/algorithms/non_mutating html/range/reference/algorithms/numeric html/range/reference/utilities reference reference/adaptors reference/algorithm reference/numeric
From: zeratul976_at_[hidden]
Date: 2012-12-13 02:09:13

Author: nathanridge
Date: 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
New Revision: 81889
URL: http://svn.boost.org/trac/boost/changeset/81889

Log:
[range] fixed some doc typos (patch by Michel Morin)
Text files modified:
   trunk/libs/range/doc/history_ack.qbk | 2 +-
   trunk/libs/range/doc/html/index.html | 2 +-
   trunk/libs/range/doc/html/range/history_ack.html | 2 +-
   trunk/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html | 2 +-
   trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html | 2 +-
   trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html | 2 +-
   trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html | 2 +-
   trunk/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html | 2 +-
   trunk/libs/range/doc/html/range/reference/utilities/iterator_range.html | 2 +-
   trunk/libs/range/doc/reference/adaptors/type_erased.qbk | 2 +-
   trunk/libs/range/doc/reference/algorithm/fill_n.qbk | 2 +-
   trunk/libs/range/doc/reference/algorithm/lexicographical_compare.qbk | 2 +-
   trunk/libs/range/doc/reference/algorithm/mismatch.qbk | 2 +-
   trunk/libs/range/doc/reference/numeric/accumulate.qbk | 2 +-
   trunk/libs/range/doc/reference/utilities.qbk | 2 +-
   15 files changed, 15 insertions(+), 15 deletions(-)

Modified: trunk/libs/range/doc/history_ack.qbk
==============================================================================
--- trunk/libs/range/doc/history_ack.qbk (original)
+++ trunk/libs/range/doc/history_ack.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -20,7 +20,7 @@
* Pavel Vozenilek for help with porting the library
* Jonathan Turkanis and John Torjo for help with documentation
* Hartmut Kaiser for being review manager
-* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+* Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.

The concept checks and their documentation was provided by Daniel Walker.

Modified: trunk/libs/range/doc/html/index.html
==============================================================================
--- trunk/libs/range/doc/html/index.html (original)
+++ trunk/libs/range/doc/html/index.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -147,7 +147,7 @@

</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: December 13, 2012 at 06:35:02 GMT</td>
+<td align="left">Last revised: December 13, 2012 at 06:53:49 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: trunk/libs/range/doc/html/range/history_ack.html
==============================================================================
--- trunk/libs/range/doc/html/range/history_ack.html (original)
+++ trunk/libs/range/doc/html/range/history_ack.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -72,7 +72,7 @@
 Hartmut Kaiser for being review manager
 </li>
<li class="listitem">
- Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+ Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
 </li>
</ul></div>

Modified: trunk/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html (original)
+++ trunk/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -105,7 +105,7 @@
<li class="listitem">
 <code class="computeroutput">Traversal</code> is
 the tag used to identify the traversal of the resultant range.
- Frequently it is desireable to set a traversal category lower
+ Frequently it is desirable to set a traversal category lower
 than the source container or range to maximize the number of
 ranges that can convert to the <code class="computeroutput">any_range</code>.
 If this is left as boost::use_default then <code class="computeroutput">Traversal</code>

Modified: trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -43,7 +43,7 @@
 </h6>

 <code class="computeroutput">fill_n</code> assigns the value
- <code class="computeroutput">val</code> to <code class="computeroutput">n</code> elements in the range <code class="computeroutput">rng</code> begining with <code class="computeroutput">boost::begin(rng)</code>.
+ <code class="computeroutput">val</code> to <code class="computeroutput">n</code> elements in the range <code class="computeroutput">rng</code> beginning with <code class="computeroutput">boost::begin(rng)</code>.
 
<h6>
<a name="range.reference.algorithms.mutating.fill_n.h2"></a>

Modified: trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -107,7 +107,7 @@
 Let <code class="computeroutput">x</code> be an object
 of <code class="computeroutput">SinglePassRange1</code>'s
 value type. Let <code class="computeroutput">y</code>
- be an obect of <code class="computeroutput">SinglePassRange2</code>'s
+ be an object of <code class="computeroutput">SinglePassRange2</code>'s
 value type. <code class="computeroutput">x <
 y</code> must be valid. <code class="computeroutput">y <
 x</code> must be valid.

Modified: trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -109,7 +109,7 @@
 </h6>

 <code class="computeroutput">mismatch</code> finds the first
- position where the correseponding elements from the two ranges <code class="computeroutput">rng1</code> and <code class="computeroutput">rng2</code>
+ position where the corresponding elements from the two ranges <code class="computeroutput">rng1</code> and <code class="computeroutput">rng2</code>
 are not equal.

Modified: trunk/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (original)
+++ trunk/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -90,7 +90,7 @@
<li class="listitem">
 An <code class="computeroutput">operator+</code>
 is defined for a left-hand operand of type <code class="computeroutput">Value</code>
- and a right-hand operance of the <code class="computeroutput">SinglePassRange</code>
+ and a right-hand operand of the <code class="computeroutput">SinglePassRange</code>
 value type.
 </li>
<li class="listitem">

Modified: trunk/libs/range/doc/html/range/reference/utilities/iterator_range.html
==============================================================================
--- trunk/libs/range/doc/html/range/reference/utilities/iterator_range.html (original)
+++ trunk/libs/range/doc/html/range/reference/utilities/iterator_range.html 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -44,7 +44,7 @@
 then one can still call all its member functions. This design decision
 avoids the <code class="computeroutput">iterator_range</code>
 imposing limitations upon ranges of iterators that are not singular. Any
- singularity limitation is simply propogated from the underlying iterator
+ singularity limitation is simply propagated from the underlying iterator
 type.
 
<h5>

Modified: trunk/libs/range/doc/reference/adaptors/type_erased.qbk
==============================================================================
--- trunk/libs/range/doc/reference/adaptors/type_erased.qbk (original)
+++ trunk/libs/range/doc/reference/adaptors/type_erased.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -18,7 +18,7 @@
* [*Template parameters:]
 * `Value` is the `value_type` for the `any_range`. If this is set to boost::use_default, `Value` will be calculated from the
 range type when the adaptor is applied.
- * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desireable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
+ * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desirable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
 * `Reference` is the `reference` for the `any_range`. `boost::use_default` will equate to `typename range_reference<Rng>::type`.
 * `Difference` is the `difference_type` for the any_range. `boost::use_default` will equate to `typename boost::range_difference<Rng>::type`
 * `Buffer` is the storage used to allocate the underlying iterator wrappers. This can typically be ignored, but is available as a template parameter for customization. Buffer must be a model of the `AnyIteratorBufferConcept`.

Modified: trunk/libs/range/doc/reference/algorithm/fill_n.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/fill_n.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/fill_n.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -14,7 +14,7 @@

[heading Description]

-`fill_n` assigns the value `val` to `n` elements in the range `rng` begining with `boost::begin(rng)`.
+`fill_n` assigns the value `val` to `n` elements in the range `rng` beginning with `boost::begin(rng)`.

[heading Definition]

Modified: trunk/libs/range/doc/reference/algorithm/lexicographical_compare.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/lexicographical_compare.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/lexicographical_compare.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -41,7 +41,7 @@
* `SinglePassRange2` is a model of the __single_pass_range__ Concept.
* `SinglePassRange1`'s value type is a model of the `LessThanComparableConcept`.
* `SinglePassRange2`'s value type is a model of the `LessThanComparableConcept`.
-* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an obect of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
+* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an object of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.

[*For the predicate versions of lexicographical_compare:]

Modified: trunk/libs/range/doc/reference/algorithm/mismatch.qbk
==============================================================================
--- trunk/libs/range/doc/reference/algorithm/mismatch.qbk (original)
+++ trunk/libs/range/doc/reference/algorithm/mismatch.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -80,7 +80,7 @@

[heading Description]

-`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal.
+`mismatch` finds the first position where the corresponding elements from the two ranges `rng1` and `rng2` are not equal.

Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions.

Modified: trunk/libs/range/doc/reference/numeric/accumulate.qbk
==============================================================================
--- trunk/libs/range/doc/reference/numeric/accumulate.qbk (original)
+++ trunk/libs/range/doc/reference/numeric/accumulate.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -42,7 +42,7 @@

# `SinglePassRange` is a model of the __single_pass_range__ Concept.
# `Value` is a model of the `AssignableConcept`.
-# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operance of the `SinglePassRange` value type.
+# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operand of the `SinglePassRange` value type.
# The return type of the above operator is convertible to `Value`.

[heading For the second version]

Modified: trunk/libs/range/doc/reference/utilities.qbk
==============================================================================
--- trunk/libs/range/doc/reference/utilities.qbk (original)
+++ trunk/libs/range/doc/reference/utilities.qbk 2012-12-13 02:09:11 EST (Thu, 13 Dec 2012)
@@ -21,7 +21,7 @@

If the template argument is not a model of __forward_traversal_iterator__, one can still use a subset of the interface. In particular, `size()` requires Random Access Traversal Iterators whereas `empty()` only requires Single Pass Iterators.

-Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propogated from the underlying iterator type.
+Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propagated from the underlying iterator type.

[h4 Synopsis]

Date view	Thread view	Subject view	Author view

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