# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO # # When uploading crates to the registry Cargo will automatically # "normalize" Cargo.toml files for maximal compatibility # with all versions of Cargo and also rewrite `path` dependencies # to registry (e.g., crates.io) dependencies. # # If you are reading this file be aware that the original Cargo.toml # will likely look very different (and much more reasonable). # See Cargo.toml.orig for the original contents. [package] edition = "2021" name = "sampling-tree" version = "0.1.0" build = false autobins = false autoexamples = false autotests = false autobenches = false 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::()` where `T` is weight datatype. """ homepage = "https://github.com/BenJourdan/sampling-tree" readme = "README.md" keywords = [ "sampling", "tree", "data-structures", "statistics", "sampling-tree", ] categories = ["data-structures"] license = "MIT" repository = "https://github.com/BenJourdan/sampling-tree" [profile.bench] opt-level = 3 lto = true [profile.release] opt-level = 3 lto = true [profile.test] opt-level = 3 [lib] name = "sampling_tree" path = "src/lib.rs" [[bench]] name = "simple" path = "benches/simple.rs" harness = false [dependencies.criterion] version = "0.5.1" features = ["csv"] [dependencies.human-units] version = "0.2.0" [dependencies.num] version = "0.4.3" [dependencies.rand] version = "0.8.5" [dev-dependencies.indicatif] version = "0.17.8"