📄 inplace_merge.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>inplace_merge</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>inplace_merge</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><tt>Inplace_merge</tt> is an overloaded name: there are actually two <tt>inplace_merge</tt> functions.<pre>template <class <A href="BidirectionalIterator.html">BidirectionalIterator</A>>inline void inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);template <class <A href="BidirectionalIterator.html">BidirectionalIterator</A>, class <A href="StrictWeakOrdering.html">StrictWeakOrdering</A>>inline void inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, StrictWeakOrdering comp);</pre> <h3>Description</h3><tt>Inplace_merge</tt> combines two consecutive sorted ranges <tt>[first, middle)</tt>and <tt>[middle, last)</tt> into a single sorted range <tt>[first, last)</tt>.That is, it starts with a range <tt>[first, last)</tt> that consists of two pieces each of which is in ascending order, and rearranges itso that the entire range is in ascending order. <tt>Inplace_merge</tt> isstable, meaning both thatthe relative order of elements within each input range is preserved, and that for equivalent <A href="#1">[1]</A> elements in both input ranges the elementfrom the first range precedes the element from the second.<P>The two versions of <tt>inplace_merge</tt> differ in how elements are compared.The first version uses <tt>operator<</tt>. That is, the input ranges andthe output range satisfy the condition that for every pair of iterators <tt>i</tt> and <tt>j</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>*j < *i</tt> is <tt>false</tt>.The second version uses the <A href="functors.html">function object</A> <tt>comp</tt>. That is, the input ranges and the output range satisfy the condition that for every pair of iterators <tt>i</tt> and <tt>j</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>comp(*j, *i)</tt> is <tt>false</tt>.<h3>Definition</h3>Defined in <A href="algo.h">algo.h</A>.<h3>Requirements on types</h3>For the first version:<UL><LI><tt>BidirectionalIterator</tt> is a model of <A href="BidirectionalIterator.html">Bidirectional Iterator</A>.<LI><tt>BidirectionalIterator</tt> is mutable.<LI><tt>BidirectionalIterator</tt>'s value type is a model of <A href="LessThanComparable.html">LessThan Comparable</A>.<LI>The ordering on objects of <tt>BidirectionalIterator</tt>'s value type is a <i>strict weak ordering</i>, as defined in the <A href="LessThanComparable.html">LessThan Comparable</A> requirements.</UL>For the second version:<UL><LI><tt>BidirectionalIterator</tt> is a model of <A href="BidirectionalIterator.html">Bidirectional Iterator</A>.<LI><tt>BidirectionalIterator</tt> is mutable.<LI><tt>StrictWeakOrdering</tt> is a model of <A href="StrictWeakOrdering.html">Strict Weak Ordering</A>.<LI><tt>BidirectionalIterator</tt>'s value type is convertible to <tt>StrictWeakOrdering</tt>'s argument type.</UL><h3>Preconditions</h3>For the first version:<UL><LI><tt>[first, middle)</tt> is a valid range.<LI><tt>[middle, last)</tt> is a valid range.<LI><tt>[first, middle)</tt> is in ascending order. That is, for every pair of iterators <tt>i</tt> and <tt>j</tt> in <tt>[first, middle)</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>*j < *i</tt> is <tt>false</tt>.<LI><tt>[middle, last)</tt> is in ascending order. That is, for every pair of iterators <tt>i</tt> and <tt>j</tt> in <tt>[middle, last)</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>*j < *i</tt> is <tt>false</tt>.</UL>For the second version:<UL><LI><tt>[first, middle)</tt> is a valid range.<LI><tt>[middle, last)</tt> is a valid range.<LI><tt>[first, middle)</tt> is in ascending order. That is, for every pair of iterators <tt>i</tt> and <tt>j</tt> in <tt>[first, middle)</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>comp(*j, *i)</tt> is <tt>false</tt>.<LI><tt>[middle, last)</tt> is in ascending order. That is, for every pair of iterators <tt>i</tt> and <tt>j</tt> in <tt>[middle, last)</tt> such that <tt>i</tt> precedes <tt>j</tt>, <tt>comp(*j, *i)</tt> is <tt>false</tt>.</UL><h3>Complexity</h3><tt>Inplace_merge</tt> is an <i>adaptive</i> algorithm: it attempts toallocate a temporary memory buffer, and its run-time complexity dependson how much memory is available. <tt>Inplace_merge</tt> performs no comparisons if<tt>[first, last)</tt> is an empty range. Otherwise, worst-case behavior (if no auxiliary memory is available) is<tt>O(N log(N))</tt>, where <tt>N</tt> is <tt>last - first</tt>,and best case (if a large enough auxiliary memory buffer is available) isat most <tt>(last - first) - 1</tt> comparisons.<h3>Example</h3><pre>int main(){ int A[] = { 1, 3, 5, 7, 2, 4, 6, 8 }; inplace_merge(A, A + 4, A + 8); copy(A, A + 8, ostream_iterator<int>(cout, " ")); // The output is "1 2 3 4 5 6 7 8".}</pre><h3>Notes</h3><P><A name="1">[1]</A>Note that you may use an ordering that is a strict weak orderingbut not a total ordering; that is, there might be values <tt>x</tt> and <tt>y</tt>such that <tt>x < y</tt>, <tt>x > y</tt>, and <tt>x == y</tt> are all false. (See the<A href="LessThanComparable.html">LessThan Comparable</A> requirements for a fuller discussion.)Two elements <tt>x</tt> and <tt>y</tt> are <i>equivalent</i> if neither <tt>x < y</tt> nor<tt>y < x</tt>. If you're using a total ordering, however (if you'reusing <tt>strcmp</tt>, for example, or if you're using ordinary arithmeticcomparison on integers), then you can ignore this technicaldistinction: for a total ordering, equality and equivalence arethe same.<h3>See also</h3><tt><A href="merge.html">merge</A></tt>, <tt><A href="set_union.html">set_union</A></tt>, <tt><A href="sort.html">sort</A></tt><!-- 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 + -