Outer Web | Explore

/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		pdimov.github.io Development Plan for Boost.Unordered
\|	\|	emre.me Hash Tables - emre.me	3.3 parsecs away Travel
\|	\|	A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries).	3.3 parsecs away Travel
\|	\|	bannalia.blogspot.com Bannalia: trivial notes on themes diverse: Advancing the state of the art for std::unordered_map implementations	1.9 parsecs away Travel
\|	\|	Introduction Several Boost authors have embarked on a project to improve the performance of Boost.Unordered 's implementation of std::unor...	1.9 parsecs away Travel
\|	\|	bannalia.blogspot.com Bannalia: trivial notes on themes diverse: Inside boost::unordered_flat_map	3.3 parsecs away Travel
\|	\|	Introduction The case for open addressing SIMD-accelerated lookup boost::unordered_flat_map data structure Rehashing Hash post-mixing Sta...	3.3 parsecs away Travel
\|	\|	blog.demofox.org O(1) Data Lookups With Minimal Perfect Hashing « The blog at the bottom of the sea	11.9 parsecs away Travel
\|		Hash tables are great in that you can hash a key and then use that hash as an index into an array to get the information associated with that key. That is very fast, so long as you use a fast hash function. The story doesn't end there though because hash functions can have collisions...	11.9 parsecs away Travel