Home/ Questions/Q 361153
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-12T12:52:23+00:00

I’m new to STL. The thing stumping me about using a map to store

  • 0

I’m new to STL. The thing stumping me about using a map to store arbitrary objects:

std::map<MyClassObj, MyDataObject> MyMap;

is how I find objects. How would MyMap.find (MyClassObjInstance) work for instance? Do I need to implement my own iterator and provide some standard functions which would include some equivalence function? Any examples would be appreciated.

Is there another method to store an associated list of arbitrary objects using standard libraries? I’m already using stl to maintain platform portability, and would prefer not to add another library dependency like BOOST.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    std::map has a third template argument, after key and value, to denote what function is going to be used to compare keys. By default, it is std::less, which in it’s turn uses operator<. So if your class has an operator<, it’s ok, else you can provide a comparator of your own.

    • 0