title: chained hash table keys with universal hasing,does it need a rehash?
body: <p>I am implementing a chained hash table using a vector &lt; lists  >. I resized my vector to a prime number, let's say 5. To choose the key I am using the universal hasing.</p>
  
  <p>My question is, do I need to rehash my vector? I mean this code will generate always a key in a range between 0 and 5 because it depends from the size of my hashtable, causing collisions of course but the new strings will be all added in the lists of every position in the vector...so it seems I don't need to resize/rehash the whole thing. What do you think? Is this a mistake?</p>