forked from boostorg/range
[range] merge doc fixes (r81888, r81889) from trunk
[SVN r82138]
This commit is contained in:
Nathan Ridge
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="binary_search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_adjacent_find">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">adjacent_find</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
|
||||
<a name="id711185"></a>
|
||||
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -75,9 +74,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
|
||||
<a name="id712162"></a>
|
||||
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>Non-predicate versions:</strong></span>
|
||||
@ -96,16 +95,16 @@
|
||||
in <code class="computeroutput"><span class="identifier">rng</span></code> where <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.non_mutating.adjacent_find.definition"></a><h6>
|
||||
<a name="id712369"></a>
|
||||
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.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</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a><h6>
|
||||
<a name="id712440"></a>
|
||||
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span>
|
||||
@ -141,9 +140,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
|
||||
<a name="id712629"></a>
|
||||
<a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.adjacent_find.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
|
||||
@ -153,7 +152,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_binary_search">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">binary_search</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
|
||||
<a name="id712729"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</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">></span>
|
||||
<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
|
||||
@ -41,9 +40,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
|
||||
<a name="id713006"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.description"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">binary_search</span></code> returns
|
||||
@ -51,16 +50,16 @@
|
||||
value <code class="computeroutput"><span class="identifier">val</span></code> exists in the
|
||||
range <code class="computeroutput"><span class="identifier">rng</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
|
||||
<a name="id713072"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.definition"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.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</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a><h6>
|
||||
<a name="id713142"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions of binary_search:</strong></span>
|
||||
@ -109,9 +108,9 @@
|
||||
argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
|
||||
<a name="id713411"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate version:</strong></span>
|
||||
@ -127,9 +126,9 @@
|
||||
<code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
|
||||
order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
|
||||
<a name="id713503"></a>
|
||||
<a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.binary_search.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
For non-random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">N</span></code>
|
||||
@ -142,7 +141,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="count_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_count">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count">count</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
|
||||
<a name="id713666"></a>
|
||||
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count.prototype"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -43,9 +42,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
|
||||
<a name="id713960"></a>
|
||||
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count.description"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">count</span></code> returns the number
|
||||
@ -53,16 +52,16 @@
|
||||
<span class="special">==</span> <span class="identifier">val</span></code>
|
||||
is <code class="computeroutput"><span class="keyword">true</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
|
||||
<a name="id714048"></a>
|
||||
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count.definition"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.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</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count.requirements"></a><h6>
|
||||
<a name="id714118"></a>
|
||||
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count.requirements"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
|
||||
</h6>
|
||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
||||
<li class="listitem">
|
||||
@ -83,9 +82,9 @@
|
||||
value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
|
||||
<a name="id714250"></a>
|
||||
<a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count.complexity"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.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> comparisons.
|
||||
@ -93,7 +92,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="count.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_count_if">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">count_if</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
|
||||
<a name="id714315"></a>
|
||||
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count_if.prototype"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -39,9 +38,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
|
||||
<a name="id714472"></a>
|
||||
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count_if.description"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">count_if</span></code> returns the
|
||||
@ -49,16 +48,16 @@
|
||||
in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
|
||||
is <code class="computeroutput"><span class="keyword">true</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
|
||||
<a name="id714562"></a>
|
||||
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count_if.definition"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_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</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
|
||||
<a name="id714631"></a>
|
||||
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count_if.requirements"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
|
||||
</h6>
|
||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
||||
<li class="listitem">
|
||||
@ -79,9 +78,9 @@
|
||||
is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
|
||||
<a name="id714763"></a>
|
||||
<a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.count_if.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.count_if.complexity"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.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> invocations of <code class="computeroutput"><span class="identifier">pred</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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="equal_range.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_equal">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal">equal</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
|
||||
<a name="id714837"></a>
|
||||
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal.prototype"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
|
||||
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
|
||||
@ -51,9 +50,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
|
||||
<a name="id715120"></a>
|
||||
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal.description"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">equal</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is equal to the <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> and for each element <code class="computeroutput"><span class="identifier">x</span></code>
|
||||
@ -69,16 +68,16 @@
|
||||
returns <code class="computeroutput"><span class="keyword">true</span></code>. Elements are
|
||||
considered equal in the predicate version if <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.non_mutating.equal.definition"></a><h6>
|
||||
<a name="id715354"></a>
|
||||
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal.definition"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.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</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.requirements"></a><h6>
|
||||
<a name="id715424"></a>
|
||||
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal.requirements"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -137,9 +136,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
|
||||
<a name="id715734"></a>
|
||||
<a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal.complexity"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. At most <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>
|
||||
@ -148,7 +147,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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_non_mutating_equal_range">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">equal_range</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
|
||||
<a name="id715826"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
|
||||
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
|
||||
@ -65,13 +64,13 @@
|
||||
<span class="special">></span>
|
||||
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
|
||||
<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
|
||||
</pre>
|
||||
<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
|
||||
<a name="id716698"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.description"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">equal_range</span></code> returns a
|
||||
@ -83,16 +82,16 @@
|
||||
the equality of elements is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special"><</span></code>. For the predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code> the equality of elements
|
||||
is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
|
||||
<a name="id716841"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.definition"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.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</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a><h6>
|
||||
<a name="id716911"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -141,9 +140,9 @@
|
||||
argument types.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
|
||||
<a name="id717180"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
For the non-predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
|
||||
@ -153,9 +152,9 @@
|
||||
For the predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
|
||||
is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
|
||||
<a name="id717254"></a>
|
||||
<a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.equal_range.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
|
||||
@ -164,7 +163,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -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="../non_mutating.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="find_end.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_find">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find">find</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
|
||||
<a name="id717917"></a>
|
||||
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find.prototype"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -47,9 +46,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
|
||||
<a name="id718205"></a>
|
||||
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find.description"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">find</span></code>
|
||||
@ -58,16 +57,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
|
||||
<a name="id718322"></a>
|
||||
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find.definition"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.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</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find.requirements"></a><h6>
|
||||
<a name="id718392"></a>
|
||||
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find.requirements"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
|
||||
</h6>
|
||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
||||
<li class="listitem">
|
||||
@ -86,9 +85,9 @@
|
||||
value type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
|
||||
<a name="id718511"></a>
|
||||
<a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find.complexity"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons for equality.
|
||||
@ -96,7 +95,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_first_of.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_find_end">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">find_end</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
|
||||
<a name="id718575"></a>
|
||||
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_end.prototype"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -64,9 +63,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
|
||||
<a name="id719235"></a>
|
||||
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_end.description"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
|
||||
@ -79,16 +78,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
|
||||
<a name="id719359"></a>
|
||||
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_end.definition"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.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</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.requirements"></a><h6>
|
||||
<a name="id719430"></a>
|
||||
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_end.requirements"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -146,9 +145,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
|
||||
<a name="id719742"></a>
|
||||
<a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_end.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_end.complexity"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>
|
||||
@ -159,7 +158,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_find_first_of">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">find_first_of</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
|
||||
<a name="id719912"></a>
|
||||
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -64,9 +63,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
|
||||
<a name="id720570"></a>
|
||||
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_first_of.description"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
|
||||
@ -84,16 +83,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
|
||||
<a name="id720699"></a>
|
||||
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.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</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a><h6>
|
||||
<a name="id720771"></a>
|
||||
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -145,9 +144,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
|
||||
<a name="id721037"></a>
|
||||
<a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_first_of.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> comparisons.
|
||||
@ -155,7 +154,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_find_if">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">find_if</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
|
||||
<a name="id721127"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.prototype"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -47,9 +46,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
|
||||
<a name="id721417"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.description"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
|
||||
@ -62,16 +61,16 @@
|
||||
that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
|
||||
defines found in the same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
|
||||
<a name="id721545"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.definition"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_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</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.requirements"></a><h6>
|
||||
<a name="id721616"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.requirements"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
|
||||
</h6>
|
||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
||||
<li class="listitem">
|
||||
@ -88,17 +87,17 @@
|
||||
is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
|
||||
<a name="id721721"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
For each iterator <code class="computeroutput"><span class="identifier">i</span></code> in
|
||||
<code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.complexity"></a><h6>
|
||||
<a name="id721791"></a>
|
||||
<a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.find_if.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.find_if.complexity"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
@ -106,7 +105,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="find.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_for_each">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.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.non_mutating.for_each.prototype"></a><h6>
|
||||
<a name="id717348"></a>
|
||||
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
|
||||
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
|
||||
@ -43,13 +42,13 @@
|
||||
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
|
||||
<span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
|
||||
<span class="special">></span>
|
||||
<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
|
||||
<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
|
||||
<a name="id717573"></a>
|
||||
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
|
||||
@ -57,16 +56,16 @@
|
||||
element <code class="computeroutput"><span class="identifier">x</span></code> it invokes
|
||||
<code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.definition"></a><h6>
|
||||
<a name="id717651"></a>
|
||||
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.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</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.non_mutating.for_each.requirements"></a><h6>
|
||||
<a name="id717722"></a>
|
||||
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
|
||||
</h6>
|
||||
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
|
||||
<li class="listitem">
|
||||
@ -88,9 +87,9 @@
|
||||
argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
|
||||
<a name="id717844"></a>
|
||||
<a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.for_each.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.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> applications of <code class="computeroutput"><span class="identifier">UnaryFunction</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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="lower_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_lexicographical_compare">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
|
||||
<a name="id721867"></a>
|
||||
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
|
||||
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
|
||||
@ -47,13 +46,13 @@
|
||||
<span class="special">></span>
|
||||
<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span>
|
||||
<span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
|
||||
<span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
|
||||
<span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
|
||||
<a name="id722150"></a>
|
||||
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
|
||||
@ -71,16 +70,16 @@
|
||||
and using <code class="computeroutput"><span class="identifier">pred</span></code> in the
|
||||
predicate versions.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
|
||||
<a name="id722318"></a>
|
||||
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.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</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a><h6>
|
||||
<a name="id722389"></a>
|
||||
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions of lexicographical_compare:</strong></span>
|
||||
@ -108,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"><</span>
|
||||
<span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special"><</span>
|
||||
<span class="identifier">x</span></code> must be valid.
|
||||
@ -143,9 +142,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
|
||||
<a name="id722764"></a>
|
||||
<a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
|
||||
@ -155,7 +154,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="max_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_lower_bound">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">lower_bound</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
|
||||
<a name="id722868"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</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">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -47,9 +46,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
|
||||
<a name="id723158"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.description"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
|
||||
@ -70,16 +69,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
|
||||
<a name="id723347"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.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</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a><h6>
|
||||
<a name="id723418"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -128,9 +127,9 @@
|
||||
argument types.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
|
||||
<a name="id723687"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -146,9 +145,9 @@
|
||||
<code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
|
||||
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
|
||||
<a name="id723780"></a>
|
||||
<a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.lower_bound.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
|
||||
@ -161,7 +160,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="min_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_max_element">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">max_element</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
|
||||
<a name="id723919"></a>
|
||||
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.max_element.prototype"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -82,9 +81,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
|
||||
<a name="id724905"></a>
|
||||
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.max_element.description"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
|
||||
@ -96,16 +95,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
|
||||
<a name="id725000"></a>
|
||||
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.max_element.definition"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.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</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.requirements"></a><h6>
|
||||
<a name="id725071"></a>
|
||||
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.max_element.requirements"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -140,9 +139,9 @@
|
||||
argument types.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
|
||||
<a name="id725249"></a>
|
||||
<a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.max_element.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.max_element.complexity"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
|
||||
@ -151,7 +150,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="mismatch.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_min_element">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">min_element</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
|
||||
<a name="id725348"></a>
|
||||
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.min_element.prototype"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -82,9 +81,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
|
||||
<a name="id726335"></a>
|
||||
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.min_element.description"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
|
||||
@ -96,16 +95,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
|
||||
<a name="id726429"></a>
|
||||
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.min_element.definition"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.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</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.requirements"></a><h6>
|
||||
<a name="id726500"></a>
|
||||
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.min_element.requirements"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -140,9 +139,9 @@
|
||||
argument types.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
|
||||
<a name="id726678"></a>
|
||||
<a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.min_element.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.min_element.complexity"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
|
||||
@ -151,7 +150,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_mismatch">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
|
||||
<a name="id726777"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
|
||||
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span>
|
||||
@ -104,28 +103,28 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
|
||||
<a name="id728481"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.description"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
|
||||
</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>
|
||||
Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
|
||||
<a name="id728578"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.definition"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.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</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
|
||||
<a name="id728648"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -184,16 +183,16 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
|
||||
<a name="id728960"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
|
||||
<a name="id729032"></a>
|
||||
<a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.mismatch.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons.
|
||||
@ -201,7 +200,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="search_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_search">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">search</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
|
||||
<a name="id729096"></a>
|
||||
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search.prototype"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -94,9 +93,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
|
||||
<a name="id730434"></a>
|
||||
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search.description"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">search</span></code>
|
||||
@ -113,16 +112,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
|
||||
<a name="id730597"></a>
|
||||
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search.definition"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.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</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search.requirements"></a><h6>
|
||||
<a name="id730668"></a>
|
||||
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search.requirements"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -181,9 +180,9 @@
|
||||
second argument type.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
|
||||
<a name="id730979"></a>
|
||||
<a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search.complexity"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Average complexity is Linear. Worst-case complexity is quadratic.
|
||||
@ -191,7 +190,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="upper_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_search_n">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">search_n</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
|
||||
<a name="id731020"></a>
|
||||
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search_n.prototype"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -53,25 +52,25 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
|
||||
<a name="id731769"></a>
|
||||
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search_n.description"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
<code class="computeroutput"><span class="identifier">search_n</span></code> searches <code class="computeroutput"><span class="identifier">rng</span></code> for a sequence of length <code class="computeroutput"><span class="identifier">n</span></code> equal to <code class="computeroutput"><span class="identifier">value</span></code>
|
||||
where equality is determined by operator== in the non-predicate case,
|
||||
and by a predicate when one is supplied.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
|
||||
<a name="id731836"></a>
|
||||
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search_n.definition"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_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</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
|
||||
<a name="id731906"></a>
|
||||
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search_n.requirements"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -123,9 +122,9 @@
|
||||
of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
|
||||
<a name="id732195"></a>
|
||||
<a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.search_n.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.search_n.complexity"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
Average complexity is Linear. Worst-case complexity is quadratic.
|
||||
@ -133,7 +132,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
@ -22,16 +22,15 @@
|
||||
<div class="spirit-nav">
|
||||
<a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.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="../set.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
|
||||
</div>
|
||||
<div class="section">
|
||||
<div class="section range_reference_algorithms_non_mutating_upper_bound">
|
||||
<div class="titlepage"><div><div><h5 class="title">
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">upper_bound</a>
|
||||
</h5></div></div></div>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
|
||||
<a name="id732236"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h0"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
|
||||
</h6>
|
||||
<p>
|
||||
|
||||
</p>
|
||||
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</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">></span>
|
||||
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
|
||||
@ -47,9 +46,9 @@
|
||||
</pre>
|
||||
<p>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
|
||||
<a name="id732525"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h1"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.description"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
|
||||
</h6>
|
||||
<p>
|
||||
The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
|
||||
@ -69,16 +68,16 @@
|
||||
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
|
||||
same manner as the returned iterator described above.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
|
||||
<a name="id732719"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h2"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.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</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a><h6>
|
||||
<a name="id732790"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h3"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -127,9 +126,9 @@
|
||||
argument types.
|
||||
</li>
|
||||
</ul></div>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
|
||||
<a name="id733059"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h4"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
|
||||
</h6>
|
||||
<p>
|
||||
<span class="bold"><strong>For the non-predicate versions:</strong></span>
|
||||
@ -145,9 +144,9 @@
|
||||
<code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
|
||||
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
|
||||
</p>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
|
||||
<a name="id733150"></a>
|
||||
<a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
|
||||
<h6>
|
||||
<a name="range.reference.algorithms.non_mutating.upper_bound.h5"></a>
|
||||
<span><a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
|
||||
</h6>
|
||||
<p>
|
||||
For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
|
||||
@ -158,7 +157,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 © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||||
<td align="right"><div class="copyright-footer">Copyright © 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>
|
||||
|
||||
Reference in New Issue
Block a user