title: I'm using ELF Hash to write a specially tweaked version of hash map. Wanting to produce collisions
body: <p>Can any one give an example of 2 strings, consisting of alphabetical characters only, that will produce the same hash value with ELFHash?</p>
  
  <p>I need these to test my codes. But it doesn't seem like easy to produce. And to my surprise there there are a lot of example codes of various hash function on the internet but none of them provides examples of collided strings.</p>
  
  <p>Below is the ELF Hash, in case you need it.</p>
  
  <pre><code>unsigned int ELFHash(const std::string&amp; str)
  {
     unsigned int hash = 0;
     unsigned int x    = 0;
  
     for(std::size_t i = 0; i &lt; str.length(); i++)
     {
        hash = (hash &lt;&lt; 4) + str[i];
        if((x = hash &amp; 0xF0000000L) != 0)
        {
           hash ^= (x &gt;&gt; 24);
           hash &amp;= ~x;
        }
     }
  
     return (hash &amp; 0x7FFFFFFF);
  }
  </code></pre>