Demonstrating the generic find algorithm with a vector : vector find « Vector « C++

Home
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++ » Vector » vector findScreenshots 
Demonstrating the generic find algorithm with a vector
  
 

#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>  // For find
using namespace std;


int main()
{
  char x[5{'a''b''c''d''f'};

  vector<char> vector1(&x[0], &x[5]);

  // Search for the first occurrence
  vector<char>::iterator where = find(vector1.begin(), vector1.end()'b');


  cout << *where  << endl;
  return 0;
}

/* 
b

 */        
    
  
Related examples in the same category
1.Locate maximum element in a vector
2.Locate minimum element in a vector
3.Find the min value in the vector
4.Find the max value in the vector
5.Find the first pair of matching consecutive elements
6.Find the first of two values
7.Find the first subsequence
8.Find the last subsequence (which should be the same as the first)
9.Find the first subsequence of two consecutive 8s
10.Binary search a vector
11.Search the vector for the elements present in the list
12.Returns the positions of all values within a range
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.