rank-select
Here are 9 public repositories matching this topic...
A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
-
Updated
Jan 8, 2023 - C++
Succinct data structures and more for Zig. Perfect Hash, Elias-Fano compression, Rank/Select and SymSpell
-
Updated
Jul 4, 2026 - Zig
Dynamic succint/compressed rank&select and fenwick tree data structure
-
Updated
Oct 10, 2019 - C++
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.
-
Updated
Mar 7, 2022 - Rust
A C++ implementation of the Wavelet Tree — a succinct data structure for compressed sequence representation with rank, select, and access operations. Includes an interactive CLI demo and comprehensive documentation.
-
Updated
Jun 25, 2026 - C++
Implementation of: an efficient basic bitvector library with constant-time set and get words; a succint, constant-time bit-vector rank-support data structure; a succint, logarithmic-time bit-vector select-support data structure; and wavelet tree construction on arbitrary texts, with serialization, access, rank, and select query support.
-
Updated
Nov 24, 2019 - C++
Succinct data structures
-
Updated
Jul 14, 2026 - Rust
Portable packed bit-set for Standard ML (MLton + Poly/ML): persistent set algebra, popcount, ascending iteration, fixed 32-bit chunks.
-
Updated
Jul 12, 2026 - Standard ML
Improve this page
Add a description, image, and links to the rank-select topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the rank-select topic, visit your repo's landing page and select "manage topics."