sampling-tree
v0.1.0 GrowingA 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.
Quick Verdict
- ✕Not updated for 1+ year
- !Pre-1.0: API may have breaking changes
- ✓Permissive license (MIT)
Security
Deep Insights
6 downloads in the last 30 days (0/day), up 200% from the previous period.
Despite being 1+ years old, sampling-tree hasn't reached 1.0 yet. Expect potential API changes between versions.
At 7KB, sampling-tree is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
