lemire / FastShuffleExperimentsLinks
How fast can we shuffle values?
☆38Updated last year
Alternatives and similar repositories for FastShuffleExperiments
Users that are interested in FastShuffleExperiments are comparing it to the libraries listed below
Sorting:
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- A C++ library for integer array compression☆29Updated 3 years ago
- ☆39Updated 4 years ago
- Succinct data structures in C/C++☆88Updated last year
- For details, see the blog post:☆34Updated last year
- Lace - implementation of work-stealing in C☆53Updated 2 months ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- C++ wrapper around wyhash and wyrand☆14Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- 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
- Branchless-Lomuto in Pattern-Defeating Quicksort☆49Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆47Updated last week
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 2 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A fast implementation of log() and exp()☆53Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 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
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- ☆27Updated last year