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

[range] merge doc fixes (r81888, r81889) from trunk

Browse Source 
[SVN r82138]
This commit is contained in:
Nathan Ridge
2012-12-21 08:44:32 +00:00
parent bda0d613c1
commit a417560f09
165 changed files with 2312 additions and 2240 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
doc/html/range/reference/algorithms/new/copy_n.html
View File

@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_copy_n">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n">copy_n</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
<a name="id744730"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.copy_n.h0"></a>
<span><a name="range.reference.algorithms.new.copy_n.prototype"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">&gt;</span>
<span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
<a name="id744888"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.copy_n.h1"></a>
<span><a name="range.reference.algorithms.new.copy_n.description"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">copy_n</span></code> is provided to
@ -52,16 +51,16 @@
<code class="computeroutput"><span class="identifier">copy_n</span></code> copies elements
from <code class="computeroutput"><span class="special">[</span><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> <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> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
<a name="id745058"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.copy_n.h2"></a>
<span><a name="range.reference.algorithms.new.copy_n.definition"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
<a name="id745129"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.copy_n.h3"></a>
<span><a name="range.reference.algorithms.new.copy_n.requirements"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -78,9 +77,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ol></div>
<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
<a name="id745236"></a>
<a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.copy_n.h4"></a>
<span><a name="range.reference.algorithms.new.copy_n.complexity"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> elements
@ -89,7 +88,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/erase.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_erase">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase">erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
<a name="id745287"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.erase.h0"></a>
<span><a name="range.reference.algorithms.new.erase.prototype"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">&gt;</span>
<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">erase</span><span class="special">(</span>
@ -40,9 +39,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.erase.description"></a><h6>
<a name="id745427"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.erase.h1"></a>
<span><a name="range.reference.algorithms.new.erase.description"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">erase</span></code> the iterator range
@ -57,24 +56,24 @@
<code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
</p>
<a name="range.reference.algorithms.new.erase.definition"></a><h6>
<a name="id745727"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.erase.h2"></a>
<span><a name="range.reference.algorithms.new.erase.definition"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.erase.requirements"></a><h6>
<a name="id745796"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.erase.h3"></a>
<span><a name="range.reference.algorithms.new.erase.requirements"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
<code class="computeroutput"><span class="identifier">Container</span></code> supports
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
<a name="id745840"></a>
<a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.erase.h4"></a>
<span><a name="range.reference.algorithms.new.erase.complexity"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
</h6>
<p>
Linear. Proprotional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">to_erase</span><span class="special">)</span></code>.
@ -82,7 +81,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/for_each.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_for_each">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
<a name="id745904"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.for_each.h0"></a>
<span><a name="range.reference.algorithms.new.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@ -71,9 +70,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.for_each.description"></a><h6>
<a name="id746478"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.for_each.h1"></a>
<span><a name="range.reference.algorithms.new.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
@ -87,16 +86,16 @@
Iteration is stopped upon reaching the end of the shorter of <code class="computeroutput"><span class="identifier">rng1</span></code>, or <code class="computeroutput"><span class="identifier">rng2</span></code>.
It is safe to call this function with unequal length ranges.
</p>
<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
<a name="id746634"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.for_each.h2"></a>
<span><a name="range.reference.algorithms.new.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.for_each.requirements"></a><h6>
<a name="id746705"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.for_each.h3"></a>
<span><a name="range.reference.algorithms.new.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -124,9 +123,9 @@
second argument type.
</li>
</ol></div>
<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
<a name="id746866"></a>
<a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.for_each.h4"></a>
<span><a name="range.reference.algorithms.new.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@ -135,7 +134,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/insert.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_insert">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert">insert</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
<a name="id746969"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.insert.h0"></a>
<span><a name="range.reference.algorithms.new.insert.prototype"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@ -43,9 +42,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.insert.description"></a><h6>
<a name="id747139"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.insert.h1"></a>
<span><a name="range.reference.algorithms.new.insert.description"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">insert</span></code> all of the elements
@ -53,16 +52,16 @@
the <code class="computeroutput"><span class="identifier">before</span></code> iterator into
<code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.insert.definition"></a><h6>
<a name="id747205"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.insert.h2"></a>
<span><a name="range.reference.algorithms.new.insert.definition"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.insert.requirements"></a><h6>
<a name="id747275"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.insert.h3"></a>
<span><a name="range.reference.algorithms.new.insert.requirements"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -80,9 +79,9 @@
value type.
</li>
</ol></div>
<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
<a name="id747373"></a>
<a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.insert.h4"></a>
<span><a name="range.reference.algorithms.new.insert.complexity"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@ -91,7 +90,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/iota.html
View File

@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_iota">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota">iota</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
<a name="id747438"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.iota.h0"></a>
<span><a name="range.reference.algorithms.new.iota.prototype"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
<span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.iota.description"></a><h6>
<a name="id747564"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.iota.h1"></a>
<span><a name="range.reference.algorithms.new.iota.description"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
@ -49,16 +48,16 @@
is assigned a value equivalent to <code class="computeroutput"><span class="identifier">x</span>
<span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><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> <span class="identifier">it</span><span class="special">)</span></code>
</p>
<a name="range.reference.algorithms.new.iota.definition"></a><h6>
<a name="id747700"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.iota.h2"></a>
<span><a name="range.reference.algorithms.new.iota.definition"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.iota.requirements"></a><h6>
<a name="id747770"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.iota.h3"></a>
<span><a name="range.reference.algorithms.new.iota.requirements"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -72,9 +71,9 @@
Concept.
</li>
</ol></div>
<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
<a name="id747850"></a>
<a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.iota.h4"></a>
<span><a name="range.reference.algorithms.new.iota.complexity"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments into <code class="computeroutput"><span class="identifier">rng</span></code>.
@ -82,7 +81,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/is_sorted.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_is_sorted">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted">is_sorted</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
<a name="id747924"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.is_sorted.h0"></a>
<span><a name="range.reference.algorithms.new.is_sorted.prototype"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">&gt;</span>
<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&amp;</span> <span class="identifier">rng</span><span class="special">);</span>
@ -41,9 +40,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
<a name="id748118"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.is_sorted.h1"></a>
<span><a name="range.reference.algorithms.new.is_sorted.description"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">is_sorted</span></code> determines
@ -57,16 +56,16 @@
the expression <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
<a name="id748306"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.is_sorted.h2"></a>
<span><a name="range.reference.algorithms.new.is_sorted.definition"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
<a name="id748376"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.is_sorted.h3"></a>
<span><a name="range.reference.algorithms.new.is_sorted.requirements"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -84,9 +83,9 @@
is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
</li>
</ol></div>
<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
<a name="id748485"></a>
<a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.is_sorted.h4"></a>
<span><a name="range.reference.algorithms.new.is_sorted.complexity"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
</h6>
<p>
Linear. A maximum of <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons are performed.
@ -94,7 +93,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/overwrite.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_overwrite">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite">overwrite</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
<a name="id748550"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.overwrite.h0"></a>
<span><a name="range.reference.algorithms.new.overwrite.prototype"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@ -42,25 +41,25 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
<a name="id748683"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.overwrite.h1"></a>
<span><a name="range.reference.algorithms.new.overwrite.description"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">overwrite</span></code> assigns the
values from the range <code class="computeroutput"><span class="identifier">from</span></code>
into the range <code class="computeroutput"><span class="identifier">to</span></code>.
</p>
<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
<a name="id748739"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.overwrite.h2"></a>
<span><a name="range.reference.algorithms.new.overwrite.definition"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.overwrite.requirements"></a><h6>
<a name="id748810"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.overwrite.h3"></a>
<span><a name="range.reference.algorithms.new.overwrite.requirements"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -87,9 +86,9 @@
value type.
</li>
</ol></div>
<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
<a name="id748987"></a>
<a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.overwrite.h4"></a>
<span><a name="range.reference.algorithms.new.overwrite.complexity"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
@ -98,7 +97,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/push_back.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_push_back">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back">push_back</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
<a name="id749051"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.push_back.h0"></a>
<span><a name="range.reference.algorithms.new.push_back.prototype"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@ -42,25 +41,25 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.push_back.description"></a><h6>
<a name="id749190"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.push_back.h1"></a>
<span><a name="range.reference.algorithms.new.push_back.description"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">push_back</span></code> all of the
elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
<a name="id749246"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.push_back.h2"></a>
<span><a name="range.reference.algorithms.new.push_back.definition"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.push_back.requirements"></a><h6>
<a name="id749316"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.push_back.h3"></a>
<span><a name="range.reference.algorithms.new.push_back.requirements"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -78,9 +77,9 @@
value type.
</li>
</ol></div>
<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
<a name="id749427"></a>
<a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.push_back.h4"></a>
<span><a name="range.reference.algorithms.new.push_back.complexity"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@ -89,7 +88,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/push_front.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_push_front">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front">push_front</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
<a name="id749493"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.push_front.h0"></a>
<span><a name="range.reference.algorithms.new.push_front.prototype"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@ -42,25 +41,25 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.push_front.description"></a><h6>
<a name="id749631"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.push_front.h1"></a>
<span><a name="range.reference.algorithms.new.push_front.description"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">push_front</span></code> all of the
elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
<a name="id749686"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.push_front.h2"></a>
<span><a name="range.reference.algorithms.new.push_front.definition"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.push_front.requirements"></a><h6>
<a name="id749755"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.push_front.h3"></a>
<span><a name="range.reference.algorithms.new.push_front.requirements"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -78,9 +77,9 @@
value type.
</li>
</ol></div>
<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
<a name="id749868"></a>
<a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.push_front.h4"></a>
<span><a name="range.reference.algorithms.new.push_front.complexity"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@ -89,7 +88,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/remove_erase.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_remove_erase">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase">remove_erase</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
<a name="id749933"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase.h0"></a>
<span><a name="range.reference.algorithms.new.remove_erase.prototype"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">&gt;</span>
<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
@ -39,9 +38,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
<a name="id750070"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase.h1"></a>
<span><a name="range.reference.algorithms.new.remove_erase.description"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
@ -49,24 +48,24 @@
from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
<a name="id750126"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase.h2"></a>
<span><a name="range.reference.algorithms.new.remove_erase.definition"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.remove_erase.requirements"></a><h6>
<a name="id750197"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase.h3"></a>
<span><a name="range.reference.algorithms.new.remove_erase.requirements"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
<code class="computeroutput"><span class="identifier">Container</span></code> supports
erase of an iterator range.
</li></ol></div>
<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
<a name="id750242"></a>
<a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase.h4"></a>
<span><a name="range.reference.algorithms.new.remove_erase.complexity"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
</h6>
<p>
Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@ -74,7 +73,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>

36
doc/html/range/reference/algorithms/new/remove_erase_if.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_new_remove_erase_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">remove_erase_if</a>
</h5></div></div></div>
<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
<a name="id750307"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase_if.h0"></a>
<span><a name="range.reference.algorithms.new.remove_erase_if.prototype"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">&gt;</span>
<span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&amp;</span> <span class="identifier">target</span><span class="special">,</span>
@ -39,9 +38,9 @@
</pre>
<p>
</p>
<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
<a name="id750434"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase_if.h1"></a>
<span><a name="range.reference.algorithms.new.remove_erase_if.description"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_erase_if</span></code> removes
@ -50,16 +49,16 @@
from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">erase</span></code>
algorithm which merely rearranges elements.
</p>
<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
<a name="id750514"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase_if.h2"></a>
<span><a name="range.reference.algorithms.new.remove_erase_if.definition"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.new.remove_erase_if.requirements"></a><h6>
<a name="id750585"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase_if.h3"></a>
<span><a name="range.reference.algorithms.new.remove_erase_if.requirements"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@ -71,9 +70,9 @@
the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
</li>
</ol></div>
<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
<a name="id750659"></a>
<a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.new.remove_erase_if.h4"></a>
<span><a name="range.reference.algorithms.new.remove_erase_if.complexity"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
</h6>
<p>
Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@ -81,7 +80,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>