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 11 months ago
Alternatives and similar repositories for tiered-vector:
Users that are interested in tiered-vector are comparing it to the libraries listed below
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 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 benchmark for sorting algorithms☆59Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- 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
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆25Updated 8 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago