Microsoft KB Archive/158002

= STL Sample for the Predicate Version of partial_sort Function =

Article ID: 158002

Article Last Modified on 12/10/2003

-

APPLIES TO

 The Standard C++ Library, when used with:  Microsoft Visual C++ 4.2 Professional Edition

 Microsoft Visual C++ 4.2 Enterprise Edition

 Microsoft Visual C++ 5.0 Learning Edition 

-

<div class="notice_section">

This article was previously published under Q158002

<div class="summary_section">

SUMMARY
The sample code below illustrates how to use the predicate version of partial_sort STL function in Visual C++.

<div class="moreinformation_section">

Prototype
template<class RandomAccessIterator, class Compare> inline void partial_sort(RandomAccessIterator first,                    RandomAccessIterator middle,                     RandomAccessIterator last,                     Compare compare) NOTE: The class/parameter names in the prototype do not match the original version in the header file. Some have been modified to improve readability.

Description
The partial_sort algorithm sorts the smallest N elements, where N = middle - first of the sequence [first, last). The remaining elements end up in the range [middle..last) in an undefined order.

The predicate version of partial_sort uses the compare function for comparisons.

Sample Code
////////////////////////////////////////////////////////////////////// // // Compile options needed: /GX // // partial_sort.cpp : Illustrates how to use the predicate version //                   of the partial_sort function. // // Functions: // //   partial_sort : Sort the smallest N elements in a sequence. // // Written by Kalindi Sanghrajka // of Microsoft Product Support Services, // Software Core Developer Support. // Copyright (c) 1996 Microsoft Corporation. All rights reserved. //////////////////////////////////////////////////////////////////////

// disable warning C4786: symbol greater than 255 character, // okay to ignore
 * 1) pragma warning(disable: 4786)

using namespace std;
 * 1) include
 * 2) include
 * 3) include
 * 4) include <BR/>

void main {   const int VECTOR_SIZE = 8 ;

// Define a template class vector of int typedef vector<int, allocator > IntVector ;

//Define an iterator for template class vector of strings typedef IntVector::iterator IntVectorIt ;

IntVector Numbers(VECTOR_SIZE) ;

IntVectorIt start, end, it ;

// Initialize vector Numbers Numbers[0] = 4 ; Numbers[1] = 10; Numbers[2] = 70 ; Numbers[3] = 30 ; Numbers[4] = 10; Numbers[5] = 69 ; Numbers[6] = 96 ; Numbers[7] = 7;

start = Numbers.begin ;  // location of first // element of Numbers

end = Numbers.end ;      // one past the location // last element of Numbers

cout << "Before calling partial_sort\n" << endl ;

// print content of Numbers cout << "Numbers { " ; for(it = start; it != end; it++) cout << *it << " " ; cout << " }\n" << endl ;

// sort the smallest 4 elements in the sequence partial_sort(start, start+4, end, less ) ;

cout << "After calling partial_sort\n" << endl ;

cout << "Numbers { " ; for(it = start; it != end; it++) cout << *it << " " ; cout << " }\n" << endl ; }

Program Output is:

Before calling partial_sort

Numbers { 4 10 70 30 10 69 96 7 }

After calling partial_sort

Numbers { 4 7 10 10 70 69 96 30 }

<div class="references_section">