您當前位置：首頁 > 互聯網 > STL algorithm算法search，search_n（52）

STL algorithm算法search，search_n（52）

來源：程序員人生發布時間：2014-10-08 08:00:01 閱讀次數：2291次

search原型：

std::search

equality (1)	template <class ForwardIterator1, class ForwardIterator2> ForwardIterator1 search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2);
predicate (2)	template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);

該函數是查找[first2,last2)第一次出現在[first1,last1)中的位置。

也就相當于一個子序列在一個序列中第一次出現的位置。

若匹配成功，返回[first1,last1)中匹配的第一個相應元素。

否則，返回last1.

行為類似于：

template<class ForwardIterator1, class ForwardIterator2> ForwardIterator1 search ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) { if (first2==last2) return first1; // specified in C++11 while (first1!=last1) { ForwardIterator1 it1 = first1; ForwardIterator2 it2 = first2; while (*it1==*it2) { // or: while (pred(*it1,*it2)) for version 2 ++it1; ++it2; if (it2==last2) return first1; if (it1==last1) return last1; } ++first1; } return last1; }

一個簡單的例子：

#include <iostream> #include <algorithm> #include <vector> using namespace std; void msearch(){ char vc[]={"iamastudentstuden"}; char vt[]={"student"}; auto it=search(vc,vc+17,vt,vt+7); cout<<"auto it=search(vc,vc+17,vt,vt+7);;"<<endl; for(auto i=it;i!=vc+17;++i) cout<<*i; cout<<endl; }

運行截圖：

search_n原型：

std::search_n

equality (1)	template <class ForwardIterator, class Size, class T> ForwardIterator search_n (ForwardIterator first, ForwardIterator last, Size count, const T& val);
predicate (2)	template <class ForwardIterator, class Size, class T, class BinaryPredicate> ForwardIterator search_n ( ForwardIterator first, ForwardIterator last, Size count, const T& val, BinaryPredicate pred );

該函數是查找序列中連續count個val值第一次出現的位置。

如果有，則返回第一次出現的首元素，否則返回last。

其行為類似于：

template<class ForwardIterator, class Size, class T> ForwardIterator search_n (ForwardIterator first, ForwardIterator last, Size count, const T& val) { ForwardIterator it, limit; Size i; limit=first; std::advance(limit,std::distance(first,last)-count); while (first!=limit) { it = first; i=0; while (*it==val) // or: while (pred(*it,val)) for the pred version { ++it; if (++i==count) return first; } ++first; } return last; }

一個簡單的例子：

#include <iostream> #include <algorithm> #include <vector> using namespace std; bool mypredicate (int i, int j) { return (i==j); } void msearchn(){ int myints[]={10,20,30,30,20,10,10,20}; std::vector<int> myvector (myints,myints+8); std::vector<int>::iterator it; // using default comparison: it = std::search_n (myvector.begin(), myvector.end(), 2, 30); if (it!=myvector.end()) std::cout << "two 30s found at position " << (it-myvector.begin()) << ' '; else std::cout << "match not found "; // using predicate comparison: it = std::search_n (myvector.begin(), myvector.end(), 2, 10, mypredicate); if (it!=myvector.end()) std::cout << "two 10s found at position " << int(it-myvector.begin()) << ' '; else std::cout << "match not found "; }

運行截圖：