title: Have a good hash function for a C++ hash table?
body: <p>I am in need of a performance-oriented hash function implementation in C++ for a hash table that I will be coding. I looked around already and only found questions asking what's a good hash function "in general". I've considered CRC32 (but where to find good implementation?) and a few cryptography algorithms. My table, though, has very specific requirements.</p>
  
  <p>Here's what the table will be like:</p>
  
  <pre><code>100,000 items max
  200,000 capacity (so the load is 0.5)
  hashing a 6-character string which is a part of English sentence
       examples: "become"    "and he"    ", not "
  </code></pre>
  
  <p>The <em>number one priority</em> of my hash table is quick search (retrieval). Quick insertion is not important, but it will come along with quick search. Deletion is not important, and re-hashing is not something I'll be looking into. To handle collisions, I'll be probably using <em>separate chaining</em> as described <a href="http://eternallyconfuzzled.com/tuts/datastructures/jsw_tut_hashtable.aspx" rel="noreferrer">here</a>. I have already looked at <a href="http://eternallyconfuzzled.com/tuts/algorithms/jsw_tut_hashing.aspx" rel="noreferrer">this article</a>, but would like an opinion of those who have handled such task before.</p>