Home/ Questions/Q 1928610
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-17T06:59:59+00:00

For small collections std::vector is almost certainly the best container whatever the operations applied

  • 0

For small collections std::vector is almost certainly the best container whatever the operations applied to it are. Is it possible to have std::vector as underlying storage for the elements set container instead red-black tree involving a lot of heap allocations (maybe boost has something?) or do I have to invent it myself?

Plain std::vector and std::sort is not an option due to performance reasons and std::inplace_merge is prone to coding errors (invalidation of iterators, etc..).

EDIT: clarified the question

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    There is no way to specify the underlying structure of an STL set. At best you can write an allocator that uses a vector to provide the memory used by set which may or may not be what you want.

    • 0