Why don’t STL containers have virtual destructors?

by

A virtual destructor is only useful for inheritance scenarios. STL containers are not designed to be inherited from (nor is it a supported scenario). Hence they don’t have virtual destructors.

More Related Contents:

  1. Does std::list::remove method call destructor of each removed element?
  2. stl::map assert [closed]
  3. How can I use std::maps with user-defined types as key?
  4. How to find if a given key exists in a C++ std::map
  5. How to get std::vector pointer to the raw data?
  6. Can standard container templates be instantiated with incomplete types?
  7. Sort list using STL sort function
  8. When is an object “out of scope”?
  9. How to declare a vector of atomic in C++
  10. Destructor being called twice when being explicitly invoked
  11. Why is “!=” used with iterators instead of “
  12. Cleaning up an STL list/vector of pointers
  13. Reverse map lookup
  14. Efficiency of the STL priority_queue
  15. use std::fill to populate vector with increasing numbers
  16. What is the default hash function used in C++ std::unordered_map?
  17. Can we use a user defined class for the key in a STL map?
  18. How is it possible (if it is) to implement shared_ptr without requiring polymorphic classes to have virtual destructor?
  19. What happens when you call data() on a std::vector?
  20. STL analogue in Fortran
  21. How to use the priority queue STL for objects?
  22. std::vector reserve() and push_back() is faster than resize() and array index, why?
  23. std::mutex performance compared to win32 CRITICAL_SECTION
  24. Vector Iterators Incompatible
  25. Should you overload swap in the std namespace?
  26. Why can’t I replace std::map with std::unordered_map
  27. Missing C++ header after updating OSX Command Line Tools 6.3
  28. What’s the time complexity of iterating through a std::set/std::map?
  29. const auto std::initializer_list difference between Clang and GCC
  30. What C++ pitfalls should I avoid? [closed]

Leave a Comment