scandum / octosortLinks
Octosort is an in-place stable adaptive block merge sort.
☆18Updated 2 years ago
Alternatives and similar repositories for octosort
Users that are interested in octosort are comparing it to the libraries listed below
Sorting:
- SIMD-accelerated UTF-8 to UTF-32 conversion☆11Updated 6 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆19Updated last year
- A vectorized single header hash function.☆19Updated 6 months ago
- An adaptive mergesort☆12Updated 4 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 6 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Very fast CSV parser in C that utilizes x86 SSE instructions☆11Updated last year
- A splaytree ADT written in C with a BSD license☆18Updated 4 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Benchmark supporting baseless libel against clang-format☆11Updated 5 years ago
- Base252 is a binary to C string encoding scheme with flexible escaping.☆23Updated 4 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- Lock-free memory allocator☆21Updated last year
- ☆12Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- How fast can we shuffle values?☆37Updated last year
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- Measuring memory usage in C and C++☆26Updated 8 years ago
- NetBSD cdb (constant database) library☆14Updated 6 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- A signal/slot implementation using std::function.☆12Updated 10 years ago
- Benchmark results for lossless data compressors☆9Updated 6 years ago
- A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world☆11Updated 2 years ago
- Benchmarking reading and parsing integers from a file in C++.☆9Updated 5 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Dictionary implemented through a skiplist☆15Updated 10 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Cuckoo Hashtable C Library☆33Updated 5 years ago