jandrewrogers / AquaHash
Fast Hash Functions Using AES Intrinsics
☆82Updated 5 years ago
Alternatives and similar repositories for AquaHash:
Users that are interested in AquaHash are comparing it to the libraries listed below
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆156Updated 2 months ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Testing memory-level parallelism☆67Updated last year
- ☆105Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated last year
- Experiments with array layouts for comparison-based searching☆82Updated last year
- ☆29Updated 2 weeks ago
- A small DFA for under 16 states☆51Updated 6 years ago
- A fast SIMD parser for CSV files☆151Updated 2 years ago
- ☆39Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- ☆60Updated 4 months ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆29Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆40Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago