Search the vector for the elements present in the list : vector find « Vector « C++






Search the vector for the elements present in the list

  
#include <algorithm>
#include <vector>
#include <list>
#include <iostream>

using namespace std;

int main ()
{
    vector <int> v;

    for (int nNum = -9; nNum < 10; ++ nNum)
        v.push_back (nNum);

    v.push_back (9);
    v.push_back (9);

    list <int> l;

    for (int nNum = -4; nNum < 5; ++ nNum)
        l.push_back (nNum);

    vector <int>::iterator vl;
    vl = search ( v.begin ()      // Start of range
                  , v.end ()      // End of range to search in
                  , l.begin ()    // Start of range to search for
                  , l.end () );   // End of range to search for

    if (vl != v.end ()){
        cout << distance (v.begin (), vl);

        cout << endl << endl;
    }


    return 0;
}
  
    
  








Related examples in the same category

1.Locate maximum element in a vector
2.Locate minimum element in a vector
3.Demonstrating the generic find algorithm with a vector
4.Find the min value in the vector
5.Find the max value in the vector
6.Find the first pair of matching consecutive elements
7.Find the first of two values
8.Find the first subsequence
9.Find the last subsequence (which should be the same as the first)
10.Find the first subsequence of two consecutive 8s
11.Binary search a vector
12.Returns the positions of all values within a range