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.
Repository Index
47,133 repositories indexed
1–5 of 5 · Most stars
A drop-in replacement for std::list with 293% faster insertion, 57% faster erasure, 17% faster iteration and 77% faster sorting on average. 20-24% speed increase in use-case testing.
C++11/20 library that provides static_vector, small_vector, static_map, small_map, flat_map, static_flat_map, small_flat_map, static_unordered_map, small_unordered_map, etc.
Compact SVO optimized vector for C++17 or higher
A C++ data container replicating std::stack functionality but with better performance than standard library containers in a stack context.