senderista / hashtable-benchmarks
An Evaluation of Linear Probing Hashtable Algorithms
☆31Updated last year
Alternatives and similar repositories for hashtable-benchmarks:
Users that are interested in hashtable-benchmarks are comparing it to the libraries listed below
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Poireau: a sampling allocation debugger☆87Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆104Updated 7 months ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆73Updated 2 years ago
- Integer Map Data Structure☆130Updated last year
- ☆39Updated 4 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 6 months ago
- Reproducible experimeents on UTF-8 validation using SIMD instructions☆40Updated 8 months ago
- Two-Phase Locking with Starvation-Freedom☆23Updated 2 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Assorted notes☆84Updated last year
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Dynamic runtime inlining with LLVM☆66Updated 3 years ago
- Various tricks for dealing with bits