/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 jguegant.github.io
Jean Guegant's Blog - Making a STL-compatible hash map from scratch - Part 1 - Beating std::unordered_map
| | codecapsule.com
Implementing a Key-Value Store - Part 5: Hash table implementations | Code Capsule
4.6 parsecs away

Travel
| | This is Part 5 of the IKVS series, "Implementing a Key-Value Store". You can also check the Table of Contents for other parts. In this article, I will study the actual implementations of hash tables in C++ to understand where are the bottlenecks. Hash functions are CPU-intensive and should be optimized for that. However, most of the
| | artificial-mind.net
Measuring std::unordered_map Badness
4.6 parsecs away

Travel
| | Articles about Graphics, C++, Optimization, Game Development, Programming Languages, and more. Personal blog of Philip Tretter writing under the alias of Artificial Mind.
| | dave.cheney.net
How the Go runtime implements maps efficiently (without generics) | Dave Cheney
4.6 parsecs away

Travel
| | [AI summary] The post explains how the Go runtime implements efficient hashmaps without generics by using a unique maptype descriptor and compile time rewriting to bridge the gap between generic behavior and type safety.
| | danlark.org
Optimizing 128-bit Division - Experimental chill
23.6 parsecs away

Travel
| When it comes to hashing, sometimes 64 bit is not enough, for example, because of birthday paradox -- the hacker can iterate through random $latex 2^{32}$ entities and it can be proven that with some constant probability they will find a collision, i.e. two different objects will have the same hash. $latex 2^{32}$ is around...