fclaude / libcds2
Compact Data Structures Library
☆98Updated 2 years ago
Alternatives and similar repositories for libcds2:
Users that are interested in libcds2 are comparing it to the libraries listed below
- Compact Data Structures Library☆124Updated 10 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 8 months ago
- Dynamic succinct/compressed data structures☆112Updated 8 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- Compact Tree Representation☆16Updated 7 years ago
- A collection of succinct data structures☆200Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Succinct Data Structure Library☆105Updated 11 years ago
- Experiments with array layouts for comparison-based searching☆82Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 9 months ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆104Updated 10 years ago
- Succinct Data Structure Library 3.0☆94Updated 5 months ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated 11 months ago
- Fast decoder for VByte-compressed integers☆121Updated 8 months ago
- TU DOrtmund lossless COMPression framework☆17Updated 5 months ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A library of inverted index data structures☆148Updated 2 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago