fclaude / libcds
Compact Data Structures Library
☆124Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for libcds
- Compact Data Structures Library☆98Updated 2 years ago
- Dynamic succinct/compressed data structures☆111Updated 6 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- A collection of succinct data structures☆195Updated 10 months ago
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Succinct Data Structure Library☆105Updated 11 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆115Updated 7 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 …☆21Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆126Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 7 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated 3 months ago
- High-performance dictionary coding☆103Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Bloom-filter based minimal perfect hash function library☆248Updated last year
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- Fast differential coding functions (using SIMD instructions)☆50Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year