Faster HashMap implementation (original) (raw)

Florian Weimer fweimer at bfk.de
Mon Jun 8 16:13:43 UTC 2009

I once instrumented some of the "reference workload" usages and found that over half of the HashMaps/Hashtables had a max 3 or fewer elements during their lifetimes. So on average using your version will likely increase application footprints. It seems possible to deal with this though. For example, you might consider separately allocating the back-half of index array only when needed.

Or don't use the hash structure at all and just do a sequential search. Then the index array isn't needed at all.

-- Florian Weimer <fweimer at bfk.de> BFK edv-consulting GmbH http://www.bfk.de/ Kriegsstraße 100 tel: +49-721-96201-1 D-76133 Karlsruhe fax: +49-721-96201-99

More information about the core-libs-dev mailing list