sbits 0.1.0

Succinct data structures: near-optimal space with efficient queries.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
# succ

[![Documentation](https://docs.rs/sbits/badge.svg)](https://docs.rs/sbits)


Succinct data structures: near-optimal space with efficient queries.

Dual-licensed under MIT or the UNLICENSE.

```rust
use succ::bitvec::BitVector;
use succ::elias_fano::EliasFano;

let bv = BitVector::new(&[0b1011], 64);
assert_eq!(bv.rank1(4), 3);
assert_eq!(bv.select1(2), Some(3));
```