| <?xml version="1.0" encoding="utf-8" ?> |
| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> |
| <meta name="generator" content="Docutils 0.7: http://docutils.sourceforge.net/" /> |
| <title>The MPL Reference Manual: reverse_remove</title> |
| <link rel="stylesheet" href="../style.css" type="text/css" /> |
| </head> |
| <body class="docframe refmanual"> |
| <table class="header"><tr class="header"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Prev</a> <a href="./reverse-remove-if.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Back</a> <a href="./reverse-remove-if.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> |
| <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-remove.html" class="navigation-link">reverse_remove</a></td> |
| </tr></table><div class="header-separator"></div> |
| <div class="section" id="reverse-remove"> |
| <h1><a class="toc-backref" href="./transformation-algorithms.html#id1503">reverse_remove</a></h1> |
| <div class="section" id="id767"> |
| <h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3> |
| <pre class="literal-block"> |
| template< |
| typename Sequence |
| , typename T |
| , typename In = <em>unspecified</em> |
| > |
| struct <a href="./reverse-remove.html" class="identifier">reverse_remove</a> |
| { |
| typedef <em>unspecified</em> type; |
| }; |
| </pre> |
| </div> |
| <div class="section" id="id768"> |
| <h3><a class="subsection-title" href="#description" name="description">Description</a></h3> |
| <p>Returns a new sequence that contains all elements from [<tt class="literal"><span class="pre"><a href="./begin.html" class="identifier">begin</a><Sequence>::type</span></tt>, <tt class="literal"><span class="pre"><a href="./end.html" class="identifier">end</a><Sequence>::type</span></tt>) |
| range in reverse order except those that are identical to <tt class="literal"><span class="pre">T</span></tt>.</p> |
| <p>[<em>Note:</em> This wording applies to a no-inserter version(s) of the algorithm. See the |
| <cite>Expression semantics</cite> subsection for a precise specification of the algorithm's |
| details in all cases — <em>end note</em>]</p> |
| </div> |
| <div class="section" id="id769"> |
| <h3><a class="subsection-title" href="#header" name="header">Header</a></h3> |
| <pre class="literal-block"> |
| #include <<a href="../../../../boost/mpl/remove.hpp" class="header">boost/mpl/remove.hpp</a>> |
| </pre> |
| </div> |
| <div class="section" id="id770"> |
| <h3><a class="subsection-title" href="#model-of" name="model-of">Model of</a></h3> |
| <p><a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a></p> |
| </div> |
| <div class="section" id="id771"> |
| <h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3> |
| <table border="1" class="docutils table"> |
| <colgroup> |
| <col width="19%" /> |
| <col width="43%" /> |
| <col width="38%" /> |
| </colgroup> |
| <thead valign="bottom"> |
| <tr><th class="head">Parameter</th> |
| <th class="head">Requirement</th> |
| <th class="head">Description</th> |
| </tr> |
| </thead> |
| <tbody valign="top"> |
| <tr><td><tt class="literal"><span class="pre">Sequence</span></tt></td> |
| <td><a class="reference internal" href="./forward-sequence.html">Forward Sequence</a></td> |
| <td>An original sequence.</td> |
| </tr> |
| <tr><td><tt class="literal"><span class="pre">T</span></tt></td> |
| <td>Any type</td> |
| <td>A type to be removed.</td> |
| </tr> |
| <tr><td><tt class="literal"><span class="pre">In</span></tt></td> |
| <td><a class="reference internal" href="./inserter.html">Inserter</a></td> |
| <td>An inserter.</td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <div class="section" id="id772"> |
| <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3> |
| <p>The semantics of an expression are defined only |
| where they differ from, or are not defined in <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>.</p> |
| <p>For any <a class="reference internal" href="./forward-sequence.html">Forward Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, an <a class="reference internal" href="./inserter.html">Inserter</a> <tt class="literal"><span class="pre">in</span></tt>, and arbitrary type <tt class="literal"><span class="pre">x</span></tt>:</p> |
| <pre class="literal-block"> |
| typedef <a href="./reverse-remove.html" class="identifier">reverse_remove</a><s,x,in>::type r; |
| </pre> |
| <table class="docutils field-list" frame="void" rules="none"> |
| <col class="field-name" /> |
| <col class="field-body" /> |
| <tbody valign="top"> |
| <tr class="field"><th class="field-name">Return type:</th><td class="field-body"><p class="first">A type.</p> |
| </td> |
| </tr> |
| <tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first">Equivalent to</p> |
| <pre class="last literal-block"> |
| typedef <a href="./reverse-remove-if.html" class="identifier">reverse_remove_if</a>< s,is_same<_,x>,in >::type r; |
| </pre> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <div class="section" id="id773"> |
| <h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3> |
| <p>Linear. Performs exactly <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span></tt> comparisons for equality, and at |
| most <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a><s>::value</span></tt> insertions.</p> |
| </div> |
| <div class="section" id="id774"> |
| <h3><a class="subsection-title" href="#example" name="example">Example</a></h3> |
| <pre class="literal-block"> |
| typedef <a href="./vector.html" class="identifier">vector</a><int,float,char,float,float,double>::type types; |
| typedef <a href="./reverse-remove.html" class="identifier">reverse_remove</a>< types,float >::type result; |
| |
| <a href="./assert.html" class="identifier">BOOST_MPL_ASSERT</a>(( <a href="./equal.html" class="identifier">equal</a>< result, <a href="./vector.html" class="identifier">vector</a><double,char,int> > )); |
| </pre> |
| </div> |
| <div class="section" id="id775"> |
| <h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3> |
| <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="./remove.html">remove</a>, <a class="reference internal" href="./reverse-remove-if.html">reverse_remove_if</a>, |
| <a class="reference internal" href="./reverse-copy.html">reverse_copy</a>, <a class="reference internal" href="./transform.html">transform</a>, <a class="reference internal" href="./replace.html">replace</a></p> |
| <!-- Algorithms/Transformation Algorithms//reverse_remove_if |170 --> |
| </div> |
| </div> |
| |
| <div class="footer-separator"></div> |
| <table class="footer"><tr class="footer"><td class="header-group navigation-bar"><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Prev</a> <a href="./reverse-remove-if.html" class="navigation-link">Next</a></span><span class="navigation-group-separator"> | </span><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Back</a> <a href="./reverse-remove-if.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> |
| <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div> |
| Distributed under the Boost Software License, Version 1.0. (See accompanying |
| 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> |
| </html> |
