goldsteinn / SIMD-sorting-networkLinks
SIMD sorting network generator and very basic tester
☆16Updated 3 years ago
Alternatives and similar repositories for SIMD-sorting-network
Users that are interested in SIMD-sorting-network are comparing it to the libraries listed below
Sorting:
- ☆32Updated 4 years ago
- benchmarking positional population count☆16Updated 2 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 6 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆120Updated 5 years ago
- Vectorized version of the PCG random number generator☆84Updated 9 months ago
- ☆39Updated 4 years ago
- A fast implementation of log() and exp()☆55Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Slotmap is a sequence container with weak reference keys written in C++17.☆39Updated last year
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆41Updated 11 years ago
- Radix sorting from the ground up☆37Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Unstable O(n log n) sorting algorithm with O(n) memory☆65Updated last month
- LZ77/LZSS designed for SSE based decompression☆144Updated 6 years ago
- TLSF: two-level segregated fit O(1) allocator☆81Updated 3 years ago
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- SPMD in C++☆68Updated 5 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
- Source-code annotation language (SAL) compatibility header☆48Updated 7 years ago
- Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer☆26Updated 3 years ago
- fast open addressing hash table☆41Updated last month
- Polyfill some holes in the SSE intrinsics set☆50Updated 3 years ago
- Add-on packages for Vector class library☆76Updated 2 years ago
- C++ Scattered Containers☆67Updated 8 years ago
- Virtual memory based containers☆42Updated 3 years ago
- A C++ stream using LZ4 (de)compression☆39Updated 3 years ago