#index #indexing #bits #bitvector

indexed_bitvec_core

Core operations on indexed bitvectors including (hopefully) fast rank and select operations

7 stable releases

4.0.0 Jan 13, 2019
3.1.1 Jan 8, 2019
3.0.0 Dec 24, 2018
2.2.0 Dec 23, 2018
2.0.0 Jul 22, 2018

#897 in Algorithms

Download history 8/week @ 2022-03-04 30/week @ 2022-03-11 33/week @ 2022-03-18 9/week @ 2022-03-25 11/week @ 2022-04-01 10/week @ 2022-04-08 10/week @ 2022-04-15 14/week @ 2022-04-22 46/week @ 2022-04-29 35/week @ 2022-05-06 129/week @ 2022-05-13 31/week @ 2022-05-20 53/week @ 2022-05-27 54/week @ 2022-06-03 7/week @ 2022-06-10 12/week @ 2022-06-17

128 downloads per month
Used in 3 crates (2 directly)

Apache-2.0

72KB
1.5K SLoC

Indexed Bitvector

Build status Latest version Documentation

This library provides an indexing system for bitvectors which should hopefully allow fast rank and select operations.

This library is based on the design proposed by Zhou, Andersen and Kaminsky in Space–Efficient, High–Performance Rank & Select Structures on Uncompressed Bit Sequences.

See also

I think there is an implementation of the same approach in a Haskell succinct vector library.

Zhou, Andersen and Kaminsky. Space–Efficient, High–Performance Rank & Select Structures on Uncompressed Bit Sequences

No runtime deps