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

22.5.2.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;

}

22.5.deque find
	22.5.1.	Use find the search an element in deque
	22.5.2.	Illustrating the generic search algorithm: Search for first occurrence of deque's contents as a subsequence of the vector contents

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.