-
STC
A modern, user friendly, generic, type-safe and fast C99 container library: String, Vector, Sorted and Unordered Map and Set, Deque, Forward List, Smart Pointers, Bitset and Random numbers. (by stclib)
When I developed CMAP, (unordered map in C), I made a benchmark comparing with a number of C++ hash maps, and they all perform 2-4 times faster than std::unordered_map. Tessil robin-map is the fastest overall here.
-
InfluxDB
InfluxDB – Built for High-Performance Time Series Workloads. InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.
-
-
parallel-hashmap
A family of header-only, very fast and memory-friendly hashmap and btree containers.
-
-
robin-hood-hashing
Discontinued Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
-
unordered_dense
A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
or martinus's https://github.com/martinus/unordered_dense
-
I've implemented this PoolAllocator which does exactly this: https://github.com/martinus/map_benchmark/blob/master/src/app/pool.h
-
Here are the results of our uint32.cpp synthetic benchmark under VS2022 Release x64:
Related posts
-
Fibonacci Hashing: An Optimization the World Forgot (Better Than Integer Modulo)
-
A brief and incomplete guide for selecting the appropriate container from inside/outside the C++ standard library, based on performance characteristics, functionality and benchmark results
-
When using data structures such as trees and linked lists is it common to build your own or use a library?
-
hash_map
-
A Fast, Densely Stored Hashmap Based on Robin-Hood Backward Shift Deletion