Compact Data Structures Library
☆102Jun 20, 2022Updated 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☆128Sep 4, 2014Updated 11 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- A tool that generates a data structure from a schema and some relational queries, using modern database techniques to make queries highly…☆10Jul 25, 2021Updated 4 years ago
- A word-aligned integer compression algorithm.☆13Jul 8, 2024Updated last year
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- ☆18Aug 31, 2022Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated last year
- Ranking Entity Types using the Web of Data☆30Nov 22, 2016Updated 9 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- A lightweight suffix-sorting library☆401Mar 25, 2020Updated 5 years ago
- Better code coverage tool for JavaScript.☆88May 21, 2020Updated 5 years ago
- Protect against backwards-incompatible serializations☆23May 21, 2021Updated 4 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Jan 6, 2026Updated last month
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Lock-free multithreaded memory allocation☆110Dec 14, 2016Updated 9 years ago
- A toolkit for simulating interactive information retrieval☆21Sep 7, 2018Updated 7 years ago
- Succinct vectors☆20Dec 29, 2018Updated 7 years ago
- Send textual messages to a Handle in a thread-friendly way☆29Aug 15, 2018Updated 7 years ago
- BEETL☆97Apr 15, 2023Updated 2 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Library that provides an actor style message-passing programming model (in C++).☆23Sep 1, 2015Updated 10 years ago
- Knowledge graph Entity and Word Embeddings for Retrieval☆11Nov 19, 2021Updated 4 years ago
- Examples of using Diderot☆11Sep 16, 2019Updated 6 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Aug 8, 2018Updated 7 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- LOUDS-trie implementation example (C++)☆14Nov 27, 2019Updated 6 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- A hash map using the BooPHF perfect hash function☆13Sep 25, 2016Updated 9 years ago
- finding set bits in large bitmaps☆15Nov 30, 2015Updated 10 years ago
- Haskell numerical ODE solvers☆14Aug 21, 2017Updated 8 years ago
- Go interface of Tkrzw☆13Jun 3, 2024Updated last year
- ☆28Jul 9, 2018Updated 7 years ago
- Simplified interface to the GHC API☆22Apr 4, 2019Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago