scandum / wolfsortLinks
Wolfsort is a stable adaptive hybrid radix / merge sort.
☆196Updated 10 months ago
Alternatives and similar repositories for wolfsort
Users that are interested in wolfsort are comparing it to the libraries listed below
Sorting:
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- Integer Map Data Structure☆129Updated last year
- A very fast library for validating UTF-8 using AVX2/SSE4 instructions☆219Updated 4 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 4 months ago
- A collection of array rotation algorithms.☆155Updated 2 years ago
- Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.☆117Updated 2 years ago
- A minimal viable programming language on top of liblgpp☆77Updated 4 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆120Updated 4 months ago
- Assorted notes☆84Updated last year
- a 64-bit histogram / quantile sketch☆59Updated 5 months ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆218Updated last year
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.☆78Updated 3 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A hash array-mapped trie implementation in C☆295Updated last year
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- SIMD-enhanced word counter☆247Updated 5 years ago
- ☆333Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Brzozowski derivative python sketch☆85Updated 2 months ago
- The PolymurHash universal hash function.☆351Updated last year
- Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS☆91Updated last month
- Poireau: a sampling allocation debugger☆97Updated 3 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…☆146Updated 3 years ago
- A stable adaptive partitioning comparison sort.☆207Updated 10 months ago
- ☆80Updated 3 years ago
- A simple C coroutine library.☆227Updated last year
- A fast alternative to the modulo reduction☆308Updated 4 years ago
- Non-preemptive Thread Hierarchy Manager☆55Updated 7 months ago