#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;
}
|