#计算机科学#🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
翻译 - learned先进的学习数据结构，可在数十亿个项目的阵列中以比传统索引少几个数量级的空间进行快速查找，前身，范围搜索和更新
Sux4J is an effort to bring succinct data structures to Java.
#算法刷题#Rust libraries and programs focused on succinct data structures
Memory efficient trie (prefix tree) library based on LOUDS
Python bindings to Succinct Data Structure Library 2.0
High performance LOUDS (Level-Order Unary Degree Sequence) library
High performance FID (Fully Indexable Dictionary) library
String map implementation through Fast Succinct Trie
Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
#算法刷题#🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
Dynatrace FM-Index library
🚀 The first fully-learned approach to the Range Minimum Query (RMQ) problem, providing robust theoretical guarantees and novel space-time trade-offs with respect to other known indexing solutions
C++17 library that packed some of succinct data structures and algorithms supports.
#算法刷题#A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.
