Illustrating the generic search algorithm: Search for first occurrence of deque's contents as a subsequence of the vector contents : deque find « 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 find

Screenshots

Illustrating the generic search algorithm: Search for first occurrence of deque's contents as a subsequence of the vector contents

  

 



#include <iostream>

#include <cassert>

#include <algorithm>

#include <vector>

#include <deque>

using namespace std;



int main()

{

  vector<int> vector1(20);

  deque<int>  deque1(5);



  int i;

  for (i = 0; i < 20; ++i) 

    vector1[i] = i;



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

    deque1[i] = i + 5;





  vector<int>::iterator k = search(vector1.begin(), vector1.end(), deque1.begin(), deque1.end());



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

    cout <<  *(k + i);



  return 0;

}



/* 

56789

 */

Related examples in the same category

1.	Use find the search an element in deque
2.	Search across two deques

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.