(C++) std::find

January 9, 2018 · View on GitHub

 

 

 

 

 

(C++) std::find

 

STL algorithm for searching a single element in a container. It is similar to std::search, except that std::search searches for a sequence of elements.

 

The use of a functor extends the functionality of std::find.

 

#include <vector> #include <cassert> #include <algorithm> int main() {   //Create a std::vector of the six first primes   std::vector<int> v;   v.push_back(1);   v.push_back(2);   v.push_back(3);   v.push_back(5);   v.push_back(7);   v.push_back(11);   assert(std::find(v.begin(), v.end(), 7) != v.end()); //Found   assert(std::find(v.begin(), v.end(), 4) == v.end()); //Not found }