succinct-data-structure

🏅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.

Succinct data structures in C/C++

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

🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.

C++17 library that packed some of succinct data structures and algorithms supports.

Succinct Rank/Select Data Structures on Trits

A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.

FM-Index for Rust

FID (Fully Indexable Dictionary) implementation for Rust

LOUDS implementation for Rust

Draft specification for bit popcount in JavaScript.

📉 Disk Storage of Compressed k-mer Dictionaries, with or without Random Access in Main Memory.

Succinct Trie for Go. Support Marshalling

Implementation project of the paper titled: "Succinct Greedy Geometric Routing Using Hyperbolic Geometry"

[DEPRECATED] Succinct Data Structures library for Rust