A family of header-only, very fast and memory-friendly hashmap and btree containers [Apache2] website

A very fast flat hashtable with Fibonacci hashing.

Fast & memory efficient hashtable based on robin hood hashing for C++14. [MIT]

a header-only, constexpr alternative to gperf for C++14 users. [Apache-2.0]

Fast hash map and hash set using robin hood hashing. [MIT]

A fast, memory efficient hash map for C++. [BSD 3-clause]

A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion. [MIT]

C++ implementation of a fast and memory efficient HAT-trie. [MIT]

A data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes. [Apache2] website

A fast header-only hash map which uses hopscotch hashing for collisions resolution. [MIT]

An unordered "bag"-type container which outperforms std containers in high-modification scenarios while maintaining permanent pointers to non-erased elements regardless of insertion/erasure. [zLib] website

Header-only C++20 library that provides fixed capacity constexpr containers. [MIT]

A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support Python and MATLAB. [GPL]

Implementation of open addressing hash table algorithms in C++. [MIT]

Simple Useful Libraries: C++17/20 header-only dynamic bitset. [MIT] website

A simplified implementation of Arthur O'Dwyer's ring_span implementation ie. a circular buffer view. [MIT]

A std::list implementation which removes range splicing in order to enable cache-friendlier structure, yielding significant performance gains. [zLib] website

An STL-like C++ header-only tree library. [GPL2+]

A fast and flexible c++ template class for tree data structures. [Apache-2.0]

Compact SVO optimized vector for C++17 or higher. [MIT]

A replacement container for the std::stack container adaptor, with better performance than any std container in a stack context. [zLib] website