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
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

[[bench]]
harness = false
name = "succ_bench"
path = "benches/succ_bench.rs"

[dependencies.thiserror]
version = "2.0"

[dev-dependencies.criterion]
version = "0.5"

[dev-dependencies.proptest]
version = "1.5"

[lib]
name = "sbits"
path = "src/lib.rs"

[package]
authors = ["Arc <attobop@gmail.com>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["data-structures", "algorithms"]
description = "Succinct data structures: near-optimal space with efficient queries."
documentation = "https://docs.rs/sbits"
edition = "2021"
homepage = "https://github.com/arclabs561/sbits"
keywords = ["succinct", "bitvec", "rank-select"]
license = "MIT OR Apache-2.0"
name = "sbits"
readme = "README.md"
repository = "https://github.com/arclabs561/sbits"
version = "0.1.0"

[[test]]
name = "property_tests"
path = "tests/property_tests.rs"