lemire / fastscancountLinks
Fast implementations of the scancount algorithm: C++ header-only library
☆26Updated 5 years ago
Alternatives and similar repositories for fastscancount
Users that are interested in fastscancount are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- A C++ library for integer array compression☆29Updated 3 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- A Variable-Length String Hashing Library in C++☆44Updated 5 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- ☆26Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 10 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- SIMDized check which bytes are in a set☆28Updated 6 years ago