Be careful with hashmaps
As you remember from long ago hashes are O(1) best case, but can be O(n)
if you get hash collisions. And if you're adding n new entries
that means O(n^2).
I thought I'd take a look at the hash_set/hash_map GNU C++ extension.
Read the rest of this entry »