Bulat-Ziganshin / FARSHLinks
Fast and Reliable (but not Secure) Hash
☆55Updated 7 years ago
Alternatives and similar repositories for FARSH
Users that are interested in FARSH are comparing it to the libraries listed below
Sorting:
- Fast decoder for VByte-compressed integers☆125Updated last month
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Fastest Histogram Construction☆73Updated 3 years ago
- experimental data compression algoritm☆22Updated 9 years ago
- Experimental compression format (unmaintained, do not use!)☆32Updated 9 years ago
- Experimental parallel compression algorithm☆27Updated 8 years ago
- Marlin: high throughput entropy compressor☆30Updated 2 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 10 months ago
- A Loss-less data compression algorithm inspired by LZMA☆43Updated 9 years ago
- C Minimal Perfect Hashing Library☆88Updated 8 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- PPM compressor with high compression ratio.☆33Updated 7 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 10 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- LZSSE compression codec ported to SIMDe☆19Updated 5 years ago
- Hashing functions and PRNGs based on them☆166Updated 3 weeks ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- generate perfect hashes (alpha)☆79Updated 3 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Automatically exported from code.google.com/p/mmc☆29Updated 3 years ago
- FPC - Fast Prefix Coder☆31Updated 3 years ago
- ☆144Updated last year
- Branchless UTF-8 decoder☆36Updated 8 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆276Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆85Updated last year
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆170Updated 9 months ago