<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>partition</title>
<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../mutating.html" title="Mutating algorithms">
<link rel="prev" href="partial_sort.html" title="partial_sort">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition">partition</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
-<a name="id693119"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h0"></a>
+ <span class="phrase"><a name="range.reference.algorithms.mutating.partition.prototype"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.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>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id693695"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h1"></a>
+ <span class="phrase"><a name="range.reference.algorithms.mutating.partition.description"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">partition</span></code> orders the
have a configurable range_return, <code class="computeroutput"><span class="identifier">found</span></code>
corresponds to the middle iterator.
</p>
-<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id693774"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h2"></a>
+ <span class="phrase"><a name="range.reference.algorithms.mutating.partition.definition"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.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">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.partition.requirements"></a><h6>
-<a name="id693845"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h3"></a>
+ <span class="phrase"><a name="range.reference.algorithms.mutating.partition.requirements"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
</h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is a
model of the <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a> Concept.
+ Range</a> Concept. For C++ versions prior to C++11 the underlying
+ std::partition requires Bidirectional Iterators, hence the requirement
+ for older library versions is for a <a class="link" href="../../../concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>.
</li>
<li class="listitem">
<code class="computeroutput"><span class="identifier">UnaryPredicate</span></code> is
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id693947"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h4"></a>
+ <span class="phrase"><a name="range.reference.algorithms.mutating.partition.complexity"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.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">pred</span></code>,
</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>