🏅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

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

Succinct data structures in C/C++

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.

FM-Index for Rust

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.

Succinct Rank/Select Data Structures on Trits

FID (Fully Indexable Dictionary) implementation for Rust

Dynatrace FM-Index library

LOUDS implementation for Rust

Draft specification for bit popcount in JavaScript.

🚀 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 systematic solutions