|0.3.6||Oct 30, 2018|
|0.3.5||Sep 9, 2017|
|0.3.4||Jul 31, 2017|
|0.3.0||Feb 14, 2017|
|0.0.2||Nov 21, 2014|
#30 in Data structures
7,466 downloads per month
Used in 44 crates (5 directly)
This is a generic Trie implementation that uses a hash map to store child nodes. The Trie is keyed by lists of type
K, which can be anything implementing
Clone. If your keys are explicit lists and you want to be able to store a different value for each element of a key, this might be the data structure for you!
For more information, see the API documentation.
sequence_trie to your
[dependencies] sequence_trie = "*"
- Radix Trie – a trie operating on byte-strings, with better performance and a less ergonomic API.
Licensed under either of:
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you shall be dual licensed as above, without any additional terms or conditions.