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☆129Updated 11 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- A collection of succinct data structures☆211Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆120Updated 8 years ago
- Succinct Data Structure Library☆108Updated 12 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- 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☆85Updated last year
- Bloom-filter based minimal perfect hash function library☆269Updated 4 months ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Fast decoder for VByte-compressed integers☆125Updated 2 weeks ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Succinct data structures in C/C++☆91Updated last year
- A collection of string sorting algorithms☆55Updated 3 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- bit & sketches data structures☆60Updated 7 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Succinct Data Structure Library 3.0☆99Updated last week
- Suite of universal indexes for Highly Repetitive Document Collections☆22Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year