Why isn’t vector a STL container?

by

For space-optimization reasons, the C++ standard (as far back as C++98) explicitly calls out vector<bool> as a special standard container where each bool uses only one bit of space rather than one byte as a normal bool would (implementing a kind of “dynamic bitset”). In exchange for this optimization it doesn’t offer all the capabilities and interface of a normal standard container.

In this case, since you can’t take the address of a bit within a byte, things such as operator[] can’t return a bool& but instead return a proxy object that allows to manipulate the particular bit in question. Since this proxy object is not a bool&, you can’t assign its address to a bool* like you could with the result of such an operator call on a “normal” container. In turn this means that bool *pb =&v[0]; isn’t valid code.

On the other hand deque doesn’t have any such specialization called out so each bool takes a byte and you can take the address of the value return from operator[].

Finally note that the MS standard library implementation is (arguably) suboptimal in that it uses a small chunk size for deques, which means that using deque as a substitute isn’t always the right answer.

More Related Contents:

  1. Erasing elements from a vector
  2. Why can’t I make a vector of references?
  3. Concatenating two std::vectors
  4. What are the complexity guarantees of the standard containers?
  5. vector vs. list in STL
  6. How do I sort a std::vector by the values of a different std::vector?
  7. Is it safe to assume that STL vector storage is always contiguous?
  8. Efficient way of reading a file into an std::vector?
  9. Looking for C++ STL-like vector class but using stack storage
  10. How to initialize std::vector from C-style array?
  11. Appending a vector to a vector [duplicate]
  12. Sorting a vector in descending order
  13. Why is it OK to return a ‘vector’ from a function?
  14. std::vector, default construction, C++11 and breaking changes
  15. Initial capacity of vector in C++
  16. std::vector iterator invalidation
  17. STL vector and thread-safety
  18. Sorting a std::vector by the string?
  19. How do you copy the contents of an array to a std::vector in C++ without looping?
  20. Template class with template container
  21. How to make elements of vector unique? (remove non adjacent duplicates)
  22. Why would I prefer using vector to deque
  23. std::vector removing elements which fulfill some conditions
  24. What is the right approach when using STL container for median calculation?
  25. Do STL iterators guarantee validity after collection was changed?
  26. Can std::vector emplace_back copy construct from an element of the vector itself?
  27. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  28. STL vectors with uninitialized storage?
  29. “Right” way to deallocate an std::vector object
  30. C++ STL: Array vs Vector: Raw element accessing performance

Leave a Comment