How can i estimate memory usage of std::map?

by

The estimate would be closer to 

(sizeof(A) + sizeof(B) + ELEMENT_OVERHEAD) * N + CONTAINER_OVERHEAD

There is an overhead for each element you add, and there is also a fixed overhead for maintaining the data structure used for the data structure storing the map. This is typically a binary tree, such as a Red-Black Tree. For instance, in the GCC C++ STL implementation ELEMENT_OVERHEAD would be sizeof(_Rb_tree_node_base) and CONTAINER_OVERHEAD would be sizeof(_Rb_tree). To the above figure you should also add the overhead of memory management structures used for storing the map’s elements.

It’s probably easier to arrive at an estimate by measuring your code’s memory consumption for various large collections.

More Related Contents:

  1. How can I use std::maps with user-defined types as key?
  2. Initializing a static std::map in C++
  3. How to retrieve all keys (or values) from a std::map and put them into a vector?
  4. How can I create my own comparator for a map?
  5. In STL maps, is it better to use map::insert than []?
  6. What is the preferred/idiomatic way to insert into a map?
  7. What the heque is going on with the memory overhead of std::deque?
  8. Thread safety of std::map for read-only operations
  9. C++ std::map holding ANY type of value
  10. Is std::vector so much slower than plain arrays?
  11. How do I erase an element from std::vector by index?
  12. How to get std::vector pointer to the raw data?
  13. Is list::size() really O(n)?
  14. Heterogeneous containers in C++
  15. Why use functors over functions?
  16. Do class/struct members always get created in memory in the order they were declared?
  17. How to iterate over a priority_queue?
  18. How do I store arrays in an STL list?
  19. g++ variable size array no warning?
  20. How does std::copy work with stream iterators
  21. STL analogue in Fortran
  22. Vector Iterators Incompatible
  23. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  24. Why can’t I replace std::map with std::unordered_map
  25. How is its lifetime of a return value extended to the scope of the calling function when it is bound to a const reference in the calling function?
  26. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  27. How to increment an iterator by 2?
  28. Why isn’t std::array::size static?
  29. How to convert a string of hex values to a string?
  30. Obtain container type from (its) iterator type in C++ (STL)

Leave a Comment