title: How sets, multisets, maps and multimaps work internally
body: <p>How do multisets work? If a set can't have a value mapped to a key, does it only hold keys?</p>
  
  <p>Also, how do associative containers work? I mean vector and deque in the memory is located sequentially it means that deleting/removing (except beginning [deque] and end [vector, deque]) are slow if they are large.</p>
  
  <p>And list is a set of pointers which are not sequentially located in the memory which causes longer search but faster delete/remove.</p>
  
  <p>How are sets, maps, multisets and multimaps stored and how do they work?</p>