martinus / better-faster-stronger-mixerLinks
Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
☆38Updated 4 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☆82Updated 5 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- benchmarking positional population count☆14Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- Comparing linear and binary searches☆40Updated 5 years ago
- For details, see the blog post:☆32Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆66Updated 4 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆16Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆40Updated 4 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆45Updated 4 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 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
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer☆25Updated 2 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
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆57Updated last year
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago