injinj / smhasherLinks
Automatically exported from code.google.com/p/smhasher
☆16Updated 4 years ago
Alternatives and similar repositories for smhasher
Users that are interested in smhasher are comparing it to the libraries listed below
Sorting:
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last week
- A small DFA for under 16 states☆53Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Backtrace.io's resilient log record framing format☆40Updated 3 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- 8-bit Xor Filter in C99☆62Updated 5 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- fixed-length integer trim☆35Updated 2 years ago
- ☆28Updated 3 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)☆40Updated 7 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- A CPace PAKE implementation using libsodium.☆37Updated 4 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- ☆42Updated 2 years ago
- WebR2sync+☆12Updated 8 years ago
- a 64-bit histogram / quantile sketch☆59Updated 10 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A high performance WebAssembly interpreter in C. Moved here:☆18Updated 5 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆76Updated 3 years ago