If anyone's interested, I've added an implementation of a mutable hash
map based on open hashing which appears to do pretty well (it's
extremely loosely based on the implementation of Python's dictionary
object. Basically it uses the same hashing scheme - I've not borrowed
anything else from the implementation). It's about 20% slower on gets
than the jcl.HashMap implementation and appears to be fractionally
faster on updates. It's in dictionary.scala in the same repo as the
rest of the code (
http://www.drmaciver.com/repos/misc , in
scala/maps)
It's remarkably simple given how well it does. I'm a little surprised.
