Provides a simple Trie implementation for storing "keys" composed of "atoms".
The trie imposes restrictions on the key and value types: - keys must be: Clone + Default + Ord + FromIterator (aggregate trait: TrieKey) - atoms must be: Copy + Default + PartialEq + Ord (aggregate trait: TrieAtom) - values must be: Default (aggregate trait: TrieValue)
(where A represents the Atom type that the key will be represented as)
With these restrictions in place, the trie implements a reasonably efficient mechanism for: - prefix matching - representing large quantities of data with common prefixes
If you don't need prefix matching, then a HashMap is almost always a better choice than a trie...
toml
[dependencies]
trying = "0.3"
Apache 2.0 licensed. See LICENSE for details.