A C++ implementation of a fast hash map and hash set using hopscotch hashing
The hopscotch-map library is a C++ implementation of high-performance hash maps and sets using hopscotch hashing. It is designed to be cache-friendly and memory-efficient, offering a faster alternative to standard library containers.
Why it matters
Optimized data structures are critical for high-performance computing and low-latency software development.
The hopscotch-map library is a C++ implementation of a fast hash map and hash set using open-addressing and hopscotch hashing to resolve collisions. It is a cache-friendly data structure offering better performances than std::unordered_map in most cases and is closely similar to google::dense_hash_map while using less memory and providing more functionalities.
Technical documentation and library announcements are inherently neutral.
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in