23 releases
Uses old Rust 2015
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 |
#1354 in Data structures
31,793 downloads per month
Used in 48 crates
(9 directly)
33KB
677 lines
Sequence Trie
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.
Usage
Add sequence_trie
to your Cargo.toml
.
[dependencies]
sequence_trie = "*"
See Also
- Radix Trie – a trie operating on byte-strings, with better performance and a less ergonomic API.
License
Licensed under either of:
at your option.
Contribution
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.
Dependencies
~160KB