scandum / twinsort
An adaptive mergesort
☆12Updated 3 years ago
Alternatives and similar repositories for twinsort:
Users that are interested in twinsort are comparing it to the libraries listed below
- Octosort is an in-place stable adaptive block merge sort.☆18Updated 2 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 5 years ago
- Multiplying... backward?☆13Updated 4 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- SIMD-accelerated UTF-8 to UTF-32 conversion☆11Updated 6 years ago
- A vectorized single header hash function.☆19Updated 2 months ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆17Updated 8 months 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 signal/slot implementation using std::function.☆12Updated 10 years ago
- Batched random number generation☆15Updated last month
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Regular Expression Pattern Analyzer☆17Updated last year
- Interleaving bits from two sources using SIMD instructions.☆14Updated 6 years ago
- Measuring memory usage in C and C++☆25Updated 8 years ago
- A small little tool for dumping a floating-point number in its native format☆55Updated 9 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 2 weeks ago
- Random material having to do with Daniel Lemire's talks☆21Updated 8 months ago
- Small dropin library to translate utf8-strings into offsets in glyph-table.☆14Updated 7 years ago
- Fork of rpmalloc to be used with single thread applications and old C compilers☆11Updated 3 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- A blend of the compact and sparse hash table implementations.☆12Updated 3 years ago
- ☆13Updated 3 years ago
- A sparse and compressed bitmap library.☆11Updated 10 years ago
- How fast can we shuffle values?☆37Updated 10 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆37Updated 4 years ago
- Dictionary implemented through a skiplist☆15Updated 10 years ago