voutcn / kxsortLinks
Fast in-place radix sort with STL-like API
β48Updated 8 years ago
Alternatives and similar repositories for kxsort
Users that are interested in kxsort are comparing it to the libraries listed below
Sorting:
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ46Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operationsβ46Updated 5 years ago
- BitMagic Libraryβ429Updated last month
- A Benchmark of Minimal Perfect Hash Function Algorithms.β38Updated 2 years ago
- π Fast C/C++ bit population count libraryβ353Updated last year
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β34Updated 9 months ago
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- For details, see the blog post:β34Updated last year
- C++17 implementation of memory-efficient dynamic triesβ58Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).β55Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago
- In-place Parallel Super Scalar Samplesort (IPSβ΄o)β164Updated 9 months ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for stringsβ183Updated last year
- Fast Approximate Membership Filters (C++)β286Updated last month
- AVX512F and AVX2 versions of quick sortβ104Updated 7 years ago
- Bloom-filter based minimal perfect hash function libraryβ265Updated 3 months ago
- βοΈ PTHash is a fast and compact minimal perfect hash function.β241Updated last week
- benchmarking positional population countβ15Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- Succinct Data Structure Library 3.0β95Updated 2 months ago
- fast prime sieve and hash algorithmβ38Updated last month
- Fast random number generators: Vectorized (SIMD) version of xorshift128+β119Updated 5 years ago
- Radix sorting from the ground upβ37Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)β52Updated 8 years ago
- DSL for SIMD Sorting on AVX2 & AVX512β31Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ50Updated 4 months ago
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 5 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating thβ¦β113Updated 9 months ago
- String map implementation through Fast Succinct Trieβ21Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Referenceβ53Updated last year