martinus / better-faster-stronger-mixerLinks
Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
☆40Updated 5 years ago
Alternatives and similar repositories for better-faster-stronger-mixer
Users that are interested in better-faster-stronger-mixer are comparing it to the libraries listed below
Sorting:
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- For details, see the blog post:☆34Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 7 years ago
- benchmarking positional population count☆15Updated last week
- ☆110Updated last year
- ☆39Updated 4 years ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification☆261Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆47Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated 2 months ago
- Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer☆25Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- Parse multiple decimal integers separated by arbitrary number of delimiters☆36Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆41Updated 5 years ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆56Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 9 months ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- Succinct data structures in C/C++☆88Updated last year
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago