1. #include <algorithm> std::find(...);

2. #include <algorithm> using std::find; find(...);

3. #include <algorithm> using namespace std; find(...);

quote:Original post by Strewth
Shouldn't you be using something like std::map::find or std::set::find?
find is a member function of these (and other) STL templates.

#include <vector>#include <algorithm>#include <string>#include <iostream> ... std::vector<std::string> V(..., ...); std::sort( V.begin(), V.end() );    // generic algorithm `sort' // (yes, could, and probably would, be put in if statement)std::vector<int>::iterator found = std::find( V.begin(), V.end(), "word" );  // generic algorithm `found'if ( found != V.end() )    std::cout << "found" << std::endl;else    std::cout << "not found" << std::endl; std::rotate( V.begin(), V.begin() + V.size() / 2, V.end() ); // generic algorithm `rotate' std::reverse( V.begin(), V.end() );   // generic algorithm `reverse' ... etc., etc.