fclaude / libcds2Links
Compact Data Structures Library
☆101Updated 3 years ago
Alternatives and similar repositories for libcds2
Users that are interested in libcds2 are comparing it to the libraries listed below
Sorting:
- Compact Data Structures Library☆128Updated 11 years ago
- A collection of succinct data structures☆210Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Succinct Data Structure Library☆107Updated 12 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Dynamic succinct/compressed data structures☆110Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 3 months ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Succinct data structures in C/C++☆88Updated last year
- Fast decoder for VByte-compressed integers☆125Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- Compact Tree Representation☆16Updated 8 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Rolling Hash C++ Library☆189Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A library of inverted index data structures☆151Updated 2 years ago