stg7 / haesniLinks
haesni is a small hash function using aes-ni for fast string hashing
☆19Updated 6 years ago
Alternatives and similar repositories for haesni
Users that are interested in haesni are comparing it to the libraries listed below
Sorting:
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- ☆108Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Vectorized version of the PCG random number generator☆83Updated 5 months ago
- ☆39Updated 4 years ago
- benchmarking positional population count☆15Updated last year
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- For details, see the blog post:☆32Updated last year
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Updated 2 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- A fast alternative to the modulo reduction☆311Updated 4 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
- unrolled skip list library for C☆21Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 7 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago