Use generic deque to store integers : deque « Deque « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » Deque » deque

Screenshots

Use generic deque to store integers

  

 



#include <iostream>

#include <cassert>

#include <deque>

#include <algorithm>  // For find

using namespace std;





int main()

{

  int x[5] = {1, 2, 3, 4, 5};



  deque<int> deque1(&x[0], &x[5]);



  // Search for the first occurrence of the letter e:

  deque<int>::iterator where = find(deque1.begin(), deque1.end(), 1);



  cout << *where << endl;

  return 0;

}

 

/* 

1



 */

Related examples in the same category

1.	Use generic deque to store chars
2.	Use generic deque to store strings
3.	Initialize deque with 26 copies of the letter x
4.	create a deque
5.	Use std::copy to print out all elements in a deque
6.	deque.push_back( value )
7.	deque.push_front( value )
8.	Create your own stack based on deque
9.	Combine insert and end to add elements to a deque
10.	Save transformed data from vector to deque (Vector1 + Vector2 = Result (in Deque))

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.