Crates.io | sequence_trie |
lib.rs | sequence_trie |
version | 0.3.6 |
source | src |
created_at | 2014-11-21 00:04:00.629431 |
updated_at | 2018-10-30 03:16:54.115703 |
description | Trie-like data-structure for storing sequences of values. |
homepage | |
repository | https://github.com/michaelsproul/rust_sequence_trie |
max_upload_size | |
id | 188 |
size | 36,270 |
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 PartialEq
, Eq
, Hash
and 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.
Add sequence_trie
to your Cargo.toml
.
[dependencies]
sequence_trie = "*"
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.