Benchmarking hash tables is a very difficult task.
Can someone point me to some good source on how to best do that?
I guess I should benchmark several cases such as insert, then un/successful look-ups; multiple sequences of deletion and insertions; using random strings or words in a corpus.
