[package]
name = "sampling-tree"
version = "0.1.0"
edition = "2021"
license = "MIT"
description = """
A simple sampling tree implementation for sampling discrete distributions with sparse dynamic updates.
This allows us to sample efficiently from a distribution given the relative importance of each datapoint.
Construction time is O(n), updating is O(log(n)), and sampling is O(log(n)).
The memory footprint is no more than twice the size of `n*std::mem::size_of::<T>()` where `T` is weight datatype.
"""
homepage = "https://github.com/BenJourdan/sampling-tree"
repository = "https://github.com/BenJourdan/sampling-tree"
readme = "README.md"
keywords = ["sampling", "tree", "data-structures", "statistics", "sampling-tree"]
categories = ["data-structures"]

[dependencies]
criterion = { version = "0.5.1", features = ["csv"] }
human-units = "0.2.0"

num = "0.4.3"
rand = "0.8.5"


[[bench]]
name = "simple"
harness = false


[profile.release]
opt-level = 3
lto = true


[profile.bench]
opt-level = 3
lto = true

[profile.test]
opt-level = 3
# lto = true


[dev-dependencies]
indicatif = "0.17.8"