lemire / SIMDxorshift
Fast random number generators: Vectorized (SIMD) version of xorshift128+
☆115Updated 4 years ago
Alternatives and similar repositories for SIMDxorshift
Users that are interested in SIMDxorshift are comparing it to the libraries listed below
Sorting:
- Vectorized version of the PCG random number generator☆77Updated 2 months ago
- Add-on packages for Vector class library☆74Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- ☆31Updated 3 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- Reference implementation of Grisu-Exact in C++☆62Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Compact SVO optimized vector for C++17 or higher☆103Updated 11 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- AVX-optimized sin(), cos(), exp() and log() functions☆124Updated 3 years ago
- UME::SIMD A library for explicit simd vectorization.☆90Updated 7 years ago
- Portable C++ SIMD library☆174Updated 5 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆60Updated last year
- A terminal viewer for x86 instruction/intrinsic information using Python 3 + curses☆128Updated 2 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆88Updated 3 years ago
- low-level library for minimizing the size of your types☆113Updated 5 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Mirror of Agner Fog's C++ vector class library☆30Updated 5 years ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆53Updated 9 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆133Updated 5 years ago
- A fast implementation of log() and exp()☆53Updated 2 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆316Updated 5 months ago
- Compile-time TRIE based string matcher (C++11)☆53Updated 6 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- std::bitset with constexpr implementations plus additional features.☆119Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 10 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago