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

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

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

44
doc/html/range/reference/algorithms/set/includes.html
View File

@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.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_union.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="section range_reference_algorithms_set_includes">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes">includes</a>
</h5></div></div></div>
<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
<a name="id733300"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
<h6>
<a name="range.reference.algorithms.set.includes.h0"></a>
<span><a name="range.reference.algorithms.set.includes.prototype"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
</h6>
<p>
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">&gt;</span>
<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</span> <span class="identifier">rng2</span><span class="special">);</span>
@ -42,13 +41,13 @@
<span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
<span class="special">&gt;</span>
<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&amp;</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&amp;</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.set.includes.description"></a><h6>
<a name="id733580"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
<h6>
<a name="range.reference.algorithms.set.includes.h1"></a>
<span><a name="range.reference.algorithms.set.includes.description"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">includes</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if and only if, for every element
@ -58,16 +57,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
<a name="range.reference.algorithms.set.includes.definition"></a><h6>
<a name="id733674"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
<h6>
<a name="range.reference.algorithms.set.includes.h2"></a>
<span><a name="range.reference.algorithms.set.includes.definition"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.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">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
<a name="range.reference.algorithms.set.includes.requirements"></a><h6>
<a name="id733743"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
<h6>
<a name="range.reference.algorithms.set.includes.h3"></a>
<span><a name="range.reference.algorithms.set.includes.requirements"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@ -143,9 +142,9 @@
second argument types.
</li>
</ul></div>
<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
<a name="id734152"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
<h6>
<a name="range.reference.algorithms.set.includes.h4"></a>
<span><a name="range.reference.algorithms.set.includes.precondition_"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@ -161,9 +160,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
<a name="id734266"></a>
<a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
<h6>
<a name="range.reference.algorithms.set.includes.h5"></a>
<span><a name="range.reference.algorithms.set.includes.complexity"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@ -172,7 +171,8 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003 -2010 Thorsten Ottosen, Neil Groves<p>
<td align="right"><div class="copyright-footer">Copyright &#169; 2003-2010 Thorsten Ottosen,
Neil Groves<p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>