PatwinchIR / ultra-sortLinks
DSL for SIMD Sorting on AVX2 & AVX512
☆31Updated 6 years ago
Alternatives and similar repositories for ultra-sort
Users that are interested in ultra-sort are comparing it to the libraries listed below
Sorting:
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- For details, see the blog post:☆33Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 9 months ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 3 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆34Updated 7 years ago
- SIMD sorting network generator and very basic tester☆16Updated 3 years ago
- Concurrent Hash Table☆32Updated last month
- ☆31Updated 4 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆37Updated last year
- 🚀 Fast C/C++ bit population count library☆350Updated last year
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 7 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆239Updated last week
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Test if AVX vector loads and stores are atomic☆31Updated 5 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- Effective Memory Reclamation☆61Updated 5 years ago
- ☆20Updated 3 years ago