JacksonAllan / c_cpp_hash_tables_benchmarkLinks
A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
☆38Updated last year
Alternatives and similar repositories for c_cpp_hash_tables_benchmark
Users that are interested in c_cpp_hash_tables_benchmark are comparing it to the libraries listed below
Sorting:
- C++20 Coroutines and io_uring☆53Updated 2 years ago
- Library for lock-free locks☆83Updated 2 years ago
- C++20 Static Branch library☆68Updated 4 months ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- ☆22Updated last month
- Benchmarks for our memory allocator☆69Updated 2 years ago
- C++20 fiber implementation with similar interface to std::thread, header-only / x86_64 / Linux only / stackful / built-in scheduler / thr…☆29Updated last year
- A High-Performance JIT-Based C++ Expression/Script Execution Engine with SIMD Vectorization Support☆95Updated this week
- The Fancy Named Parameters Library☆35Updated 2 months ago
- Compact SVO optimized vector for C++17 or higher☆107Updated last year
- C++20 liburing backed coroutine executor and event loop framework.☆66Updated 3 years ago
- The seq library is a collection of original C++17 STL-like containers and related tools☆99Updated last month
- Effective Memory Reclamation☆62Updated 5 years ago
- Experimental JSON builder based on C++ reflection☆54Updated 4 months ago
- performance counters in C++☆21Updated last week
- C++20 Memory Allocator library☆36Updated 5 months ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆34Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- fast prime sieve and hash algorithm☆38Updated last month
- Boost.org unordered module☆80Updated last week
- For details, see the blog post:☆34Updated last year
- Sample implementation of C++20 atomic_wait/notify☆61Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- EDSL for C++ to make just-in-time code generation easier☆85Updated 2 years ago
- Concurrent Deferred Reference Counting☆168Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- ☆110Updated last year
- Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.☆146Updated last week
- A simple replacement for std::unordered_map☆50Updated last year