📄 remove.html
字号:
<HTML><!-- -- Copyright (c) 1996-1999 -- Silicon Graphics Computer Systems, Inc. -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Silicon Graphics makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- -- Copyright (c) 1994 -- Hewlett-Packard Company -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Hewlett-Packard Company makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- --><Head><Title>remove</Title><!-- Generated by htmldoc --></HEAD><BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" ALINK="#ff0000"> <IMG SRC="CorpID.gif" ALT="SGI" HEIGHT="43" WIDTH="151"> <!--end header--><BR Clear><H1>remove</H1><Table CellPadding=0 CellSpacing=0 width=100%><TR><TD Align=left><Img src = "algorithms.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD><TD Align=right><Img src = "function.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR><TR><TD Align=left VAlign=top><b>Category</b>: algorithms</TD><TD Align=right VAlign=top><b>Component type</b>: function</TD></TR></Table><h3>Prototype</h3><pre>template <class <A href="ForwardIterator.html">ForwardIterator</A>, class T>ForwardIterator remove(ForwardIterator first, ForwardIterator last, const T& value);</pre> <h3>Description</h3><tt>Remove</tt> removes from the range <tt>[first, last)</tt> all elements thatare equal to <tt>value</tt>. That is, <tt>remove</tt> returns an iterator<tt>new_last</tt> such that the range <tt>[first, new_last)</tt> contains noelements equal to <tt>value</tt>. <A href="#1">[1]</A> The iterators in the range <tt>[new_last, last)</tt> are all still dereferenceable, but the elementsthat they point to are unspecified. <tt>Remove</tt> is stable, meaningthat the relative order of elements that are not equal to<tt>value</tt> is unchanged.<h3>Definition</h3>Defined in the standard header <A href="algorithm">algorithm</A>, and in the nonstandardbackward-compatibility header <A href="algo.h">algo.h</A>.<h3>Requirements on types</h3><UL><LI><tt>ForwardIterator</tt> is a model of <A href="ForwardIterator.html">Forward Iterator</A>.<LI><tt>ForwardIterator</tt> is mutable.<LI><tt>T</tt> is a model of <A href="EqualityComparable.html">Equality Comparable</A>.<LI>Objects of type <tt>T</tt> can be compared for equality with objects of <tt>ForwardIterator</tt>'s value type.</UL><h3>Preconditions</h3><UL><LI><tt>[first, last)</tt> is a valid range.</UL><h3>Complexity</h3>Linear. <tt>Remove</tt> performs exactly <tt>last - first</tt> comparisons for equality.<h3>Example</h3><pre><A href="Vector.html">vector</A><int> V;V.push_back(3);V.push_back(1);V.push_back(4);V.push_back(1);V.push_back(5);V.push_back(9);<A href="copy.html">copy</A>(V.begin(), V.end(), <A href="ostream_iterator.html">ostream_iterator</A><int>(cout, " ")); // The output is "3 1 4 1 5 9".vector<int>::iterator new_end = remove(V.begin(), V.end(), 1);<A href="copy.html">copy</A>(V.begin(), new_end, <A href="ostream_iterator.html">ostream_iterator</A><int>(cout, " ")); // The output is "3 4 5 9".</pre><h3>Notes</h3><P><A name="1">[1]</A>The meaning of "removal" is somewhat subtle. <tt>Remove</tt>does not destroy any iterators, and does not change the distancebetween <tt>first</tt> and <tt>last</tt>. (There's no way that it could do anythingof the sort.) So, for example, if <tt>V</tt> is a <A href="Vector.html">vector</A>,<tt>remove(V.begin(), V.end(), 0)</tt> does not change <tt>V.size()</tt>: <tt>V</tt> willcontain just as many elements as it did before. <tt>Remove</tt> returns aniterator that points to the end of the resulting range after elementshave been removed from it; it follows that the elements after thatiterator are of no interest, and may be discarded. If you areremoving elements from a <A href="Sequence.html">Sequence</A>, you may simply erase them.That is, a reasonable way of removing elements from a <A href="Sequence.html">Sequence</A>is <tt>S.erase(remove(S.begin(), S.end(), x), S.end())</tt>.<h3>See also</h3><tt><A href="remove_if.html">remove_if</A></tt>, <tt><A href="remove_copy.html">remove_copy</A></tt>, <tt><A href="remove_copy_if.html">remove_copy_if</A></tt>,<tt><A href="unique.html">unique</A></tt>, <tt><A href="unique_copy.html">unique_copy</A></tt>.<!--start footer--> <HR SIZE="6"><A href="http://www.sgi.com/"><IMG SRC="surf.gif" HEIGHT="54" WIDTH="54" ALT="[Silicon Surf]"></A><A HREF="index.html"><IMG SRC="stl_home.gif" HEIGHT="54" WIDTH="54" ALT="[STL Home]"></A><BR><FONT SIZE="-2"><A href="http://www.sgi.com/Misc/sgi_info.html" TARGET="_top">Copyright © 1999 Silicon Graphics, Inc.</A> All Rights Reserved.</FONT><FONT SIZE="-3"><a href="http://www.sgi.com/Misc/external.list.html" TARGET="_top">TrademarkInformation</A></FONT><P></BODY></HTML> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -