Module ranagrams::trie

efficient representation of word lists

Structs

Trie	The magical boundary between words and numbers, a Trie wraps a TrieNode and various things used for stringification, destringification, and various caches and denormalizations.
TrieNode	A node in a trie (retrieval tree) representing a word list. A TrieNode contains a boolean indicating whether it is the end of a word and a list of child nodes representing possible continuations of the prefix represented by the node itself.
TrieNodeBuilder	A disposable stage that launches a TrieNode. TrieNodeBuilders maintain a mutable state and functionality that are not necessary for a completed TrieNode.