I want to use STL::find(myVec.Begin(), myVec.end(), tempVector): so i can find my subarray in an array, anyone can help me to use find with a subarray ?
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.
Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
Hm, one ide could be to implem´ment your own 'find()', i.e.
template<typename T>
vector<T>::iterator find(vector<T>& v1vector<T>& v2) {
vector<T>::iterator i = v1.begin();
while( i != v1.end()) {
i = find(i,v2.end(), v2.front());
if (distance(i,v2.end()) < v2.size()) break;
vector<T> tmp(i, i + v2.size());
if ( tmp == v2) return i;
}
return v1.end();
}
Ooops, that should be
vector<T>::iterator find(vector<T>& v1vector<T>& v2) {
vector<T>::iterator i = v1.begin();
while( i != v1.end()) {
i = find(i,v2.end(), v2.front());
if (distance(i,v1.end()) < v2.size()) break; // 'v1.end()', not 'v2'
vector<T> tmp(i, i + v2.size());
if ( tmp == v2) return i;
}
return v1.end();
}
we can avoid creating a temporary vector:
template<typename T> typename vector<T>::iterator find( vector<T>& first, vector<T>& second )
{
typename vector<T>::size_type N = second.size() ;
if( N <= first.size() )
{
typedef typename vector<T>::iterator iterator ;
iterator end = first.end() - second.size() + 1;
for( iterator begin = first.begin() ; begin != end ; ++begin )
if( mismatch( begin, begin+N, second.begin() ).first == (begin+N) )
return begin ;
}
return first.end() ;
}
There's the search algorithm for this:
http://www.sgi.com/tech/st
Business Accounts
Answer for Membership
by: jkrPosted on 2007-05-25 at 09:21:12ID: 19158110
Since 'find()' takes an argument of 'T' and not of 'T*', it is kinda the wrong choice for that task.