mettienne / tiered-vector
Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(1) and insertion and deletion in time O(n^ε) for ε > 0 while using o(n) extra space.
☆49Updated 7 months ago
Related projects ⓘ
Alternatives and complementary repositories for tiered-vector
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- ☆25Updated 7 years ago
- Vectorized version of the PCG random number generator☆75Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- For details, see the blog post:☆31Updated 11 months ago
- finding set bits in large bitmaps☆15Updated 8 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆60Updated 9 months 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 …☆22Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆50Updated 6 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- ☆49Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆33Updated 5 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆16Updated 6 years ago