Comment by malkia

Is there a quality benchmark for hashes?

In general, how does one test the overall good uniqueness of a hash-function - e.g. less hash collisions on overall?

Is it done with some corpuses, like words in a dictionary, sentences from books, randomly generated strings, etc?

I'm just interrested how one goes to show that X has better quality than Y and it's still faster.

For example how a language runtime would choose it's hash function for built-in types?