lemire / fasthashing
A Variable-Length String Hashing Library in C++
☆44Updated 5 years ago
Alternatives and similar repositories for fasthashing:
Users that are interested in fasthashing are comparing it to the libraries listed below
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Feed-forward Bloom filters☆52Updated 13 years ago
- A C++ library for integer array compression☆28Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Memory-mapped storage library☆76Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated 11 months ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Vectorized intersections (research code)☆14Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- For details, see the blog post:☆32Updated last year
- fixed-length integer trim☆33Updated last year
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆64Updated last year
- M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.☆16Updated 12 years ago
- Example program for BoostCon11 talk☆37Updated 13 years ago
- iomux - High performance aynchronous I/O multiplexing and timers☆14Updated 9 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 7 years ago
- Benchmark and visualization of various compression algorithms☆23Updated 9 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 5 years ago
- A comparison between different integer set techniques☆14Updated 6 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago