]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/mpl/doc/refmanual/reverse-remove.html
add subtree-ish sources for 12.0.3
[ceph.git] / ceph / src / boost / libs / mpl / doc / refmanual / reverse-remove.html
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_remove</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-replace-if.html" class="navigation-link">Prev</a>&nbsp;<a href="./reverse-remove-if.html" class="navigation-link">Next</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Back</a>&nbsp;<a href="./reverse-remove-if.html" class="navigation-link">Along</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./transformation-algorithms.html" class="navigation-link">Up</a>&nbsp;<a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</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-remove.html" class="navigation-link">reverse_remove</a></td>
13 </tr></table><div class="header-separator"></div>
14 <div class="section" id="reverse-remove">
15 <h1><a class="toc-backref" href="./transformation-algorithms.html#id1503">reverse_remove</a></h1>
16 <div class="section" id="id767">
17 <h3><a class="subsection-title" href="#synopsis" name="synopsis">Synopsis</a></h3>
18 <pre class="literal-block">
19 template&lt;
20 typename Sequence
21 , typename T
22 , typename In = <em>unspecified</em>
23 &gt;
24 struct <a href="./reverse-remove.html" class="identifier">reverse_remove</a>
25 {
26 typedef <em>unspecified</em> type;
27 };
28 </pre>
29 </div>
30 <div class="section" id="id768">
31 <h3><a class="subsection-title" href="#description" name="description">Description</a></h3>
32 <p>Returns a new sequence that contains all elements from [<tt class="literal"><span class="pre"><a href="./begin.html" class="identifier">begin</a>&lt;Sequence&gt;::type</span></tt>, <tt class="literal"><span class="pre"><a href="./end.html" class="identifier">end</a>&lt;Sequence&gt;::type</span></tt>)
33 range in reverse order except those that are identical to <tt class="literal"><span class="pre">T</span></tt>.</p>
34 <p>[<em>Note:</em> This wording applies to a no-inserter version(s) of the algorithm. See the
35 <cite>Expression semantics</cite> subsection for a precise specification of the algorithm's
36 details in all cases — <em>end note</em>]</p>
37 </div>
38 <div class="section" id="id769">
39 <h3><a class="subsection-title" href="#header" name="header">Header</a></h3>
40 <pre class="literal-block">
41 #include &lt;<a href="../../../../boost/mpl/remove.hpp" class="header">boost/mpl/remove.hpp</a>&gt;
42 </pre>
43 </div>
44 <div class="section" id="id770">
45 <h3><a class="subsection-title" href="#model-of" name="model-of">Model of</a></h3>
46 <p><a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a></p>
47 </div>
48 <div class="section" id="id771">
49 <h3><a class="subsection-title" href="#parameters" name="parameters">Parameters</a></h3>
50 <table border="1" class="docutils table">
51 <colgroup>
52 <col width="19%" />
53 <col width="43%" />
54 <col width="38%" />
55 </colgroup>
56 <thead valign="bottom">
57 <tr><th class="head">Parameter</th>
58 <th class="head">Requirement</th>
59 <th class="head">Description</th>
60 </tr>
61 </thead>
62 <tbody valign="top">
63 <tr><td><tt class="literal"><span class="pre">Sequence</span></tt></td>
64 <td><a class="reference internal" href="./forward-sequence.html">Forward Sequence</a></td>
65 <td>An original sequence.</td>
66 </tr>
67 <tr><td><tt class="literal"><span class="pre">T</span></tt></td>
68 <td>Any type</td>
69 <td>A type to be removed.</td>
70 </tr>
71 <tr><td><tt class="literal"><span class="pre">In</span></tt></td>
72 <td><a class="reference internal" href="./inserter.html">Inserter</a></td>
73 <td>An inserter.</td>
74 </tr>
75 </tbody>
76 </table>
77 </div>
78 <div class="section" id="id772">
79 <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3>
80 <p>The semantics of an expression are defined only
81 where they differ from, or are not defined in <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>.</p>
82 <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>
83 <pre class="literal-block">
84 typedef <a href="./reverse-remove.html" class="identifier">reverse_remove</a>&lt;s,x,in&gt;::type r;
85 </pre>
86 <table class="docutils field-list" frame="void" rules="none">
87 <col class="field-name" />
88 <col class="field-body" />
89 <tbody valign="top">
90 <tr class="field"><th class="field-name">Return type:</th><td class="field-body"><p class="first">A type.</p>
91 </td>
92 </tr>
93 <tr class="field"><th class="field-name">Semantics:</th><td class="field-body"><p class="first">Equivalent to</p>
94 <pre class="last literal-block">
95 typedef <a href="./reverse-remove-if.html" class="identifier">reverse_remove_if</a>&lt; s,is_same&lt;_,x&gt;,in &gt;::type r;
96 </pre>
97 </td>
98 </tr>
99 </tbody>
100 </table>
101 </div>
102 <div class="section" id="id773">
103 <h3><a class="subsection-title" href="#complexity" name="complexity">Complexity</a></h3>
104 <p>Linear. Performs exactly <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a>&lt;s&gt;::value</span></tt> comparisons for equality, and at
105 most <tt class="literal"><span class="pre"><a href="./size.html" class="identifier">size</a>&lt;s&gt;::value</span></tt> insertions.</p>
106 </div>
107 <div class="section" id="id774">
108 <h3><a class="subsection-title" href="#example" name="example">Example</a></h3>
109 <pre class="literal-block">
110 typedef <a href="./vector.html" class="identifier">vector</a>&lt;int,float,char,float,float,double&gt;::type types;
111 typedef <a href="./reverse-remove.html" class="identifier">reverse_remove</a>&lt; types,float &gt;::type result;
112
113 <a href="./assert.html" class="identifier">BOOST_MPL_ASSERT</a>(( <a href="./equal.html" class="identifier">equal</a>&lt; result, <a href="./vector.html" class="identifier">vector</a>&lt;double,char,int&gt; > ));
114 </pre>
115 </div>
116 <div class="section" id="id775">
117 <h3><a class="subsection-title" href="#see-also" name="see-also">See also</a></h3>
118 <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>,
119 <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>
120 <!-- Algorithms/Transformation Algorithms//reverse_remove_if |170 -->
121 </div>
122 </div>
123
124 <div class="footer-separator"></div>
125 <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>&nbsp;<a href="./reverse-remove-if.html" class="navigation-link">Next</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./reverse-replace-if.html" class="navigation-link">Back</a>&nbsp;<a href="./reverse-remove-if.html" class="navigation-link">Along</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./transformation-algorithms.html" class="navigation-link">Up</a>&nbsp;<a href="../refmanual.html" class="navigation-link">Home</a></span><span class="navigation-group-separator">&nbsp;|&nbsp;</span><span class="navigation-group"><a href="./refmanual_toc.html" class="navigation-link">Full TOC</a></span></td>
126 <td><div class="copyright-footer"><div class="copyright">Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams</div>
127 Distributed under the Boost Software License, Version 1.0. (See accompanying
128 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>
129 </html>