Nanahan is a data structure library intent to low latency.
You can buy bandwidth but not latency. You can bribe Intel but not God (speed of light).
A implementation of Hopscotch hashing for single thread. Usage is similar to boost/std::tr1 unordered_map. Let me know if you want some methods implemented in unordered_map. It finds data faster than any other unordered_map.