How can I use std::maps with user-defined types as key?

by

You don’t have to define operator< for your class, actually. You can also make a comparator function object class for it, and use that to specialize std::map. To extend your example:

struct Class1Compare
{
   bool operator() (const Class1& lhs, const Class1& rhs) const
   {
       return lhs.id < rhs.id;
   }
};

std::map<Class1, int, Class1Compare> c2int;

It just so happens that the default for the third template parameter of std::map is std::less, which will delegate to operator< defined for your class (and fail if there is none). But sometimes you want objects to be usable as map keys, but you do not actually have any meaningful comparison semantics, and so you don’t want to confuse people by providing operator< on your class just for that. If that’s the case, you can use the above trick.

Yet another way to achieve the same is to specialize std::less:

namespace std
{
    template<> struct less<Class1>
    {
       bool operator() (const Class1& lhs, const Class1& rhs) const
       {
           return lhs.id < rhs.id;
       }
    };
}

The advantage of this is that it will be picked by std::map “by default”, and yet you do not expose operator< to client code otherwise.

More Related Contents:

  1. How to retrieve all keys (or values) from a std::map and put them into a vector?
  2. In STL maps, is it better to use map::insert than []?
  3. How can I use an array as map value?
  4. c++ push reference node to stl list
  5. What are the complexity guarantees of the standard containers?
  6. Initializing a static std::map in C++
  7. Why isn’t vector a STL container?
  8. Why is std::map implemented as a red-black tree?
  9. How can I create my own comparator for a map?
  10. Is the order of iterating through std::map known (and guaranteed by the standard)?
  11. std::map emplace without copying value
  12. Copy map values to vector in STL [duplicate]
  13. What is the preferred/idiomatic way to insert into a map?
  14. What is an iterator’s default value?
  15. How to choose between map and unordered_map?
  16. Why does storing references (not pointers) in containers in C++ not work?
  17. Thread safety of std::map for read-only operations
  18. C++ Thread-Safe Map
  19. How can I sort an STL map by value?
  20. C++ std::map holding ANY type of value
  21. How can i estimate memory usage of std::map?
  22. What is the right approach when using STL container for median calculation?
  23. Using std::map where V has no usable default constructor
  24. How can I make the map::find operation case insensitive?
  25. Do STL iterators guarantee validity after collection was changed?
  26. General use cases for C++ containers
  27. Find mapped value of map
  28. Why Can’t I store references in a `std::map` in C++?
  29. How can I copy one map into another using std::copy?
  30. STL map containing references does not compile

Leave a Comment