looking at the code, they've optimized for speed. And they also said -
> We decided to optimize for speed rather than simplicity and even included special cases for short inputs.
Re:Open Source at Google: Introducing CityHash
by nbpoole on Monday April 11, 2011 @06:11PM
(#2434648)
Right, I understand that. I'm just surprised that they aren't showing off benchmarks or statistics to quantify the performance gains they're seeing.
Re:Open Source at Google: Introducing CityHash
by andrewcooke on Monday April 11, 2011 @06:51PM
(#2434804)
and i'm not seeing any definition of what the hash is, or why it should be any good, apart from the code...
Edit: For instance, the blog post mentions being inspirsed by MurmurHash, which touts its performance on its site along with benchmarks (http://sites.google.com/site/murmurhash/):
In fact, it looks like the author of MurmurHash also developed a test suite for hash functions which includes performance testing: http://code.google.com/p/smhasher/wiki/SMHasher