title: Space complexity of C++ STL containers
body: <p>I have found various resources enlisting the time complexity of various C++ STL containers. Where can I find the space complexities which are involved with using C++ STL containers?</p>
  
  <p>I do know that for most of the  containers the relationship is linear with respect to the number of elements contained. But what about containers which use a hash function? Is it possible to make any guarantees in that case?</p>