senderista / hashtable-benchmarksLinks
An Evaluation of Linear Probing Hashtable Algorithms
☆39Updated 2 years ago
Alternatives and similar repositories for hashtable-benchmarks
Users that are interested in hashtable-benchmarks are comparing it to the libraries listed below
Sorting:
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- ☆39Updated 4 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆76Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 2 weeks ago
- Integer Map Data Structure☆133Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- Two-Phase Locking with Starvation-Freedom☆23Updated 3 years ago
- c++ library for binary fuse filters, including a sharded filter☆95Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated 2 years ago
- Reproducible experimeents on UTF-8 validation using SIMD instructions☆41Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Dynamic runtime inlining with LLVM☆67Updated 4 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆107Updated last year
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- 8-bit Xor Filter in C99☆63Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- a 64-bit histogram / quantile sketch☆59Updated last year
- Different algorithms for converting binary to decimal floating-point numbers☆128Updated 3 years ago
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- multi-way atomic compare-and-swap with x64/TSX☆85Updated 9 years ago
- Bitset Sort, a faster std::sort replacement.☆79Updated 3 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆24Updated 4 years ago
- Compile-time TRIE based string matcher (C++11)☆53Updated 6 years ago
- Assorted notes☆84Updated 2 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago