eloj / radix-sorting
Radix sorting from the ground up
☆35Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for radix-sorting
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆46Updated 3 months ago
- ☆39Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Fast in-place radix sort with STL-like API☆45Updated 7 years ago
- A fast implementation of log() and exp()☆49Updated last year
- Quick sort code using AVX2 instructions☆69Updated 7 years ago
- ☆31Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- SIMD sorting network generator and very basic tester☆16Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆60Updated 9 months ago
- Vectorized version of the PCG random number generator☆75Updated 5 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆111Updated 4 years ago
- 8-bit Xor Filter in C99☆61Updated 4 years ago
- Comparing linear and binary searches☆38Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- InstLatX64_Demo☆41Updated last week
- Fastest Histogram Construction☆66Updated 2 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆43Updated 10 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆54Updated 11 months ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆31Updated last year
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆41Updated last year