Currently the bitvector only supports rank1/select1, need to add corresponding operations on 0, for rank it is straightforward rank1(i)-i, for select I suggest index duplication since it is has quite low overhead. Note that in pasta bitvector there is an implementation for select0 using select1 index without additional space overhead but queries are slower.
Currently the bitvector only supports rank1/select1, need to add corresponding operations on 0, for rank it is straightforward rank1(i)-i, for select I suggest index duplication since it is has quite low overhead. Note that in pasta bitvector there is an implementation for select0 using select1 index without additional space overhead but queries are slower.