Module sparse 

A sparse bit vector with rank1, rank0 and select1 support. The vector requires O(n log u/n) + 2n + o(n) bits of space, where n is the number of bits in the vector and u is the number of 1-bits. The vector is constructed from a sorted list of indices of 1-bits, or from an existing BitVec.

Structs

SparseRSVec

A succinct representation of a sparse vector with rank and select support. It is a thin wrapper around an EliasFanoVec that compresses the indices of 1-bits.