use stable_partition on the vecCopy - maintains relative order : partition « STL Algorithms Modifying sequence operations

use stable_partition on the vecCopy - maintains relative order : partition « STL Algorithms Modifying sequence operations « C++ Tutorial

Home

C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C++ Tutorial » STL Algorithms Modifying sequence operations » partition

24.6.2.use stable_partition on the vecCopy - maintains relative order

#include <algorithm>

#include <vector>

#include <iostream>

using namespace std;

bool IsEven (const int& nNumber)

{

    return ((nNumber % 2) == 0);

}



int main ()

{

    vector <int> v;



    for (int nNum = 0; nNum < 10; ++ nNum)

        v.push_back (nNum);



    // a copy of the sample vector

    vector <int> vecCopy (v);



    // use stable_partition on the vecCopy - maintains relative order

    stable_partition (vecCopy.begin (), vecCopy.end (), IsEven);



    for (size_t nItem = 0; nItem < vecCopy.size (); ++ nItem)

        cout << vecCopy [nItem] << ' ';



    return 0;

}

24.6.partition
	24.6.1.	Use stable_partition and partition
	24.6.2.	use stable_partition on the vecCopy - maintains relative order

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.