lemire / FastShuffleExperimentsLinks
How fast can we shuffle values?
☆40Updated 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☆87Updated last week
- A C++ library for integer array compression☆30Updated 3 years ago
- A fast implementation of log() and exp()☆56Updated 3 years ago
- ☆39Updated 4 years ago
- Succinct data structures in C/C++☆92Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆122Updated 5 years ago
- For details, see the blog post:☆35Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 5 years ago
- Shader-Like Mathematical Expression JIT Engine for C++ Language☆59Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- ☆112Updated last year
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated last week
- Code that accompanies the article "Lomuto's Comeback"☆35Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- Lace - implementation of work-stealing in C☆55Updated 5 months ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆49Updated 3 months 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
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- String to Float Benchmark☆19Updated 7 years ago
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- Branchless-Lomuto in Pattern-Defeating Quicksort☆49Updated last year
- Comparing linear and binary searches☆43Updated 5 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆41Updated 5 years ago