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:
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 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
- Succinct data structures in C/C++☆88Updated 11 months ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆46Updated 8 months ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- ☆39Updated 4 years ago
- For details, see the blog post:☆33Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- Benchmarks for our memory allocator☆69Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Branchless-Lomuto in Pattern-Defeating Quicksort☆49Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- ☆109Updated last year
- A fast implementation of log() and exp()☆52Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Lace - implementation of work-stealing in C☆53Updated last month
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Fast C++ function "is_utf8": checks if the input is valid UTF-8. Made of a single source file. Optimized for ARM NEON, x64 SSE, AVX2 and…☆67Updated last year