How do I find the largest int in a std::set<int>?

c++ stl stdset
leeeroy picture leeeroy · Aug 27, 2009 · Viewed 40.2k times · Source

I have a std::set<int>, what's the proper way to find the largest int in this set?

Answer

CTT picture CTT · Aug 27, 2009

What comparator are you using?

For the default this will work:

if(!myset.empty())
    *myset.rbegin();
else
    //the set is empty

This will also be constant time instead of linear like the max_element solution.

Related questions

c++ STL set difference

Does the C++ STL set data structure have a set difference operator?

Read More
Is the C++ std::set thread-safe?

I've a question about the thread safety of std::set. As far as I know I can iterate over a set and add/erase members and that doesn't invalidate the iterators. But consider following scenario: thread 'A' iterates over a …

Read More
Why does std::set not have a "contains" member function?

I'm heavily using std::set<int> and often I simply need to check if such a set contains a number or not. I'd find it natural to write: if (myset.contains(number)) ... But because of the lack of …

Read More