| <!-- |
| Licensed to the Apache Software Foundation (ASF) under one or more |
| contributor license agreements. See the NOTICE file distributed |
| with this work for additional information regarding copyright |
| ownership. The ASF licenses this file to you under the Apache |
| License, Version 2.0 (the License); you may not use this file |
| except in compliance with the License. You may obtain a copy of |
| the License at |
| |
| http://www.apache.org/licenses/LICENSE-2.0 |
| |
| Unless required by applicable law or agreed to in writing, software |
| distributed under the License is distributed on an "AS IS" BASIS, |
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or |
| implied. See the License for the specific language governing |
| permissions and limitations under the License. |
| |
| Copyright 1999-2007 Rogue Wave Software, Inc. |
| --> |
| |
| <HTML> |
| <HEAD> |
| <TITLE>partial_sort_copy()</TITLE> |
| <LINK REL=StyleSheet HREF="../rw.css" TYPE="text/css" TITLE="Apache stdcxx Stylesheet"></HEAD> |
| <BODY BGCOLOR=#FFFFFF> |
| <A HREF="partial-sort.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="partial-sum.html"><IMG SRC="images/bnext.gif" WIDTH=25 HEIGHT=21 ALT="Next file" BORDER=O></A><DIV CLASS="DOCUMENTNAME"><B>Apache C++ Standard Library Reference Guide</B></DIV> |
| <H2>partial_sort_copy()</H2> |
| <P><B>Library:</B> <A HREF="2-9.html">Algorithms</A></P> |
| |
| <PRE><HR><B><I>Function</I></B><HR></PRE> |
| |
| <UL> |
| <LI><A HREF="#sec1">Local Index</A></LI> |
| <LI><A HREF="#sec2">Summary</A></LI> |
| <LI><A HREF="#sec3">Synopsis</A></LI> |
| <LI><A HREF="#sec4">Description</A></LI> |
| <LI><A HREF="#sec5">Complexity</A></LI> |
| <LI><A HREF="#sec6">Example</A></LI> |
| <LI><A HREF="#sec7">See Also</A></LI> |
| <LI><A HREF="#sec8">Standards Conformance</A></LI> |
| </UL> |
| <A NAME="sec1"><H3>Local Index</H3></A> |
| No Entries |
| <A NAME="sec2"><H3>Summary</H3></A> |
| <P>Templatized algorithm for sorting collections of entities</P> |
| <A NAME="sec3"><H3>Synopsis</H3></A> |
| |
| <PRE>#include <algorithm> |
| |
| namespace std { |
| template <class InputIterator, |
| class RandomAccessIterator> |
| void partial_sort_copy(InputIterator start, |
| InputIterator finish, |
| RandomAccessIterator result_start, |
| RandomAccessIterator result_finish); |
| template <class InputIterator, |
| class RandomAccessIterator, |
| class Compare> |
| void partial_sort_copy(InputIterator start, |
| InputIterator finish, |
| RandomAccessIterator result_start, |
| RandomAccessIterator result_finish, |
| Compare comp); |
| } |
| </PRE> |
| <A NAME="sec4"><H3>Description</H3></A> |
| <P>The <SAMP>partial_sort_copy()</SAMP> algorithm places the smaller of <SAMP>finish - start</SAMP> and <SAMP>result_finish - result_start</SAMP> sorted elements from the range <SAMP>[start, finish)</SAMP> into the range beginning at <SAMP>result_start</SAMP> (in other words, the range: <SAMP>[result_start, result_start+min(finish - start, result_finish - result_start)</SAMP>). The effect is as if the range <SAMP>[start,finish)</SAMP> were placed in a temporary buffer, sorted, and then as many elements as possible copied into the range <SAMP>[result_start, result_finish)</SAMP>.</P> |
| <P>The first version of the algorithm uses <SAMP>operator<()</SAMP> as the comparison operator for the sort. The second version uses the function object <SAMP>comp.</SAMP></P> |
| <A NAME="sec5"><H3>Complexity</H3></A> |
| <P><SAMP>partial_sort_copy()</SAMP> does approximately<SAMP> (finish-start) * log(min(finish-start, result_finish-result_start))</SAMP> comparisons.</P> |
| <A NAME="sec6"><H3>Example</H3></A> |
| |
| <UL><PRE>// |
| // partsort.cpp |
| // |
| |
| #include <algorithm> // for partial_sort |
| #include <iostream> // for cout, endl |
| #include <iterator> // for ostream_iterator |
| #include <vector> // for vector |
| |
| |
| |
| int main() |
| { |
| typedef std::vector<int, std::allocator<int> > Vector; |
| |
| typedef std::ostream_iterator<int, char, |
| std::char_traits<char> > |
| Iter; |
| |
| const Vector::value_type a[] = { |
| 17, 3, 5, -4, 1, 12, -10, -1, 14, 7, |
| -6, 8, 15, -11, 2, -2, 18, 4, -3, 0 |
| }; |
| |
| Vector v1 (a + 0, a + sizeof a / sizeof *a); |
| |
| // Output original vector. |
| std::cout << "For the vector: "; |
| std::copy (v1.begin (), v1.end (), Iter (std::cout, " ")); |
| |
| // Partial sort the first seven elements. |
| std::partial_sort (v1.begin (), v1.begin () + 7, |
| v1.end ()); |
| |
| // Output result. |
| std::cout << "\n\nA partial_sort of seven elements " |
| << "gives: \n "; |
| std::copy (v1.begin (), v1.end (), Iter (std::cout, " ")); |
| std::cout << std::endl; |
| |
| // A vector of ten elements. |
| Vector v2 (Vector::size_type (10), 0); |
| |
| // Sort the last ten elements in v1 into v2. |
| std::partial_sort_copy (v1.begin () + 10, v1.end (), |
| v2.begin (), v2.end ()); |
| |
| // Output result. |
| std::cout |
| << "\nA partial_sort_copy of the last ten elements " |
| << "gives: \n "; |
| std::copy (v2.begin (), v2.end (), Iter (std::cout, " ")); |
| |
| std::cout << std::endl; |
| |
| return 0; |
| } |
| |
| |
| Program Output: |
| |
| For the vector: 17 3 5 -4 1 12 -10 -1 14 7 -6 8 15 -11 2 -2 |
| 18 4 -3 0 |
| |
| A partial_sort of seven elements gives: |
| -11 -10 -6 -4 -3 -2 -1 17 14 12 7 8 15 5 3 2 18 4 1 0 |
| |
| A partial_sort_copy of the last ten elements gives: |
| 0 1 2 3 4 5 7 8 15 18 |
| </PRE></UL> |
| <UL><PRE></PRE></UL> |
| <A NAME="sec7"><H3>See Also</H3></A> |
| <P><SAMP><A HREF="sort.html">sort()</A></SAMP>¸ <SAMP><A HREF="stable-sort.html">stable_sort()</A></SAMP>, <SAMP><A HREF="partial-sort.html">partial_sort()</A></SAMP></P> |
| <A NAME="sec8"><H3>Standards Conformance</H3></A> |
| <P><I>ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.3.1.4</I></P> |
| |
| <BR> |
| <HR> |
| <A HREF="partial-sort.html"><IMG SRC="images/bprev.gif" WIDTH=20 HEIGHT=21 ALT="Previous file" BORDER=O></A><A HREF="noframes.html"><IMG SRC="images/btop.gif" WIDTH=56 HEIGHT=21 ALT="Top of Document" BORDER=O></A><A HREF="booktoc.html"><IMG SRC="images/btoc.gif" WIDTH=56 HEIGHT=21 ALT="Contents" BORDER=O></A><A HREF="tindex.html"><IMG SRC="images/bindex.gif" WIDTH=56 HEIGHT=21 ALT="Index page" BORDER=O></A><A HREF="partial-sum.html"><IMG SRC="images/bnext.gif" WIDTH=20 HEIGHT=21 ALT="Next file" BORDER=O></A> |
| |
| <!-- Google Analytics tracking code --> |
| <script src="http://www.google-analytics.com/urchin.js" type="text/javascript"> |
| </script> |
| <script type="text/javascript"> |
| _uacct = "UA-1775151-1"; |
| urchinTracker(); |
| </script> |
| <!-- end of Google Analytics tracking code --> |
| |
| </BODY> |
| </HTML> |
