feedc0de/boost_range
1
0
Fork 0
forked from boostorg/range
Code Pull Requests Activity

[range] fixed some doc typos (patch by Michel Morin)

Browse Source 
[SVN r81889]
This commit is contained in:
Nathan Ridge
2012-12-13 07:09:11 +00:00
parent 665c4a3234
commit bf4ca510ea
15 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/html/index.html
View File

@ -147,7 +147,7 @@
</p>
</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 13, 2012 at 06:35:02 GMT</small></p></td>
<td align="left"><p><small>Last revised: December 13, 2012 at 06:53:49 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

2
doc/html/range/history_ack.html
View File

@ -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>
<p>

2
doc/html/range/reference/adaptors/reference/type_erased.html
View File

@ -105,7 +105,7 @@
<li class="listitem">
<code class="computeroutput"><span class="identifier">Traversal</span></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"><span class="identifier">any_range</span></code>.
If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>

2
doc/html/range/reference/algorithms/mutating/fill_n.html
View File

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

2
doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
View File

@ -107,7 +107,7 @@
Let <code class="computeroutput"><span class="identifier">x</span></code> be an object
of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
value type. Let <code class="computeroutput"><span class="identifier">y</span></code>
be an obect of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
be an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
value type. <code class="computeroutput"><span class="identifier">x</span> <span class="special">&lt;</span>
<span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special">&lt;</span>
<span class="identifier">x</span></code> must be valid.

2
doc/html/range/reference/algorithms/non_mutating/mismatch.html
View File

@ -109,7 +109,7 @@
</h6>
<p>
<code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
position where the corresponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
are not equal.
</p>
<p>

2
doc/html/range/reference/algorithms/numeric/accumulate.html
View File

@ -90,7 +90,7 @@
<li class="listitem">
An <code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code>
is defined for a left-hand operand of type <code class="computeroutput"><span class="identifier">Value</span></code>
and a right-hand operance of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
and a right-hand operand of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
value type.
</li>
<li class="listitem">

2
doc/html/range/reference/utilities/iterator_range.html
View File

@ -44,7 +44,7 @@
then one can still call all its member functions. This design decision
avoids the <code class="computeroutput"><span class="identifier">iterator_range</span></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.
</p>
<h5>