sampling-tree vs orx-tree vs trie

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.

A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.

A highly general and customizable trie library