jonmaiga / mx3
A bit mixer, pseudo random number generator and a hash function.
☆28Updated 3 years ago
Alternatives and similar repositories for mx3
Users that are interested in mx3 are comparing it to the libraries listed below
Sorting:
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- FPC - Fast Prefix Coder☆30Updated 3 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- LZ77/LZSS designed for SSE based decompression☆139Updated 6 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆115Updated 4 years ago
- experimental data compression algoritm☆22Updated 8 years ago
- Comparing linear and binary searches☆40Updated 5 years ago
- Extremely fast x86 / AVX2 assembly implementations of common operations for linear arrays: checking whether array contains element, findi…☆37Updated 3 years ago
- Tiny optimizing JIT compiler backend.☆46Updated 3 months ago
- Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 27GB/s + PRNG☆229Updated 3 weeks ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆316Updated 6 months ago
- A collection of various algorithms to produce length-limited prefix codes☆24Updated 3 years ago
- Experimental compression format (unmaintained, do not use!)☆32Updated 8 years ago
- Fast UTF-8 validation with range algorithm (NEON+SSE4+AVX2)☆83Updated 4 years ago
- Succinct data structures in C/C++☆87Updated 7 months ago
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆53Updated 9 months ago
- Fastest Histogram Construction☆70Updated 3 years ago
- How fast can we shuffle values?☆37Updated last year
- ☆39Updated 4 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
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Demo of a fast PNG encoder.☆97Updated 3 months ago
- O(n log n) In-place Stable Quicksort☆16Updated 5 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago