jermp / pthashLinks
✈️ PTHash is a fast and compact minimal perfect hash function.
☆229Updated this week
Alternatives and similar repositories for pthash
Users that are interested in pthash are comparing it to the libraries listed below
Sorting:
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆262Updated 2 years ago
- Header-only binary fuse and xor filter library☆365Updated 4 months ago
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification☆248Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- Comprehensive benchmarks of C++ maps☆309Updated 2 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆210Updated 3 weeks ago
- Storage for my snippets, toy programs, etc.☆357Updated 2 months ago
- 🚀 Fast C/C++ bit population count library☆346Updated 11 months ago
- BitMagic Library☆425Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Fast integer compression in C using the StreamVByte codec☆399Updated 3 months ago
- SIMD (SSE) string functions☆102Updated 7 years ago
- Testing memory-level parallelism☆68Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 2 weeks ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Concurrent Hash Table☆27Updated last month
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 4 months ago
- Fast in-place radix sort with STL-like API☆46Updated 8 years ago
- A fast alternative to the modulo reduction☆308Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆178Updated 8 months ago
- Succinct data structures in C/C++☆88Updated 7 months ago