(C++) std::max_element

 

std::max_element is an STL algorithm to find the heighest value in a container.

 

---

#include <algorithm> #include <cassert> #include <vector> int main() {   //Create a std::vector with values   std::vector<int> v;   v.push_back( 1);   v.push_back( 4);   v.push_back( 9);   v.push_back(16);   v.push_back(25);   //Just shuffle for fun   std::random_shuffle(v.begin(),v.end());   //Assume the lowest and heighest values are found   assert( *std::min_element(v.begin(),v.end()) ==  1);   assert( *std::max_element(v.begin(),v.end()) == 25); }

 

 

 

 

 

Example: GetKeyWithMaxValue

 

GetKeyWithMaxValue is a std::map code snippet to obtain the key with the highest value.

 

---

#include <algorithm> #include <cassert> #include <map> #include <boost/lambda/bind.hpp> #include <boost/lambda/lambda.hpp> ///Obtain the key that corresponds to the highest value //From http://www.richelbilderbeek.nl/CppGetKeyWithMaxValue.htm template <class Key, class Value> const Key GetKeyWithMaxValue(const std::map<Key,Value>& v) {   assert(!v.empty());   return std::max_element(     v.begin(),v.end(),     boost::lambda::bind(&std::pair<Key,Value>::second, boost::lambda::_2)      > boost::lambda::bind(&std::pair<Key,Value>::second, boost::lambda::_1)    )->first; }