Initialize deque with 26 copies of the letter x : deque « deque « 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 » deque » deque

22.1.5.Initialize deque with 26 copies of the letter x

#include <iostream>

#include <cassert>

#include <list>

#include <deque>

#include <algorithm>  // For merge

using namespace std;



int main()

{

  // Initialize deque1 with 26 copies of the letter x:

  deque<char> deque1(26, 'x');



  deque<char>::iterator i;



  cout.precision(10);



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

    cout << *i << endl;



  return 0;

}

x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x

22.1.deque
	22.1.1.	Use generic deque to store integers
	22.1.2.	deque for char type
	22.1.3.	Use generic deque to store chars
	22.1.4.	Use generic deque to store strings
	22.1.5.	Initialize deque with 26 copies of the letter x
	22.1.6.	Create another deque that contains a subrange of dq
	22.1.7.	create a deque
	22.1.8.	Use std::copy to print out all elements in a deque
	22.1.9.	deque.push_back( value )
	22.1.10.	deque.push_front( value )
	22.1.11.	Create your own stack based on deque
	22.1.12.	Constructing a Container with Values from the Standard Input
	22.1.13.	Combine insert and end to add elements to a deque

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.