danlark1 / miniselectLinks
Selection and partial sorting algorithms
☆137Updated 7 months ago
Alternatives and similar repositories for miniselect
Users that are interested in miniselect are comparing it to the libraries listed below
Sorting:
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 4 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A fast alternative to the modulo reduction☆314Updated 4 years ago
- A distributed C++ compiler: like distcc, but faster☆288Updated 3 months ago
- Automatically exported from code.google.com/p/relacy☆241Updated 2 months ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated 2 weeks ago
- Specialized memory allocators☆105Updated 4 months ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆333Updated last year
- Fast Static Symbol Table (FSST): efficient random-access string compression☆476Updated last month
- One of the fastest hash functions.☆361Updated 9 months ago
- ☆111Updated last year
- Fastest Trie structure (Linux & Windows)☆93Updated 2 years ago
- Succinct data structures in C/C++☆91Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆287Updated 2 months ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.