lemire / fastscancount
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
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A C++ library for integer array compression☆29Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- How fast can we shuffle values?☆37Updated last year
- benchmarking positional population count☆14Updated last year
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- ☆25Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- String to Float Benchmark☆19Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- For details, see the blog post:☆32Updated last year
- LLVM-jitted bitmaps☆26Updated 4 years ago
- A Variable-Length String Hashing Library in C++☆44Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 2 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago