Provides a bit-vector, an optimized replacement of the infamous std::vector<:b:ool>. In addition to the bit-vector, the library also provides implementations of STL algorithms tailored for bit-vectors.
- Updated
Jun 6, 2024 - C++
Provides a bit-vector, an optimized replacement of the infamous std::vector<:b:ool>. In addition to the bit-vector, the library also provides implementations of STL algorithms tailored for bit-vectors.
Dynatrace FM-Index library
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation.
Bit vector implementation that includes byte padding for safe serialization and deserialization.
Fixed sized bitarrays for OCaml.
Two class libraries in order to work with BitVectors (aka BitSets): the "raw" BitVector class and the ISet abstraction: BitVectorSet.
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.
A bit vector that supports fast rank and select
Add a description, image, and links to the bitvector-library topic page so that developers can more easily learn about it.
To associate your repository with the bitvector-library topic, visit your repo's landing page and select "manage topics."