lemire / StronglyUniversalStringHashingLinks
Benchmark showing the we can randomly hash strings very quickly with good universality
☆137Updated 6 months ago
Alternatives and similar repositories for StronglyUniversalStringHashing
Users that are interested in StronglyUniversalStringHashing are comparing it to the libraries listed below
Sorting:
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- bit & sketches data structures☆60Updated 6 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆109Updated 9 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated last month
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Hashing functions and PRNGs based on them☆163Updated 6 months ago
- Many functions in C for sorting the nibbles in an 8-byte word☆33Updated 10 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 5 years ago
- An-source C library developed and used at AppNexus.☆110Updated 5 years ago
- A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren☆58Updated 3 years ago
- Binary floating-point to decimal string conversion algorithm.☆104Updated 7 years ago
- BSD Licensed Bignum Library☆233Updated last year
- C library implementing the ridiculously fast CLHash hashing function☆280Updated last year
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- generate perfect hashes (alpha)☆77Updated 3 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- MetroHash v1: Exceptionally fast and statistically robust hash functions☆370Updated 2 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- No sane compiler would optimize atomics: the presentation☆106Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- A dependency-based coroutine scheduler☆45Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 3 years ago
- fast SIMD-able JIT regular expression compiler☆196Updated 10 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- A C++ library for concurrent programming☆71Updated 4 years ago
- ♥ Janusz Brzozowski☆164Updated last year