An indexed bitvector with (hopefully) fast rank and select operations.
Core operations on indexed bitvectors including (hopefully) fast rank and select operations.
A Vec-like collection which guarantees stable indices and features O(1) element deletion (semantically similar to `Vec<Option<T>>`). Useful for allocations in graphs or similar data structures.
An optimized implementation of Sebastiano Vigna's Elis-Fano quasi succint datastructure.
Addresses memory by bits, for packed collections and bitfields
Simplify Graphs in Rust. Introduces IdVec, which automatically creates Ids for each new object, reusing deleted Ids.
bitset implementation with support for atomic operations
Utilities for indexed collections
High-performance succinct data structures for Rust
A lightweight rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.
A fast, efficient, and pure Rust bitset implementation for high-performance data indexing and analytics.
A simple implementation of a bit vector built on top of Vec<u8>