senderista / hashtable-benchmarks
An Evaluation of Linear Probing Hashtable Algorithms
☆29Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for hashtable-benchmarks
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Poireau: a sampling allocation debugger☆86Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆79Updated 5 years ago
- A small DFA for under 16 states☆52Updated 6 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 3 years ago
- Integer Map Data Structure☆127Updated last year
- Bloom filter alternative (C++)☆17Updated 6 years ago
- ☆39Updated 3 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆69Updated 2 years ago
- Two-Phase Locking with Starvation-Freedom☆23Updated last year
- Runtime Assembler for C++☆13Updated 10 months ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆100Updated last month
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- a 64-bit histogram / quantile sketch☆56Updated last year
- Assorted notes☆82Updated 10 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 6 years ago
- Backtrace.io's resilient log record framing format☆36Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Various tricks for dealing with bits☆22Updated 5 years ago
- Code that accompanies the article "Lomuto's Comeback"☆35Updated 4 years ago
- an extensible stack based interpreter toolkit☆66Updated 3 years ago
- Dynamic runtime inlining with LLVM☆65Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated last month
- Experiments in C++: binary fuse filters vs. Bloom filters☆45Updated last year
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated last year