Use indexer to add elements to a deque : deque subscript indexer « 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 subscript indexer

22.11.1.Use indexer to add elements to a deque

#include <iostream>

#include <cassert>

#include <algorithm>

#include <vector>

#include <deque>

using namespace std;



int main()

{



  deque<int>  deque1(5);



  for (int i = 0; i < 5; ++i)

    deque1[i] = i + 5;



  deque<int>::iterator pos;



  for (pos=deque1.begin(); pos!=deque1.end(); ++pos) {

        cout << *pos << ' ';

  }



  return 0;

}

5 6 7 8 9 "

22.11.deque subscript indexer
	22.11.1.	Use indexer to add elements to a deque
	22.11.2.	Use subscript operator to modify element at location 1
	22.11.3.	Use subscript operator to obtain elements of values
	22.11.4.	Print out a deque, reference its content by index,
	22.11.5.	Change the values of some of deque's elements
	22.11.6.	Insert 'value' into every element but the first

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.