projects / ceph.git / blame
| 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_stable_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-partition.html" class="navigation-link">Prev</a> <a href="./runtime-algorithms.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-partition.html" class="navigation-link">Back</a> Along</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-stable-partition.html" class="navigation-link">reverse_stable_partition</a></td> | |
| 13 | </tr></table><div class="header-separator"></div> | |
| 14 | <div class="section" id="reverse-stable-partition"> | |
| 15 | <h1><a class="toc-backref" href="./transformation-algorithms.html#id1507">reverse_stable_partition</a></h1> | |
| 16 | <div class="section" id="id803"> | |
| 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-stable-partition.html" class="identifier">reverse_stable_partition</a> | |
| 26 | { | |
| 27 | typedef <em>unspecified</em> type; | |
| 28 | }; | |
| 29 | </pre> | |
| 30 | </div> | |
| 31 | <div class="section" id="id804"> | |
| 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-stable-partition.html" class="identifier">reverse_stable_partition</a></span></tt> is guaranteed to preserve the reversed | |
| 36 | relative order of the elements in the resulting sequences.</p> | |
| 37 | <p>[<em>Note:</em> This wording applies to a no-inserter version(s) of the algorithm. See the | |
| 38 | <cite>Expression semantics</cite> subsection for a precise specification of the algorithm's | |
| 39 | details in all cases — <em>end note</em>]</p> | |
| 40 | </div> | |
| 41 | <div class="section" id="id805"> | |
| 42 | <h3><a class="subsection-title" href="#header" name="header">Header</a></h3> | |
| 43 | <pre class="literal-block"> | |
| 44 | #include <<a href="../../../../boost/mpl/stable_partition.hpp" class="header">boost/mpl/stable_partition.hpp</a>> | |
| 45 | </pre> | |
| 46 | </div> | |
| 47 | <div class="section" id="id806"> | |
| 48 | <h3><a class="subsection-title" href="#model-of" name="model-of">Model of</a></h3> | |
| 49 | <p><a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a></p> | |
| 50 | </div> | |
| 51 | <div class="section" id="id807"> | |
| 52 | <h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3> | |
| 53 | <table border="1" class="docutils table"> | |
| 54 | <colgroup> | |
| 55 | <col width="22%" /> | |
| 56 | <col width="41%" /> | |
| 57 | <col width="36%" /> | |
| 58 | </colgroup> | |
| 59 | <thead valign="bottom"> | |
| 60 | <tr><th class="head">Parameter</th> | |
| 61 | <th class="head">Requirement</th> | |
| 62 | <th class="head">Description</th> | |
| 63 | </tr> | |
| 64 | </thead> | |
| 65 | <tbody valign="top"> | |
| 66 | <tr><td><tt class="literal"><span class="pre">Seq</span></tt></td> | |
| 67 | <td><a class="reference internal" href="./forward-sequence.html">Forward Sequence</a></td> | |
| 68 | <td>An original sequence.</td> | |
| 69 | </tr> | |
| 70 | <tr><td><tt class="literal"><span class="pre">Pred</span></tt></td> | |
| 71 | <td>Unary <a class="reference internal" href="./lambda-expression.html">Lambda Expression</a></td> | |
| 72 | <td>A partitioning predicate.</td> | |
| 73 | </tr> | |
| 74 | <tr><td><tt class="literal"><span class="pre">In1</span></tt>, <tt class="literal"><span class="pre">In2</span></tt></td> | |
| 75 | <td><a class="reference internal" href="./inserter.html">Inserter</a></td> | |
| 76 | <td>Output inserters.</td> | |
| 77 | </tr> | |
| 78 | </tbody> | |
| 79 | </table> | |
| 80 | </div> | |
| 81 | <div class="section" id="id808"> | |
| 82 | <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3> | |
| 83 | <p>The semantics of an expression are defined only | |
| 84 | where they differ from, or are not defined in <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>.</p> | |
| 85 | <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 | |
| 86 | <tt class="literal"><span class="pre">in1</span></tt> and <tt class="literal"><span class="pre">in2</span></tt>:</p> | |
| 87 | <pre class="literal-block"> | |
| 88 | typedef <a href="./reverse-stable-partition.html" class="identifier">reverse_stable_partition</a><s,pred,in1,in2>::type r; | |
| 89 | </pre> | |
| 90 | <table class="docutils field-list" frame="void" rules="none"> | |
| 91 | <col class="field-name" /> | |
| 92 | <col class="field-body" /> | |
| 93 | <tbody valign="top"> | |
| 94 | <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> | |
| 95 | </td> | |
| 96 | </tr> | |
| 97 | <tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first">Equivalent to</p> | |
| 98 | <pre class="last literal-block"> | |
| 99 | typedef <a href="./lambda.html" class="identifier">lambda</a><pred>::type p; | |
| 100 | typedef <a href="./lambda.html" class="identifier">lambda</a><in1::operation>::type in1_op; | |
| 101 | typedef <a href="./lambda.html" class="identifier">lambda</a><in2::operation>::type in2_op; | |
| 102 | ||
| 103 | typedef <a href="./reverse-fold.html" class="identifier">reverse_fold</a>< | |
| 104 | s | |
| 105 | , <a href="./pair.html" class="identifier">pair</a>< in1::state, in2::state > | |
| 106 | , <a href="./if.html" class="identifier">if_</a>< | |
| 107 | <a href="./apply-wrap.html" class="identifier">apply_wrap</a><tt class="literal"><span class="pre">1</span></tt><p,<a href="./placeholders.html" class="identifier">_2</a>> | |
| 108 | , <a href="./pair.html" class="identifier">pair</a>< <a href="./apply-wrap.html" class="identifier">apply_wrap</a><tt class="literal"><span class="pre">2</span></tt><in1_op,first<<a href="./placeholders.html" class="identifier">_1</a>>,<a href="./placeholders.html" class="identifier">_2</a>>, second<<a href="./placeholders.html" class="identifier">_1</a>> > | |
| 109 | , <a href="./pair.html" class="identifier">pair</a>< first<<a href="./placeholders.html" class="identifier">_1</a>>, <a href="./apply-wrap.html" class="identifier">apply_wrap</a><tt class="literal"><span class="pre">2</span></tt><in2_op,second<<a href="./placeholders.html" class="identifier">_1</a>>,<a href="./placeholders.html" class="identifier">_2</a>> > | |
| 110 | > | |
| 111 | >::type r; | |
| 112 | </pre> | |
| 113 | </td> | |
| 114 | </tr> | |
| 115 | </tbody> | |
| 116 | </table> | |
| 117 | </div> | |
| 118 | <div class="section" id="id809"> | |
| 119 | <h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3> | |
| 120 | <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> | |
| 121 | of summarized <tt class="literal"><span class="pre">in1::operation</span></tt> / <tt class="literal"><span class="pre">in2::operation</span></tt> applications.</p> | |
| 122 | </div> | |
| 123 | <div class="section" id="id810"> | |
| 124 | <h3><a class="subsection-title" href="#example" name="example">Example</a></h3> | |
| 125 | <pre class="literal-block"> | |
| 126 | template< typename N > struct is_odd : <a href="./bool.html" class="identifier">bool_</a><(N::value % 2)> {}; | |
| 127 | ||
| 128 | typedef <a href="./reverse-stable-partition.html" class="identifier">reverse_stable_partition</a>< | |
| 129 | <a href="./range-c.html" class="identifier">range_c</a><int,0,10> | |
| 130 | , is_odd<<a href="./placeholders.html" class="identifier">_1</a>> | |
| 131 | , <a href="./back-inserter.html" class="identifier">back_inserter</a>< <a href="./vector.html" class="identifier">vector</a><> > | |
| 132 | , <a href="./back-inserter.html" class="identifier">back_inserter</a>< <a href="./vector.html" class="identifier">vector</a><> > | |
| 133 | >::type r; | |
| 134 | ||
| 135 | <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> > )); | |
| 136 | <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> > )); | |
| 137 | </pre> | |
| 138 | </div> | |
| 139 | <div class="section" id="id811"> | |
| 140 | <h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3> | |
| 141 | <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="./stable-partition.html">stable_partition</a>, <a class="reference internal" href="./reverse-partition.html">reverse_partition</a>, <a class="reference internal" href="./sort.html">sort</a>, <a class="reference internal" href="./transform.html">transform</a></p> | |
| 142 | </div> | |
| 143 | </div> | |
| 144 | ||
| 145 | <div class="footer-separator"></div> | |
| 146 | <table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./reverse-partition.html" class="navigation-link">Prev</a> <a href="./runtime-algorithms.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-partition.html" class="navigation-link">Back</a> Along</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> | |
| 147 | <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div> | |
| 148 | Distributed under the Boost Software License, Version 1.0. (See accompanying | |
| 149 | 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> | |
| 150 | </html> |