A fast & densely stored hashmap and hashset
↑ +1 today
Discover the most starred and trending open source tools tagged with #unordered.
A fast & densely stored hashmap and hashset
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.