title: How is a hash mapped to a location in a vector? What happens when the vector is resized?
body: <p>I've been thinking about HashMaps/Dictionaries recently, and I realise there is a gap in my understanding of their implementation.</p>
  
  <p>From my data structures classes, I was told that a hash value will map a key directly to a location in a vector of linked-list buckets. According to wikipedia, MurmurHash creates a 32-bit or 128-bit value. Obviously that value cannot map directly to a location in memory. How is that hash value used to assign a location in the underlying vector to the object being placed in the hash map?</p>
  
  <p>After reading David Robinson's answer I want to expand my question:
  If the mapping is based on the size of the underlying vector of lists, what happens when the vector is resized?</p>