scandum / wolfsort
Wolfsort is a stable adaptive hybrid radix / merge sort.
☆193Updated 7 months ago
Alternatives and similar repositories for wolfsort:
Users that are interested in wolfsort are comparing it to the libraries listed below
- A very fast library for validating UTF-8 using AVX2/SSE4 instructions☆219Updated 4 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆219Updated last year
- Assorted notes☆83Updated last year
- Integer Map Data Structure☆130Updated last year
- SIMD-enhanced word counter☆245Updated 5 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆118Updated last month
- A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.☆78Updated 3 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 4 months ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆118Updated 2 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆203Updated 5 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- A collection of array rotation algorithms.☆154Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- ☆333Updated 5 years ago
- A stable adaptive partitioning comparison sort.☆206Updated 7 months ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 3 years ago
- A minimal viable programming language on top of liblgpp☆77Updated 4 years ago
- fundamental tools in the spirit of C☆59Updated 5 years ago
- The PolymurHash universal hash function.☆344Updated last year
- All-inclusive Buffer for C☆412Updated last year
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated last month
- Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…☆143Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Authenticated key-value store (i.e. an urkel tree)☆316Updated 2 years ago
- A hash array-mapped trie implementation in C☆291Updated last year
- A simple C coroutine library.☆225Updated last year
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated 2 weeks ago
- Authenticated multi-version database: sparse binary merkle tree with compact partial-tree proofs☆302Updated 2 years ago
- Repository hosting unofficial binary pack files for many commits of LLVM☆136Updated last year
- Query C++ codebases using SQLite☆187Updated 3 years ago