A list of paid, free or open source C++ (C plus plus) container plugins and tools including data structures, HashMap, hashtable, hashsets, data structure algorithms and more. Sourced under a creative commons. This list will be updated regularly. Email over the URL, if you wish to be included.
C++ container & data structure plugins and tools
- C++ B-tree – A template library that implements ordered in-memory containers based on a B-tree data structure. [Apache2]
- Colony – 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
- dynamic_bitset – A C++17 header-only dynamic bitset. [MIT]
- Hashmaps – Implementation of open addressing hash table algorithms in C++. [MIT]
- Hopscotch map – A fast header-only hash map which uses hopscotch hashing for collisions resolution. [MIT]
- LSHBOX – A c++ toolbox of locality-sensitive hashing (LSH), provides several popular LSH algorithms, also support Python and MATLAB. [GPL]
- PGM-index – 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
- plf::list – A std::list implementation which removes range splicing in order to enable cache-friendlier structure, yielding significant performance gains. [zLib] website
- plf::stack – A replacement container for the std::stack container adaptor, with better performance than any std container in a stack context. [zLib] website
- ring_span lite – A simplified implementation of Arthur O’Dwyer’s ring_span implementation ie. a circular buffer view. [MIT]
- robin-hood-hashing – Fast & memory efficient hashtable based on robin hood hashing for C++14. [MIT]
- robin-map – Fast hash map and hash set using robin hood hashing. [MIT]
- sparsepp – A fast, memory efficient hash map for C++. [BSD 3-clause]
- svector – Compact SVO optimized vector for C++17 or higher. [MIT]
- unordered_dense – A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion. [MIT]
Tags: c++, open source, c plus plus, c++ tools, c++ plugins, c++ libraries, c plus plus tools, c plus plus plugins, c plus plus libraries, data structures, hashmaps, hashsets, data structure algorithms, hashtables
Image: Unsplash License.
Portions of this text under: MIT license