Use merge with back_inserter : merge « STL Algorithms Merge « 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 / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Merge » merge

28.3.2.Use merge with back_inserter

#include <iostream>

#include <string>

#include <list>

#include <vector>

#include <algorithm>

#include <iterator>



using namespace std;



int main( ) {



   vector<string> v1, v2, v3;



   v1.push_back("a");

   v1.push_back("c");

   v1.push_back("e");



   v2.push_back("b");

   v2.push_back("d");

   v2.push_back("f");



   v3.reserve(v1.size( ) + v2.size( ) + 1);



   merge(v1.begin( ), v1.end( ),

         v2.begin( ), v2.end( ),

         back_inserter<vector<string> >(v3));



   for(int i=0;i<6;i++){

      cout << v3[i];

   }



}

abcdef"

28.3.merge
	28.3.1.	Use std::merge to merge elements in two elements into the third one in sorted order
	28.3.2.	Use merge with back_inserter
	28.3.3.	Merge two containers
	28.3.4.	sum the ranges by using merge()
	28.3.5.	Demonstrating the generic merge algorithm with an array, a list, and a deque
	28.3.6.	Generic merge algorithm: merge parts of an array and a deque, putting the result into a list

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.