编程第八十四天

 search

原型：Iterator search (Iterator1 begin, Iterator1 end, Iterator2 searchBegin, Iterator2 searchEnd)

　　   Iterator search (Iterator1 begin, Iterator1 end,

　　　　　　　　　　　　Iterator2 searchBegin, Iterator2 searchEnd, BinaryPredicate op)

功能：搜索第一个子区间

vector< int > subVector;

vector< int >::iterator pos_search_1,pos_search_2;

 

setValue(subVector, -1, 3);

pos_search_1 = search(myvector2.begin(), myvector2.end(), subVector.begin(), subVector.end());

 

if  (pos_search_1 != myvector2.end())

{

     cout <<  "子串在原串的位置是(search)："  << distance(myvector2.begin(), pos_search_1) + 1 << endl;

}

else

{

     cout <<  "没有搜索到子串"  << endl;

}

 

bool  checkEvenArr[3] = {  true ,  false ,  true  };

pos_search_2 = search(myvector2.begin(), myvector2.end(), checkEvenArr, checkEvenArr + 3, checkEven);

 

if  (pos_search_2 != myvector2.end())

{

     cout <<  "子串在原串的位置是(search + op)："  << distance(myvector2.begin(), pos_search_2) + 1 << endl;

}

else

{

     cout <<  "没有搜索到子串"  << endl;

}