]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
1 | <?xml version="1.0" encoding="utf-8" ?> |
2 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> | |
3 | <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> | |
4 | <head> | |
5 | <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> | |
6 | <meta name="generator" content="Docutils 0.7: http://docutils.sourceforge.net/" /> | |
7 | <title>The MPL Reference Manual: reverse_partition</title> | |
8 | <link rel="stylesheet" href="../style.css" type="text/css" /> | |
9 | </head> | |
10 | <body class="docframe refmanual"> | |
11 | <table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./reverse-unique.html" class="navigation-link">Prev</a> <a href="./reverse-stable-partition.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-unique.html" class="navigation-link">Back</a> <a href="./reverse-stable-partition.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./transformation-algorithms.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td> | |
12 | <td class="header-group page-location"><a href="../refmanual.html" class="navigation-link">Front Page</a> / <a href="./algorithms.html" class="navigation-link">Algorithms</a> / <a href="./transformation-algorithms.html" class="navigation-link">Transformation Algorithms</a> / <a href="./reverse-partition.html" class="navigation-link">reverse_partition</a></td> | |
13 | </tr></table><div class="header-separator"></div> | |
14 | <div class="section" id="reverse-partition"> | |
15 | <h1><a class="toc-backref" href="./transformation-algorithms.html#id1506">reverse_partition</a></h1> | |
16 | <div class="section" id="id794"> | |
17 | <h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3> | |
18 | <pre class="literal-block"> | |
19 | template< | |
20 | typename Seq | |
21 | , typename Pred | |
22 | , typename In1 = <em>unspecified</em> | |
23 | , typename In2 = <em>unspecified</em> | |
24 | > | |
25 | struct <a href="./reverse-partition.html" class="identifier">reverse_partition</a> | |
26 | { | |
27 | typedef <em>unspecified</em> type; | |
28 | }; | |
29 | </pre> | |
30 | </div> | |
31 | <div class="section" id="id795"> | |
32 | <h3><a class="subsection-title" href="#description" name="description">Description</a></h3> | |
33 | <p>Returns a pair of sequences together containing all elements in the range | |
34 | [<tt class="literal"><span class="pre"><a href="./begin.html" class="identifier">begin</a><Seq>::type</span></tt>, <tt class="literal"><span class="pre"><a href="./end.html" class="identifier">end</a><Seq>::type</span></tt>) split into two groups based on the predicate <tt class="literal"><span class="pre">Pred</span></tt>. | |
35 | <tt class="literal"><span class="pre"><a href="./reverse-partition.html" class="identifier">reverse_partition</a></span></tt> is a synonym for <a class="reference internal" href="./reverse-stable-partition.html">reverse_stable_partition</a>.</p> | |
36 | <p>[<em>Note:</em> This wording applies to a no-inserter version(s) of the algorithm. See the | |
37 | <cite>Expression semantics</cite> subsection for a precise specification of the algorithm's | |
38 | details in all cases — <em>end note</em>]</p> | |
39 | </div> | |
40 | <div class="section" id="id796"> | |
41 | <h3><a class="subsection-title" href="#header" name="header">Header</a></h3> | |
42 | <pre class="literal-block"> | |
43 | #include <<a href="../../../../boost/mpl/partition.hpp" class="header">boost/mpl/partition.hpp</a>> | |
44 | </pre> | |
45 | </div> | |
46 | <div class="section" id="id797"> | |
47 | <h3><a class="subsection-title" href="#model-of" name="model-of">Model of</a></h3> | |
48 | <p><a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a></p> | |
49 | </div> | |
50 | <div class="section" id="id798"> | |
51 | <h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3> | |
52 | <table border="1" class="docutils table"> | |
53 | <colgroup> | |
54 | <col width="22%" /> | |
55 | <col width="41%" /> | |
56 | <col width="36%" /> | |
57 | </colgroup> | |
58 | <thead valign="bottom"> | |
59 | <tr><th class="head">Parameter</th> | |
60 | <th class="head">Requirement</th> | |
61 | <th class="head">Description</th> | |
62 | </tr> | |
63 | </thead> | |
64 | <tbody valign="top"> | |
65 | <tr><td><tt class="literal"><span class="pre">Seq</span></tt></td> | |
66 | <td><a class="reference internal" href="./forward-sequence.html">Forward Sequence</a></td> | |
67 | <td>An original sequence.</td> | |
68 | </tr> | |
69 | <tr><td><tt class="literal"><span class="pre">Pred</span></tt></td> | |
70 | <td>Unary <a class="reference internal" href="./lambda-expression.html">Lambda Expression</a></td> | |
71 | <td>A partitioning predicate.</td> | |
72 | </tr> | |
73 | <tr><td><tt class="literal"><span class="pre">In1</span></tt>, <tt class="literal"><span class="pre">In2</span></tt></td> | |
74 | <td><a class="reference internal" href="./inserter.html">Inserter</a></td> | |
75 | <td>Output inserters.</td> | |
76 | </tr> | |
77 | </tbody> | |
78 | </table> | |
79 | </div> | |
80 | <div class="section" id="id799"> | |
81 | <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3> | |
82 | <p>The semantics of an expression are defined only | |
83 | where they differ from, or are not defined in <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>.</p> | |
84 | <p>For any <a class="reference internal" href="./forward-sequence.html">Forward Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, an unary <a class="reference internal" href="./lambda-expression.html">Lambda Expression</a> <tt class="literal"><span class="pre">pred</span></tt>, and <a class="reference internal" href="./inserter.html">Inserter</a>s | |
85 | <tt class="literal"><span class="pre">in1</span></tt> and <tt class="literal"><span class="pre">in2</span></tt>:</p> | |
86 | <pre class="literal-block"> | |
87 | typedef <a href="./reverse-partition.html" class="identifier">reverse_partition</a><s,pred,in1,in2>::type r; | |
88 | </pre> | |
89 | <table class="docutils field-list" frame="void" rules="none"> | |
90 | <col class="field-name" /> | |
91 | <col class="field-body" /> | |
92 | <tbody valign="top"> | |
93 | <tr class="field"><th class="field-name">Return type:</th><td class="field-body"><p class="first">A <a class="reference internal" href="./pair.html">pair</a>.</p> | |
94 | </td> | |
95 | </tr> | |
96 | <tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first">Equivalent to</p> | |
97 | <pre class="last literal-block"> | |
98 | typedef <a href="./reverse-stable-partition.html" class="identifier">reverse_stable_partition</a><s,pred,in1,in2>::type r; | |
99 | </pre> | |
100 | </td> | |
101 | </tr> | |
102 | </tbody> | |
103 | </table> | |
104 | </div> | |
105 | <div class="section" id="id800"> | |
106 | <h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3> | |
107 | <p>Linear. Exactly <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span></tt> applications of <tt class="literal"><span class="pre">pred</span></tt>, and <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span></tt> | |
108 | of summarized <tt class="literal"><span class="pre">in1::operation</span></tt> / <tt class="literal"><span class="pre">in2::operation</span></tt> applications.</p> | |
109 | </div> | |
110 | <div class="section" id="id801"> | |
111 | <h3><a class="subsection-title" href="#example" name="example">Example</a></h3> | |
112 | <pre class="literal-block"> | |
113 | template< typename N > struct is_odd : <a href="./bool.html" class="identifier">bool_</a><(N::value % 2)> {}; | |
114 | ||
115 | typedef <a href="./partition.html" class="identifier">partition</a>< | |
116 | <a href="./range-c.html" class="identifier">range_c</a><int,0,10> | |
117 | , is_odd<<a href="./placeholders.html" class="identifier">_1</a>> | |
118 | , <a href="./back-inserter.html" class="identifier">back_inserter</a>< <a href="./vector.html" class="identifier">vector</a><> > | |
119 | , <a href="./back-inserter.html" class="identifier">back_inserter</a>< <a href="./vector.html" class="identifier">vector</a><> > | |
120 | >::type r; | |
121 | ||
122 | <a href="./assert.html" class="identifier">BOOST_MPL_ASSERT</a>(( <a href="./equal.html" class="identifier">equal</a>< r::first, <a href="./vector-c.html" class="identifier">vector_c</a><int,9,7,5,3,1> > )); | |
123 | <a href="./assert.html" class="identifier">BOOST_MPL_ASSERT</a>(( <a href="./equal.html" class="identifier">equal</a>< r::second, <a href="./vector-c.html" class="identifier">vector_c</a><int,8,6,4,2,0> > )); | |
124 | </pre> | |
125 | </div> | |
126 | <div class="section" id="id802"> | |
127 | <h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3> | |
128 | <p><a class="reference internal" href="./transformation-algorithms.html">Transformation Algorithms</a>, <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>, <a class="reference internal" href="./partition.html">partition</a>, <a class="reference internal" href="./reverse-stable-partition.html">reverse_stable_partition</a>, <a class="reference internal" href="./sort.html">sort</a></p> | |
129 | <!-- Algorithms/Transformation Algorithms//reverse_stable_partition |190 --> | |
130 | </div> | |
131 | </div> | |
132 | ||
133 | <div class="footer-separator"></div> | |
134 | <table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./reverse-unique.html" class="navigation-link">Prev</a> <a href="./reverse-stable-partition.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-unique.html" class="navigation-link">Back</a> <a href="./reverse-stable-partition.html" class="navigation-link">Along</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./transformation-algorithms.html" class="navigation-link">Up</a> <a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td> | |
135 | <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div> | |
136 | Distributed under the Boost Software License, Version 1.0. (See accompanying | |
137 | file LICENSE_1_0.txt or copy at <a class="reference external" href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)</div></td></tr></table></body> | |
138 | </html> |