Demonstrating the STL vector push_back functions : vector push pop heap « vector « 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 » vector » vector push pop heap

16.20.4.Demonstrating the STL vector push_back functions

#include <iostream>

#include <cassert>

#include <vector>

#include <string>

#include <algorithm>  // for reverse

using namespace std;





int main()

{

  string s("qwer");



  vector<char> vector1(s.begin(), s.end());



  vector<char> vector2;



  vector<char>::iterator i;



  for (i = vector1.begin(); i != vector1.end(); ++i)

    vector2.push_back(*i);



  for (i = vector2.begin(); i != vector2.end(); ++i)

    cout << *i;



  return 0;

}

qwer

16.20.vector push pop heap
	16.20.1.	Perform the heapsort with push_heap and pop_heap
	16.20.2.	Using pop_back to Erase the Last Element
	16.20.3.	pop_back from a vector
	16.20.4.	Demonstrating the STL vector push_back functions

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.