📄 back_insert_iterator.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>back_insert_iterator<BackInsertionSequence></Title><!-- Generated by htmldoc --></HEAD><BODY TEXT="#000000" LINK="#006600" ALINK="#003300" VLINK="#7C7F87" BGCOLOR="#FFFFFF"><A HREF="/"><IMG SRC="/images/common/sgilogo_small.gif" ALT="SGI Logo" WIDTH="80" HEIGHT="72" BORDER="0"></A><P><!--end header--><BR Clear><H1>back_insert_iterator<BackInsertionSequence></H1><Table CellPadding=0 CellSpacing=0 width=100%><TR><TD Align=left><Img src = "iterators.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD><TD Align=right><Img src = "type.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR><TR><TD Align=left><Img src = "adaptors.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD><TD Align=right></TD></TR><TR><TD Align=left VAlign=top><b>Categories</b>: iterators, adaptors</TD><TD Align=right VAlign=top><b>Component type</b>: type</TD></TR></Table><h3>Description</h3><tt>Back_insert_iterator</tt> is an iterator adaptor that functions as an<A href="OutputIterator.html">Output Iterator</A>: assignment through a <tt>back_insert_iterator</tt> insertsan object after the last element of a <A href="BackInsertionSequence.html">Back Insertion Sequence</A>. <A href="#1">[1]</A><h3>Example</h3><pre><A href="List.html">list</A><int> L;L.push_front(3);back_insert_iterator<<A href="List.html">list</A><int> > ii(L);*ii++ = 0;*ii++ = 1;*ii++ = 2;<A href="copy.html">copy</A>(L.begin(), L.end(), <A href="ostream_iterator.html">ostream_iterator</A><int>(cout, " "));// The values that are printed are 3 0 1 2</pre><h3>Definition</h3>Defined in the standard header <A href="iterator">iterator</A>, and in the nonstandardbackward-compatibility header <A href="iterator.h">iterator.h</A>.<h3>Template parameters</h3><Table border><TR><TH>Parameter</TH><TH>Description</TH><TH>Default</TH></TR><TR><TD VAlign=top><tt>BackInsertionSequence</tt></TD><TD VAlign=top>The type of <A href="BackInsertionSequence.html">Back Insertion Sequence</A> into which values will be inserted.</TD><TD VAlign=top> </TD></tr></table><h3>Model of</h3><A href="OutputIterator.html">Output Iterator</A>. An insert iterator's set of value types (asdefined in the <A href="OutputIterator.html">Output Iterator</A> requirements) consists ofa single type: <tt><A href="BackInsertionSequence.html">BackInsertionSequence</A>::value_type</tt>.<h3>Type requirements</h3>The template parameter <tt>BackInsertionSequence</tt> must be a <A href="BackInsertionSequence.html">Back Insertion Sequence</A>.<h3>Public base classes</h3>None.<h3>Members</h3><Table border><TR><TH>Member</TH><TH>Where defined</TH><TH>Description</TH></TR><TR><TD VAlign=top><tt>back_insert_iterator(BackInsertionSequence&)</tt></TD><TD VAlign=top><tt>back_insert_iterator</tt></TD><TD VAlign=top>See below.</TD></TR><TR><TD VAlign=top><tt>back_insert_iterator(const back_insert_iterator&)</tt></TD><TD VAlign=top> <A href="trivial.html">Trivial Iterator</A></TD><TD VAlign=top>The copy constructor</TD></TR><TR><TD VAlign=top><pre>back_insert_iterator& operator=(const back_insert_iterator&)</pre></TD><TD VAlign=top> <A href="trivial.html">Trivial Iterator</A></TD><TD VAlign=top>The assignment operator</TD></TR><TR><TD VAlign=top><tt>back_insert_iterator& operator*()</tt></TD><TD VAlign=top> <A href="OutputIterator.html">Output Iterator</A></TD><TD VAlign=top>Used to implement the <A href="OutputIterator.html">output iterator</A> expression <tt>*i = x</tt>. <A href="#2">[2]</A></TD></TR><TR><TD VAlign=top><pre>back_insert_iterator& operator=(const BackInsertionSequence::value_type&)</pre></TD><TD VAlign=top> <A href="OutputIterator.html">Output Iterator</A></TD><TD VAlign=top>Used to implement the <A href="OutputIterator.html">output iterator</A> expression <tt>*i = x</tt>. <A href="#2">[2]</A></TD></TR><TR><TD VAlign=top><tt>back_insert_iterator& operator++()</tt></TD><TD VAlign=top> <A href="OutputIterator.html">Output Iterator</A></TD><TD VAlign=top>Preincrement.</TD></TR><TR><TD VAlign=top><tt>back_insert_iterator& operator++(int)</tt></TD><TD VAlign=top> <A href="OutputIterator.html">Output Iterator</A></TD><TD VAlign=top>Postincrement.</TD></TR><TR><TD VAlign=top><pre>output_iterator_tag iterator_category(const back_insert_iterator&)</pre></TD><TD VAlign=top> <A href="iterator_tags.html">iterator tags</A></TD><TD VAlign=top>Returns the iterator's category. This is a global function, not a member.</TD></TR><TR><TD VAlign=top><pre>template<class BackInsertionSequence>back_insert_iterator<BackInsertionSequence>back_inserter(BackInsertionSequence& S)</pre></TD><TD VAlign=top><tt>back_insert_iterator</tt></TD><TD VAlign=top>See below.</TD></tr></table><h3>New members</h3>These members are not defined in the <A href="OutputIterator.html">Output Iterator</A> requirements,but are specific to <tt>back_insert_iterator</tt>.<Table border><TR><TH>Member function</TH><TH>Description</TH></TR><TR><TD VAlign=top><tt>back_insert_iterator(BackInsertionSequence& S)</tt></TD><TD VAlign=top>Constructs a <tt>back_insert_iterator</tt> that inserts objects after the last element of <tt>S</tt>. (That is, it inserts objects just before <tt>S</tt>'s past-the-end iterator.)</TD></TR><TR><TD VAlign=top><pre>template<class BackInsertionSequence>back_insert_iterator<BackInsertionSequence>back_inserter(BackInsertionSequence& S);</pre></TD><TD VAlign=top>Equivalent to <tt>back_insert_iterator<BackInsertionSequence>(S)</tt>. <A href="#3">[3]</A> This is a global function, not a member function.</TD></tr></table><h3>Notes</h3><P><A name="1">[1]</A>Note the difference between assignment through a<tt><A href="BackInsertionSequence.html">BackInsertionSequence</A>::iterator</tt> and assignment through a<tt>back_insert_iterator<<A href="BackInsertionSequence.html">BackInsertionSequence</A>></tt>. If <tt>i</tt> is a valid<tt><A href="BackInsertionSequence.html">BackInsertionSequence</A>::iterator</tt>, then it points to some particularelement in the <A href="BackInsertionSequence.html">back insertion sequence</A>; the expression <tt>*i = t</tt> replaces that element with <tt>t</tt>, and does not change the total numberof elements in the <A href="BackInsertionSequence.html">back insertion sequence</A>. If <tt>ii</tt> is a valid<tt>back_insert_iterator<<A href="BackInsertionSequence.html">BackInsertionSequence</A>></tt>, however, then the expression <tt>*ii = t</tt> is equivalent, to the expression <tt>seq.push_back(t)</tt>. That is, it does not overwriteany of <tt>seq</tt>'s elements and it does change <tt>seq</tt>'s size.<P><A name="2">[2]</A>Note how assignment through a <tt>back_insert_iterator</tt> is implemented.In general, unary <tt>operator*</tt> must be defined so that it returns aproxy object, where the proxy object defines <tt>operator=</tt> to performthe insert operation. In this case, for the sake of simplicity, theproxy object is the <tt>back_insert_iterator</tt> itself. That is, <tt>*i</tt> simplyreturns <tt>i</tt>, and <tt>*i = t</tt> is equivalent to <tt>i = t</tt>. You should not,however, rely on this behavior. It is an implementation detail,and it is not guaranteed to remain the same in future versions.<P><A name="3">[3]</A>This function exists solely for the sake of convenience:since it is a non-member function, the template parameters may beinferred and the type of the <tt>back_insert_iterator</tt> need not be declaredexplicitly. One easy way to reverse a range and insert itat the end of a <A href="BackInsertionSequence.html">Back Insertion Sequence</A> <tt>S</tt>, for example, is<tt><A href="reverse_copy.html">reverse_copy</A>(first, last, back_inserter(S))</tt>.<h3>See also</h3><A href="insert_iterator.html">insert_iterator</A>, <A href="front_insert_iterator.html">front_insert_iterator</A>, <A href="OutputIterator.html">Output Iterator</A>,<A href="BackInsertionSequence.html">Back Insertion Sequence</A>, <A href="Sequence.html">Sequence</A>, <A href="Iterators.html">Iterator overview</A><!-- start footer --><!-- Footer Begins --><STYLE TYPE="text/css"><!--TD.footer, TD.footer A{ font-family: Arial, helvetica, sans-serif; font-size: 8pt;}A.home {font-family: Arial, helvetica, sans-serif;}--></STYLE><P><A CLASS="home" HREF="index.html">STL Home</A><P><TABLE WIDTH="600" CELLPADDING="0" CELLPADDING="0" BORDER="0"> <TR> <TD ALIGN="RIGHT" CLASS="footer"><A HREF="/company_info/terms.html" TARGET="_top">terms of use</A> | <A HREF="/company_info/privacy.html" TARGET="_top">privacy policy</A></TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/cgi-bin/feedback/" TARGET="_top">contact us</A></TD> </TR><TR> <TD ALIGN="RIGHT" CLASS="footer">Copyright © 1993-2003 Silicon Graphics, Inc. All rights reserved.</TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/company_info/trademarks/" TARGET="_top">Trademark Information</A></TD> </TR></TABLE><!-- Footer Ends --><!-- end footer --><P></BODY></HTML> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -