Our great sponsors
-
parallel-hashmap
A family of header-only, very fast and memory-friendly hashmap and btree containers.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
robin-hood-hashing
Discontinued Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
actually, std::map and std::set are very inefficient, and can be very advantageously replaces by phmap::btree_map and phmap::btree_set from my https://github.com/greg7mdp/parallel-hashmap repo. Same for unordered_map and unordered_set.
I have no benchmarking experience in multithreading support, but if you want to get something bleeding edge, you could try https://github.com/facebookexperimental/libunifex.
I would recommend tracy for a low overhead profiler... https://github.com/wolfpld/tracy
That being said - for unordered containers use https://github.com/martinus/robin-hood-hashing as benchmark.
For general lightweight containers I would use (https://github.com/mosra/corrade/tree/master/src/Corrade/Containers) see also https://doc.magnum.graphics/corrade/namespaceCorrade_1_1Containers.html .
For high performance local IO definitely use https://github.com/ned14/llfio .
https://github.com/chromium/chromium/tree/master/base https://chromium.googlesource.com/chromiumos/docs/+/master/packages/libchrome.md https://chromium.googlesource.com/chromium/mini_chromium/
Related posts
- The One Billion Row Challenge in CUDA: from 17 minutes to 17 seconds
- Mediapipe openpose Controlnet model for SD
- ⟳ 1 apps added, 54 updated at f-droid.org
- unordered_dense: A Fast & Densely Stored Hashmap And Hashset Based On Robin-Hood Backward Shift Deletion
- unordered_dense: A fast, densely stored hashmap based on backward shift deletion