sbits
| Crates.io | sbits |
| lib.rs | sbits |
| version | 0.1.0 |
| created_at | 2026-01-18 14:57:54.523128+00 |
| updated_at | 2026-01-18 14:57:54.523128+00 |
| description | Succinct data structures: near-optimal space with efficient queries. |
| homepage | https://github.com/arclabs561/sbits |
| repository | https://github.com/arclabs561/sbits |
| max_upload_size | |
| id | 2052448 |
| size | 55,655 |
Henry Wallace (arclabs561)
documentation
https://docs.rs/sbits
README
succ
Succinct data structures: near-optimal space with efficient queries.
Dual-licensed under MIT or the UNLICENSE.
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));