Home/ Questions/Q 3610308
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-18T21:44:10+00:00

I’m using a stl::set to keep elements sorted as they are inserted. My question

  • 0

I’m using a stl::set to keep elements sorted as they are inserted. My question is about the random access. If I have a complex class(difficult to init, for example), I found that is easy to insert, because I define the less operator into class. But if the key is the class itself, how do I need to access to the class? With a find()? I need to init a complex class only to find my class?

So my question is: how to random access to a set elements when elements are complex classes difficult to initialize?

Thanks

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I don’t think it is possible : as you already noticed, the std::set<>::find member function expects a const key_type & (which, in a std::set is identical to value_type).

    If you object is expensive to construct, chances are that you should better use a std::map (which also is a sorted container), possibly with values being (smart) pointers on your type.

    • 0