A fast, memory efficient hash map for C++
-
Updated
Apr 26, 2023 - C++
A fast, memory efficient hash map for C++
An unordered C++ data container providing fast iteration/insertion/erasure while maintaining pointer/iterator validity to non-erased elements regardless of insertions/erasures. Provides higher-performance than std:: library containers for high-modification scenarios with unordered data.
Greg's Template Library of useful classes.
Test equality of unordered sequences
Toolkit for hashing user-defined types for use in hash maps, sets, etc.
Add a description, image, and links to the unordered topic page so that developers can more easily learn about it.
To associate your repository with the unordered topic, visit your repo's landing page and select "manage topics."